Theses and Dissertations Abstracts Full Information
Title | Scheduling and allocation in high-level synthesis using genetic algorithm | |
Author | Ali, Shahid | |
Department | Computer Science | |
Degree | Master of Science | |
Date Submitted | June 1994 | |
Date Accepted | 29 May 1994 | |
Collation | xi, 114 leaves : ill. ; 28 cm | |
Shelflist Number | A 1.A662 | |
Full Text PDF | Available Here (PDF) |
Committee Advisor | Committee Members | ||||
Shafique , Muhammad | Benten,
M. S. T. Sait, Sadiq M. Maghrabi, T. H. |
English Abstract | |
High-level Synthesis (HLS) is the process of automatically translating abstract behavioral models of digital systems to implementable hardware. Operation scheduling and hardware allocation are the two most important phases in the synthesis of circuits from behavioral specification. Scheduling and allocation can be formulated as an optimization problem. In this work a unique approach to scheduling and allocation problem using the genetic paradigm is described. The main contributions include: (1) a new chromosomal representation for scheduling and for two subproblems of allocation, and (2) two novel crossover operators to generate legal schedules. In addition the application of tabu search to scheduling and allocation is also implemented and studied. Both techniques have been tested on various benchmarks and results obtained for data-oriented control-data flow graphs (CDFGs) are compared with other implementations. A novel interconnect optimization technique using genetic algorithm is also realized. | |
Arabic Abstract | |
There is no Arabic Abstract !! |
|
Search by: [Author Family Name]
[Author First Name] [Title] [Date Submitted]
[Date Accepted]
[Shelflist Number] |
Browse
by: [Author Family Name]
[Author First Name] [Committee Advisor Family Name ] [Committee Advisor First Name]
[Committee Member Family Name] [Committee Member First Name] [Title] [Department] [Shelflist Number] [Degree] |
|
Copyright © 2003, Library Information System (LIS), ITC. |