Abstract
This paper describes an efficient global microprogram optimization technique called modywt. It uses a dynamic microoperation priority weight function in the process of combining microoperations into microinstructions. modywt is tested with random microprograms generated for a simulated machine having ibm 360/40 system architecture. Performances of different global compaction algorithms are also compared with modywt using some metrices proposed in the software engineering literature for measuring software complexities.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
