Algorithms for VLSI Design Automation

Programming Project (for one or two persons): Overlapped Scheduling for High-Level Synthesis by Means of Tabu Search

Summary: As shortly explained in the book, the overlapped scheduling of an iterative data-flow graph implies that computations in a next iteration may start before finishing computations in the current iteration. In this project the mobility of operations should be exploited using tabu-search to arrive at a solution of the scheduling problem.

Detailed Description