Loading...
Please wait, while we are loading the content...
Similar Documents
Time constrained modulo scheduling with global resource sharing.
| Content Provider | CiteSeerX |
|---|---|
| Author | Beckmann, Friedrich Laur, Rainer |
| Abstract | Commonly used scheduling algorithms in high-level syn-thesis only accept one process at a time and are not capa-ble of sharing resources across process boundaries. This results in the usage of at least one resource per operation type and process. A new method is proposed in order to overcome these restrictions and to share high-cost or lim-ited resources within a process group. This allows the use of less than one resource per operation type and process, while keeping the mutual independence of the involved processes. The method represents an extension of general scheduling algorithms and is not tied to a specific algorithm. It is ap-plied to the time constrained Force-Directed Scheduling al-gorithm. For this the scope of the scheduling is extended to the processes of the whole system and a two-part modifica-tion is applied to the original procedure. A multi-process example illustrates the resource sharing capabilities of the extension. 1. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Global Resource Time Constrained Modulo Operation Type Lim-ited Resource Original Procedure Involved Process Specific Algorithm Mutual Independence New Method High-level Syn-thesis Process Group Whole System Force-directed Scheduling Al-gorithm General Scheduling Algorithm Process Boundary Two-part Modifica-tion Multi-process Example |
| Content Type | Text |
