Title
Some Experiments in Local Microcode Compaction for Horizontal Machines
Abstract
Microcode compaction is an essential tool for the compilation of high-level language microprograms into microinstructions with parallel microoperations. The purpose of the research reported in this paper is to compare four microcode compaction methods reported in the literature: first-come first-served, critical path, branch and bound, and list scheduling. In order to do this a complete, machine independent method of representing the microoperations of real machines had to be developed; and the compaction algorithms had to be recast to use this representation. The compaction algorithms were then implemented and tested on microcode produced by a compiler for a high-level microprogramming language. The results of these experiments were that for all cases examined the first-come first-served and list scheduling algorithms produced microcode compacted into a minimal number of microinstructions in time that was a polynomial function of order two of the number of input microoperations.
Year
DOI
Venue
1981
10.1109/TC.1981.1675826
IEEE Trans. Computers
Keywords
Field
DocType
high-level language microprograms,input microoperations,microcode compaction,list scheduling,list scheduling algorithm,high-level microprogramming language,compaction algorithm,local microcode compaction,parallel microoperations,minimal number,microcode compaction method,horizontal machines,polynomials,production,scheduling algorithm,maintenance engineering,reliability engineering,high level languages,parallel processing,microprogramming,compaction,testing
Branch and bound,Microcode,Programming language,Polynomial,List scheduling,Computer science,Parallel computing,Compiler,Critical path method,Compaction
Journal
Volume
Issue
ISSN
30
7
0018-9340
Citations 
PageRank 
References 
109
37.63
12
Authors
4
Search Limit
100109
Name
Order
Citations
PageRank
S. Davidson110937.63
david landskov224584.03
bruce d shriver327091.27
patrick w mallett425487.09