Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart


Share/Save/Bookmark

Heemstra de Groot, Sonia M. and Herrmann, Otto E. (1990) Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart. In: Workshop on Real Time Systems, Euromicro, 6-8 June 1990, Horsholm, Denemarken.

[img]
Preview
PDF
648Kb
Abstract:An algorithm based on an alternative scheduling approach for iterative acyclic and cyclid DFGs (data-flow graphs) with limited resources that exploits inter- and intra-iteration parallelism is presented. The method is based on guiding the scheduling algorithm with the information supplied by a scheduling-range chart. This scheduling range is relative to a reference operation and can be finite or infinite. The information in the scheduling-range chart is used during scheduling in order to optimize the sampling period. For cases where the precedence constraints do not allow a schedule in the originally selected optimal sampling period, the algorithm provides an adjustment procedure, thus always guaranteeing a solution. The delay of the processor-assignment phase increases the efficiency of the algorithm when the operations have processing times different from the unity and are nonpreemptive
Item Type:Conference or Workshop Item
Copyright:© 1990 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/16200
Official URL:http://dx.doi.org/10.1109/EMWRT.1990.128220
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 113085