skip to main content
article
Free Access

Motivation and framework for using genetic algorithms for microcode compaction

Published:01 January 1991Publication History
Skip Abstract Section

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.

References

  1. {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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. {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 ScholarGoogle Scholar
  3. {Boo87} L. Booker. "Improving search in genetic algorithms". In Lawrence Davis, editor, Genetic Algorithms and Simulated Annealing, pages 61--73. Morgan Kaufmann, 1987.Google ScholarGoogle Scholar
  4. {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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. {DeJ86} K. DeJong. An Analysis of Reproduction and Crossover in a Binary - coded Genetic Algorithm. PhD thesis, University of Michagan, Ann Arbor, 1986.Google ScholarGoogle Scholar
  6. {Fis81} J. A. Fisher. "Trace scheduling: A technique for global microcode compaction". IEEE Transactions on Computers, C-30(7):478--490, July 1981.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. {Gol89} David Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. {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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. {IIol75} John Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. {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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. {Nic85} Alexandru Nicolau. "Percolation scheduling: A parallel compilation technique". Technical report, Department of Computer Science, Cornell University, Ithaca, New York, May 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. {Rob79} E. L. Robertson. "Microcode Bit Optimization is NP-complete". IEEE Transactions on Computers, C-28(4):316--319, April 1979.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. {Sys90} Gilbert Syswerda. "Schedule optimization using genetic algorithms". In L. Davis, editor, The Genetic Algorithms Handbook. 1990.Google ScholarGoogle Scholar
  14. {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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. {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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. {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 ScholarGoogle Scholar

Index Terms

  1. Motivation and framework for using genetic algorithms for microcode compaction

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM SIGMICRO Newsletter
                ACM SIGMICRO Newsletter  Volume 22, Issue 1
                January 1991
                20 pages
                ISSN:1050-916X
                DOI:10.1145/1096503
                Issue’s Table of Contents

                Copyright © 1991 Copyright is held by the owner/author(s)

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 January 1991

                Check for updates

                Qualifiers

                • article
              • Article Metrics

                • Downloads (Last 12 months)5
                • Downloads (Last 6 weeks)1

                Other Metrics

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!