Abstract
The high level of complexity and the high degree of parallelism involved in several modern microprogrammed systems imply the design of control units having an extremely large microcode. Consequently, the necessity of limiting the size of the control store pushed research in two directions: microcode compaction, for reducing the number of words, and microcode bit minimisation, for reducing the number of control bits in a single word. In this paper, a new method for the optimisation of microword length in large microprogrammed systems is addressed. Microcode bit optimisation is formulated as a covering problem applied to a choice of maximal compatibility classes, collecting operations that can share the same bit held in the microcode. Comparisons with most of the published approaches are given using some benchmarks: results obtained show that the proposed method saves microcode bits in several cases, while in the largest examples it grants a significant reduction in computation time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
