Abstract
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered pool of strings that represent regions in the search space. New strings are produced from existing strings using the genetic-based operators of recombination and mutation. Combining these operators with natural selection results in the efficient use of hyperplane information found in the problem to guide the search. The searches are not greatly influenced by local optima or non-continuous functions. Genetic algorithms have been successfully used in problems such as the traveling salesperson and scheduling job shops. Microcode compaction can be modeled as these same types of problems, which motivates the application of genetic algorithms in this domain.
- {All86} V. H. Allan. A Critical Analysis of the Global Optimization Problem for Horizontal Microcode. PhD thesis, Computer Science Department, Colorado State University, Fort Collins, Colorado, 1986. Google Scholar
Digital Library
- {BDM+88} S. J. Beaty, M. R. Duda, R. A. Mueller, P. H. Sweany, and J. Varghese. "Optimization issues for a retargetable microcode compiler". MicroArch, 3(1):5--15, December 1988.Google Scholar
- {Boo87} L. Booker. "Improving search in genetic algorithms". In Lawrence Davis, editor, Genetic Algorithms and Simulated Annealing, pages 61--73. Morgan Kaufmann, 1987.Google Scholar
- {CS89} Gary A. Cleveland and Stephen F. Smith. "Using genetic algorithms to schedule flow shop releases". In Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, 1989. Google Scholar
Digital Library
- {DeJ86} K. DeJong. An Analysis of Reproduction and Crossover in a Binary - coded Genetic Algorithm. PhD thesis, University of Michagan, Ann Arbor, 1986.Google Scholar
- {Fis81} J. A. Fisher. "Trace scheduling: A technique for global microcode compaction". IEEE Transactions on Computers, C-30(7):478--490, July 1981.Google Scholar
Digital Library
- {Gol89} David Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989. Google Scholar
Digital Library
- {HMS87} M. A. Howland, R. A. Mueller, and P. H. Sweany. "Trace scheduling optimization in a retargetable microcode compiler". In Proceedings of the 20th Microprogramming Workshop (MICRO-20), Colorado Springs, CO, December 1987. Google Scholar
Digital Library
- {IIol75} John Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975.Google Scholar
Digital Library
- {LDSM80} D. Landskov, S. Davidson, B. D. Shriver, and P. W. Mallett. "Local Microcode Compaction Techniques". ACM Computing Surveys, 12(3):261--294, September 1980. Google Scholar
Digital Library
- {Nic85} Alexandru Nicolau. "Percolation scheduling: A parallel compilation technique". Technical report, Department of Computer Science, Cornell University, Ithaca, New York, May 1985. Google Scholar
Digital Library
- {Rob79} E. L. Robertson. "Microcode Bit Optimization is NP-complete". IEEE Transactions on Computers, C-28(4):316--319, April 1979.Google Scholar
Digital Library
- {Sys90} Gilbert Syswerda. "Schedule optimization using genetic algorithms". In L. Davis, editor, The Genetic Algorithms Handbook. 1990.Google Scholar
- {Veg82} S. R. Vegdahl. Local Code Generation and Compaction in Optimizing Microcode Compilers. PhD thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, 1982. Google Scholar
Digital Library
- {WSF89} D. Whitley, T. Starkweather, and D. Fuquay. "Scheduling problems and traveling salemen: The genetic edge recombination operator". In Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, 1989. Google Scholar
Digital Library
- {WSS90} D. Whitley, T. Starkweather, and D. Shaner. "The traveling saleman and sequence scheduling quality solution using genetic edge recombination". In L. Davis, editor, The Genetic Algorithms Handbook. 1990.Google Scholar
Index Terms
Motivation and framework for using genetic algorithms for microcode compaction
Recommendations
Motivation and framework for using genetic algorithms for microcode compaction
MICRO 23: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitectureGenetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered pool of strings that represent regions in the search space. New strings are ...
On enhancing genetic algorithms using new crossovers
This paper investigates the use of more than one crossover operator to enhance the performance of genetic algorithms. Novel crossover operators are proposed such as the collision crossover, which is based on the physical rules of elastic collision, in ...
Compact Genetic Algorithms using belief vectors
Abstract: Instead of the genetic operators such as crossover and mutation, compact Genetic Algorithms (cGAs) use a probability vector (PV) for the current population to reproduce offsprings of the next generation. Therefore, the original cGA can be ...






Comments