Loading...
Please wait, while we are loading the content...
Similar Documents
Force-directed scheduling in automatic data path synthesis (1987)
| Content Provider | CiteSeerX |
|---|---|
| Author | Paulin, P. G. Knight, J. P. |
| Description | The HAL system performs data path synthesis using a new scheduling algorithm that 1s part Of an interdependent scheduling and allocation scheme. This scheme uses an BStl-mate of the hardware allocation to guide and optimiza 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 a11 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(n*) complexity. We review and compare existing scheduling techniques. Mod-erate and difficult examples are used to illustrate the ef-fectiveness of the approach. 1. |
| File Format | |
| Language | English |
| Publisher | ACM Press |
| Publisher Date | 1987-01-01 |
| Publisher Institution | In DAC ’87: Proceedings of the 24th ACM/IEEE conference on Design automation |
| Access Restriction | Open |
| Subject Keyword | Allocation Information Scheduling Subtask Hardware Module Successor Operation Hardware Resource Interdependent Scheduling Path Synthesis Hardware Allocation Associated Side-effects A11 Operation New Scheduling Algorithm Automatic Data Path Synthesis Hal System Performs Interconnect Cost Allocation Scheme Feasible Control Step Assignment Iterative Force-directed Scheduling Algorithm Attempt Difficult Example Force-directed Scheduling |
| Content Type | Text |
| Resource Type | Article |
