完整後設資料紀錄
DC 欄位語言
dc.contributor.authorSHIAU, YHen_US
dc.contributor.authorCHUNG, CPen_US
dc.date.accessioned2014-12-08T15:04:55Z-
dc.date.available2014-12-08T15:04:55Z-
dc.date.issued1992-05-01en_US
dc.identifier.issn0167-8191en_US
dc.identifier.urihttp://hdl.handle.net/11536/3446-
dc.description.abstractSuperscalar processing is a technique to improve uniprocessor performance by exploiting instruction-level parallelism to issue and execute more than one instruction per clock cycle. To achieve high performance, the instruction sequence must be arranged so that the maximum instruction-level parallelism and hence the minimum execution time are achieved. Microcode compaction is an essential task in the compilation of high-level language programs into microprograms. Four algorithms are widely used in microcode compaction: the first-come-first-served algorithm, critical path algorithm, branch and bound algorithm, and list scheduling algorithm. The objective of this research is to study the adaptability and effectiveness, and to modify the four algorithms so that they can be applied to the instruction scheduling in a basic block of superscalar processor systems to minimize the execution time of a program. Experiments are conducted to examine the adaptability and effectiveness of each algorithm.en_US
dc.language.isoen_USen_US
dc.subjectSUPERSCALAR PROCESSINGen_US
dc.subjectINSTRUCTION SCHEDULINGen_US
dc.subjectMICROCODE COMPACTIONen_US
dc.subjectDATA DEPENDENCEen_US
dc.titleADOPTABILITY AND EFFECTIVENESS OF MICROCODE COMPACTION ALGORITHMS IN SUPERSCALAR PROCESSINGen_US
dc.typeArticleen_US
dc.identifier.journalPARALLEL COMPUTINGen_US
dc.citation.volume18en_US
dc.citation.issue5en_US
dc.citation.spage497en_US
dc.citation.epage510en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:A1992HW44500002-
dc.citation.woscount3-
顯示於類別:期刊論文