loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth Great Lakes Symposium on VLSI
Hierarchical Scheduling in High Level Synthesis Using Resource Sharing Across Nested Loops
Ann Arbor, Michigan
March 04-March 06
ISBN: 0-7695-0104-4
Abhijit Ghosh, University of Cincinnati
Sandeep K. Lodha, University of Cincinnati
Ranga Vemuri, University of Cincinnati
This paper presents a resource-constrained scheduling algorithm for hierarchical behavioral specifications containing nested loops. The algorithm attempts to share resources across levels, to schedule operations that belong to different levels of the nested loop structures in the specifications as well as operations that belong to the same level. We compare the results of scheduling using our algorithm with those obtained using traditional list scheduling with no sharing of resources among different levels of the specification. These results show an average improvement of 23.47% in terms of number of control steps.
Citation:
Abhijit Ghosh, Sandeep K. Lodha, Ranga Vemuri, "Hierarchical Scheduling in High Level Synthesis Using Resource Sharing Across Nested Loops," glsvlsi, pp.140, Ninth Great Lakes Symposium on VLSI, 1999
Usage of this product signifies your acceptance of the Terms of Use.