Abstract
In this paper we present a variant of the simulated evolution technique for local microcode compaction. The simulated evolution is a general optimization method based on an analogy with the natural selection process in biological evolution. The proposed technique combines simulated evolution with list scheduling, in which simulated evolution is used to determine suitable priorities which lead to a good solution by applying list scheduling as a decoding heuristic. The proposed technique is an effective method that yields good results without problem-specific parameter tuning on test problems. We demonstrate the effectiveness of our technique by comparing it with the existing microcode compaction techniques for randomly generated data dependency graphs. The proposed scheme offers considerable improvement in the number of microinstructions compared with the existing techniques with comparable cpu 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 callDisclaimer: 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.
