research-article

Buffer Sizing for Rate-Optimal Single-Rate Data-Flow Scheduling Revisited

Authors:

Orlando Moreira,

Twan Basten,

Marc Geilen,

Sander StuijkAuthors Info & Claims

IEEE Transactions on Computers, Volume 59, Issue 2

Pages 188 - 201

https://doi.org/10.1109/TC.2009.155

Published: 01 February 2010 Publication History

Publisher Site

Abstract

Single-Rate Data-Flow (SRDF) graphs, also known as Homogeneous Synchronous Data-Flow (HSDF) graphs or Marked Graphs, are often used to model the implementation and do temporal analysis of concurrent DSP and multimedia applications. An important problem in implementing applications expressed as SRDF graphs is the computation of the minimal amount of buffering needed to implement a static periodic schedule (SPS) that is optimal in terms of execution rate, or throughput. Ning and Gao [1] propose a linear-programming-based polynomial algorithm to compute this minimal storage amount, claiming optimality. We show via a counterexample that the proposed algorithm is not optimal. We prove that the problem is, in fact, NP-complete. We give an exact solution, and experimentally evaluate the degree of inaccuracy of the algorithm of Ning and Gao.

Cited By

View all

De Matteis TGianinazzi Lde Fine Licht JHoefler TButt AMi NChard K(2023)Streaming Task Graph Scheduling for Dataflow ArchitecturesProceedings of the 32nd International Symposium on High-Performance Parallel and Distributed Computing10.1145/3588195.3592999(225-237)Online publication date: 7-Aug-2023
https://dl.acm.org/doi/10.1145/3588195.3592999
Fradet PGirault AKrishnaswamy RNicollin XShafiei A(2022)RDF: A Reconfigurable Dataflow Model of ComputationACM Transactions on Embedded Computing Systems10.1145/354497222:1(1-30)Online publication date: 29-Oct-2022
https://dl.acm.org/doi/10.1145/3544972
Edwards STownsend RBarker MKim M(2019)Compositional Dataflow CircuitsACM Transactions on Embedded Computing Systems10.1145/327428018:1(1-27)Online publication date: 25-Jan-2019
https://dl.acm.org/doi/10.1145/3274280
Show More Cited By

Recommendations

Single machine common flow allowance scheduling with a rate-modifying activity

In this paper we consider single machine SLK due date assignment scheduling problem with a rate-modifying activity. In this model, the machine has a rate-modifying activity that can change the processing rate of machine under consideration. Hence the ...
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model ...
An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities

This paper considers a single-machine scheduling with linear deterioration rate of processing speed and multiple rate-modifying activities simultaneously. A rate-modifying activity can change the processing rate of machine under consideration, which ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 59, Issue 2

February 2010

144 pages

ISSN:0018-9340

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 February 2010

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

De Matteis TGianinazzi Lde Fine Licht JHoefler TButt AMi NChard K(2023)Streaming Task Graph Scheduling for Dataflow ArchitecturesProceedings of the 32nd International Symposium on High-Performance Parallel and Distributed Computing10.1145/3588195.3592999(225-237)Online publication date: 7-Aug-2023
https://dl.acm.org/doi/10.1145/3588195.3592999
Fradet PGirault AKrishnaswamy RNicollin XShafiei A(2022)RDF: A Reconfigurable Dataflow Model of ComputationACM Transactions on Embedded Computing Systems10.1145/354497222:1(1-30)Online publication date: 29-Oct-2022
https://dl.acm.org/doi/10.1145/3544972
Edwards STownsend RBarker MKim M(2019)Compositional Dataflow CircuitsACM Transactions on Embedded Computing Systems10.1145/327428018:1(1-27)Online publication date: 25-Jan-2019
https://dl.acm.org/doi/10.1145/3274280
Hendriks MAra HGeilen MBasten TMarin RJong RVlugt S(2019)Monotonic Optimization of Dataflow Buffer SizesJournal of Signal Processing Systems10.1007/s11265-018-1415-291:1(21-32)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s11265-018-1415-2
Bouakaz AFradet PGirault A(2017)Symbolic Analyses of Dataflow GraphsACM Transactions on Design Automation of Electronic Systems10.1145/300789822:2(1-25)Online publication date: 4-Jan-2017
https://dl.acm.org/doi/10.1145/3007898
Liu WXiao C(2016)An Efficient Technique of Application Mapping and Scheduling on Real-Time Multiprocessor Systems for Throughput OptimizationACM Transactions on Embedded Computing Systems10.1145/295005115:4(1-25)Online publication date: 2-Aug-2016
https://dl.acm.org/doi/10.1145/2950051
Dardaillon MMarquet KRisset TMartin JCharles H(2016)A New Compilation Flow for Software-Defined Radio Applications on Heterogeneous MPSoCsACM Transactions on Architecture and Code Optimization10.1145/291058313:2(1-25)Online publication date: 6-Jun-2016
https://dl.acm.org/doi/10.1145/2910583
Zhu XGeilen MBasten TStuijk S(2016)Multiconstraint Static Scheduling of Synchronous Dataflow Graphs Via Retiming and UnfoldingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2015.249516735:6(905-918)Online publication date: 18-May-2016
https://dl.acm.org/doi/10.1109/TCAD.2015.2495167
Salunkhe HLele AMoreira Ovan Berkel K(2016)Buffer allocation for real-time streaming applications running on heterogeneous multi-processors without back-pressureJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2015.09.00162:C(24-37)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1016/j.sysarc.2015.09.001
Nelson AGoossens KGirault AGuan N(2015)Distributed power management of real-time applications on a GALS multiprocessor SOCProceedings of the 12th International Conference on Embedded Software10.5555/2830865.2830882(147-156)Online publication date: 4-Oct-2015
https://dl.acm.org/doi/10.5555/2830865.2830882
Show More Cited By

Abstract

Cited By

Recommendations

Single machine common flow allowance scheduling with a rate-modifying activity

Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks

An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations