OPERATION SCHEDULINGFOR PARALLEL FUNCTIONAL UNITS USING GENETIC ALGORITHMS

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 4, Issue , 1999, Pages 1997-2000

  Zeitlhofer, Th ^a   Wess, B ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

REGRESSION ANALYSIS; VERY LONG INSTRUCTION WORD ARCHITECTURE;

CROSSOVER AND MUTATION; FAST CONVERGENCE; FITNESS FUNCTIONS; FUNCTIONAL UNITS; GENETIC OPERATORS; PROBLEM PARAMETERS; REGISTER ALLOCATION; SCHEDULING PROBLEM; SEARCH SPACES; SPACE COMPLEXITY;

GENETIC ALGORITHMS;

EID: 84893753150     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.1999.758319     Document Type: Conference Paper

References (7)

1. [ l ] P. Faraboschi, G. Desoli, and J.A. Fisher, “The latest word in digital and media processing”, IEEE Signal Processing Magazine, March 1998.
2. D. Landskov, S.Davidson, B. Shriver, and P. W.Mallett, “Local microcode compaction techniques”, ACM Computing Surveys,vol. 12, pp. 261-294, September 1980.
3. J. A. Fisher, “Trace scheduling: a technique for global microcode compaction”, IEEE Transactionson Computers, vol. C-30, pp. 478490, July 1981.
4. T. Chung, CHARTS: A compiler for hard real-time systems, PhD thesis, Purdue University, August 1995.
5. S.J. Beaty, Instruction Scheduling Using Genetic Algorithms, PhD thesis, Department of Mechanical Engineering, Colorado StateUniversity, Fort Collins, Colorado 80523, October 1991.
6. J. Holland, Adaptation in Natural and Art$cial Systems, PhD thesis, University of Michigan, Ann Arbor, MI, 1975.
7. R. E. Chrochiere and A. V. Oppenheim, “Analysis of linear digital networks”, Proceedings ofthe ZEEE, vol. 63, pp. 581-595, April 1975.