loading...
Bus minimization and scheduling of multi-chip systems
The State University of New York at Buffalo March 16-March 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GLSV.1995.516021Fifth Great Lakes Symposium on VLSI ( ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
M. Sheliga, Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA
E. Hsing-Mean Sha, Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA
This paper considers several different algorithms that reduce the required number of buses for multi-chip module design. An efficient polynomial time algorithm that calculates the minimum number of buses needed given a particular schedule is presented. We also present three algorithms that minimize the number of buses during scheduling. Experimental results are shown that illustrate the efficiency of the algorithms.
Index Terms:
multichip modules; circuit layout CAD; scheduling; signal flow graphs; logic CAD; bus minimization; scheduling; polynomial time algorithm; multi-chip module design; algorithm efficiency; signal flow graphs
Citation:
M. Sheliga, E. Hsing-Mean Sha, "Bus minimization and scheduling of multi-chip systems," glsvlsi, pp.40, Fifth Great Lakes Symposium on VLSI (GLSVLSI'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.