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

Authors:
Orlando Moreira;Twan Basten;Marc Geilen;Sander Stuijk
Affiliations:
ST Ericsson, Eindhoven;Eindhoven University of Technology and Embedded Systems Institute, Eindhoven;Eindhoven University of Technology, Eindhoven;Eindhoven University of Technology , Eindhoven
Venue:
IEEE Transactions on Computers
Year:
2010

Citing 0
Cited 4

Pareto efficient design for reconfigurable streaming applications on CPU/FPGAs

Proceedings of the Conference on Design, Automation and Test in Europe
Performance Analysis of Reconfigurations in Adaptive Real-Time Streaming Applications

ACM Transactions on Embedded Computing Systems (TECS)
A new data flow analysis model for TDM

Proceedings of the tenth ACM international conference on Embedded software
Dataflow analysis for multiprocessor systems with non-starvation-free schedulers

Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems

Quantified Score

Hi-index	14.98

Visualization

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.