The Community for Technology Leaders
Green Image
Issue No. 02 - February (2010 vol. 59)
ISSN: 0018-9340
pp: 188-201
Twan Basten , Eindhoven University of Technology and Embedded Systems Institute, Eindhoven
Orlando Moreira , ST Ericsson, Eindhoven
Sander Stuijk , Eindhoven University of Technology , Eindhoven
Marc Geilen , Eindhoven University of Technology, Eindhoven
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.
INDEX TERMS
Scheduling, single-rate data flow, homogeneous synchronous data flow, buffer minimization, throughput optimization.
CITATION
Twan Basten, Orlando Moreira, Sander Stuijk, Marc Geilen, "Buffer Sizing for Rate-Optimal Single-Rate Data-Flow Scheduling Revisited", IEEE Transactions on Computers, vol. 59, no. , pp. 188-201, February 2010, doi:10.1109/TC.2009.155
83 ms
(Ver )