ACM Home Page
Please provide us with feedback. Feedback
Force-directed scheduling in automatic data path synthesis
Full text PdfPdf (946 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 24th ACM/IEEE Design Automation Conference table of contents
Miami Beach, Florida, United States
Pages: 195 - 202  
Year of Publication: 1987
ISBN:0-8186-0781-5
Authors
P. G. Paulin  Dept. 5L40, Bell-Northern Research, P.O.Box 3511, Stn C, Ottawa, ONT. K1Y 4H7
J. P. Knight  Carleton University, Colonel By Dr, Ottawa, ONT. K1S 5B6
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 55,   Citation Count: 46
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/37888.37918
What is a DOI?

ABSTRACT

The HAL system performs data path synthesis using a new scheduling algorithm that is part of an interdependent scheduling and allocation scheme. This scheme uses an estimate of the hardware allocation to guide and optimize the scheduling subtask. The allocation information includes the number, type, speed and cost of hardware modules as well as the associated multiplexer and interconnect costs. The iterative force-directed scheduling algorithm attempts to balance the distribution of operations that make use of the same hardware resources: Every feasible control step assignment is evaluated at each iteration, for all operations. The associated side-effects on all the predecessor and successor operations are taken into account. All the decisions are global. The algorithm has O(n8 complexity. We review and compare existing scheduling techniques. Moderate and difficult examples are used to illustrate the effectiveness of the approach.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
O.D. Gajski, N.D. Dutt and B.M. Pangrle, "Silicon Compilation (Tutorial)*, Proceedings of the TEEE 1986 Custom Integrated Circu|ts Conference, Rochester NY, May 1986, pp. 102-110.
 
2
3
 
4
E.F. Girczyc and d.P. Knight, "An ADA to Standard Cell Hardware Compiler Based on Graph Grammars and Scheduling", Proc. of the IEEE International Conference on Computer Design (ICCD), October 1984, pp. 726-731.
 
5
 
6
P.G. Paulin, d.P. Knight, "Extended Design-Space Exploration in Automatic Oata Path Synthesis", Proceedings of the 1986 Canadian Conference on VLSI, October 1986, pp. 221-226.
7
 
8
C. Tseng, D.P. Siewiorek, "Automated Synthesis of Data Paths in Digital Systems", IEEE Transactions on CAD, duly 1986, pp. 379-395.
 
9
S. Davidson eta|, MSome Experiments in Local Microcode Compaction for Horizontal Machines", IEEE Transactions on Computers, duly 1981, pp. 460-477.
 
10
 
11
 
12
d, Nestor, D.E. Thomas, "Behavioral Synthes~s with Interfaces", Proceedings of the IEEE ICCAD-86 (International Conference on CAD), November t986, pp. 112-115.
 
13
B.M. Pangrle, O.O. GaJskl, "State Synthesis and Connectivity Binding for Microarchttecture Compilation", Proceedings of the IEEE ICCAD-86, November lg86, pp. 210-213.
 
14
 
15
 
16
P.G. Paulin, d.P. Knight, "Scheduling and Allocation for Plpellned ASICs", Submitted to the TEEE International Conference on Computer Design (ICCD "87). Awaiting acceptance,
 
17
H.Trtckey, "Flamel: A High-Level Hardware Compiler", IEEE Transactions on CAD, March 1987, pp.259-269.

CITED BY  46
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
P. G. Paulin: colleagues
J. P. Knight: colleagues