GSA: Scheduling and Allocation using Genetic Algorithm

(1994) GSA: Scheduling and Allocation using Genetic Algorithm. In: European Design Automation Conference with Euro-VHDL, Euro-DAC'94, Grenoble.

[img]
Preview
PDF
Shahid_EDAC_September1994.pdf

Download (210kB) | Preview

Abstract

This paper describes a unique approach to schedul- ing and allocation problem in high-level synthesis us- ing genetic algorithm (GA). This approach is di�er- ent from a previous attempt using GA [1] in many respects. Our contributions include: a new chromo- somal representation for scheduling and two subprob- lems of allocation; and two novel crossover operators to generate legal schedules. The approach has been tested on various benchmarks and results are com- pared with those obtained by other approaches such as simulated evolution, tabu search, HAL, SALSA II, STAR, etc.

Item Type: Conference or Workshop Item (Other)
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: AbdulRahman
Date Deposited: 26 Feb 2008 05:26
Last Modified: 01 Nov 2019 13:22
URI: https://eprints.kfupm.edu.sa/id/eprint/122