Genetic algorithms and instruction scheduling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Genetic algorithms and instruction scheduling

Full text

Pdf (647 KB)

Source

International Symposium on Microarchitecture archive
Proceedings of the 24th annual international symposium on Microarchitecture table of contents

Albuquerque, New Mexico, Puerto Rico

Pages: 206 - 211

Year of Publication: 1991

ISBN:0-89791-460-0

Author

Steven J. Beaty

NCR Microelectronics and Department of Mechanical Engineering, Colorado State University, Fort Collins, Colorado

Sponsors

IEEE-CS : Computer Society
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 43, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/123465.123507 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AM88	V. H. Allen , R. A. Mueller, Compaction with General Synchronous Timing, IEEE Transactions on Software Engineering, v.14 n.5, p.595-599, May 1988 [doi>10.1109/32.6137]
	Ban88	Utpal K. Banerjee, Dependence Analysis for Supercomputing, Kluwer Academic Publishers, Norwell, MA, 1988
	Bea91	Steven John Beaty, Instruction scheduling using genetic algorithms, Colorado State University, Fort Collins, CO, 1992
	BSKT79	U. Banerjee, S. Shen, D.J. Kuck, and R.A. Towle. "Time and parallel processor bounds for fortran-like loops", iEEE Transactions on Computers, C-28(9):660-670, Sep 1979.
	BW90	Graham Brightwell and Peter Winkler. "Counting linear extensions is #p-complete". DIMACS Technical Report 90-49, Bellcore, 445 South Street, Morristown, New Jersey, 07960, July 1990.
	BWJ90	Steven Beaty , Darrell Whitley , Gearold Johnson, Motivation and framework for using genetic algorithms for microcode compaction, Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture, p.117-124, November 27-29, 1990, Orlando, Florida, United States
	Cof76	E.G Coffman. Computer and Job-Shop Scheduling Theory. :Ion Wiley & Sons, New York, 1976.
	CS89	Gary A. Cleveland , Stephen F. Smith, Using genetic algorithms to schedule flow shop releases, Proceedings of the third international conference on Genetic algorithms, p.160-169, December 1989, George Mason University, United States
	GJ79	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	Gol89	David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	Hec77	Matthew S. Hecht, Flow Analysis of Computer Programs, Elsevier Science Inc., New York, NY, 1977
	Hol75	John H. Holland, Adaptation in natural and artificial systems, MIT Press, Cambridge, MA, 1992
	Knu73	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	LDSM80	David Landskov , Scott Davidson , Bruce Shriver , Patrick W. Mallett, Local Microcode Compaction Techniques, ACM Computing Surveys (CSUR), v.12 n.3, p.261-294, Sept. 1980 [doi>10.1145/356819.356822]
	PKL80	D.A. Padua, D.J. Kuck, and D.H. Lawrie. "High speed multiprocessors and compilation techniques". IEEE Transactions on Computers, C-29(9):763-776, Sept 1980.
	PW86	David A. Padua , Michael J. Wolfe, Advanced compiler optimizations for supercomputers, Communications of the ACM, v.29 n.12, p.1184-1201, Dec. 1986 [doi>10.1145/7902.7904]
	SB90	Philip Sweany , Steven Beaty, Post-compaction register assignment in a retargetable compiler, Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture, p.107-116, November 27-29, 1990, Orlando, Florida, United States
	SDX87	Bogong Su , Shiyuan Ding , Jian Wang , Jinshi Xia, Microcode compaction with timing constraints, Proceedings of the 20th annual workshop on Microprogramming, p.59-68, December 01-04, 1987, Colorado Springs, Colorado, United States [doi>10.1145/255305.255314]
	SMM+91	T. Starkweather, S. McDaniel, K. Mathias, C. Whitley, and D. Whitley. "A comparison of genetic sequencing operators". In Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan Kaufmann, 1991.
	Sys90	Gilbert Syswerda. "Schedule optimization using genetic algorithms". In L. Davis, editor, The Genetic Algorithms Handbook. 1990.
	Veg82	Steven Roger Vegdahl, Local code generation and compaction in optimizing microcode compilers, 1982
	Whi89	Darrell Whitley, The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best, Proceedings of the third international conference on Genetic algorithms, p.116-121, December 1989, George Mason University, United States
	WK88	D. Whitley and J. Kauth. "Genitor' a different genetic algorithm". In Proceeding of the Rocky Mountain Conference on Artificial Intelligence, pages 118-130. Denver, Co., 1988.
	WS90	Darrell Whitley , Timothy Starkweather, GENITOR II.: a distributed genetic algorithm, Journal of Experimental & Theoretical Artificial Intelligence, v.2 n.3, p.189-214, July/Sept. 1990 [doi>10.1080/09528139008953723]
	WSF89	Darrell Whitley , Timothy Starkweather , D'Ann Fuquay, Scheduling problems and traveling salesman: the genetic edge recombination, Proceedings of the third international conference on Genetic algorithms, p.133-140, December 1989, George Mason University, United States
	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.

CITED BY 5

	Alessandro De Gloria , Paolo Faraboschi , Mauro Olivieri, A non-deterministic scheduler for a software pipelining compiler, ACM SIGMICRO Newsletter, v.23 n.1-2, p.41-44, Dec. 1992
	Steve Haga , Andrew Webber , Yi Zhang , Nghi Nguyen , Rajeev Barua, Reducing code size in VLIW instruction scheduling, Journal of Embedded Computing, v.1 n.3, p.415-433, August 2005
	Mattias V. Eriksson , Oskar Skoog , Christoph W. Kessler, Optimal vs. heuristic integrated code generation for clustered VLIW architectures, Proceedings of the 11th international workshop on Software & compilers for embedded systems, March 13-14, 2008, Munich, Germany
	Rehab F. Abdel-Kader, Particle swarm optimization for constrained instruction scheduling, VLSI Design, v.2008 n.4, p.1-7, January 2008
	Hugh Leather , Edwin Bonilla , Michael O'Boyle, Automatic Feature Generation for Machine Learning Based Optimizing Compilation, Proceedings of the 2009 International Symposium on Code Generation and Optimization, p.81-91, March 22-25, 2009