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

S.M. Heemstra de Groot, O.E. Herrmann

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    2 Citations (Scopus)
    54 Downloads (Pure)

    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
    Original languageEnglish
    Title of host publicationEuromicro'90 Workshop on Real-Time Systems
    PublisherIEEE
    Pages8-16
    Number of pages9
    ISBN (Print)9780818620768
    DOIs
    Publication statusPublished - 1 Sep 1990
    Event2nd Euromicro Workshop on Real-Time Systems 1990 - Hørsholm, Denmark
    Duration: 6 Jun 19908 Jun 1990
    Conference number: 2

    Conference

    Conference2nd Euromicro Workshop on Real-Time Systems 1990
    CountryDenmark
    CityHørsholm
    Period6/06/908/06/90

    Keywords

    • METIS-113085
    • IR-16200

    Fingerprint Dive into the research topics of 'Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart'. Together they form a unique fingerprint.

    Cite this