Subscribe

Issue No.02 - February (2010 vol.59)

pp: 188-201

Orlando Moreira , ST Ericsson, Eindhoven

Twan Basten , Eindhoven University of Technology and Embedded Systems Institute, Eindhoven

Marc Geilen , Eindhoven University of Technology, Eindhoven

Sander Stuijk , Eindhoven University of Technology , Eindhoven

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2009.155

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

Orlando Moreira, Twan Basten, Marc Geilen, Sander Stuijk, "Buffer Sizing for Rate-Optimal Single-Rate Data-Flow Scheduling Revisited",

*IEEE Transactions on Computers*, vol.59, no. 2, pp. 188-201, February 2010, doi:10.1109/TC.2009.155REFERENCES

- [1] Q. Ning and G. Gao, “A Novel Framework of Register Allocation for Software Pipelining,”
Proc. ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, pp. 29-42, 1993.- [2] A. Dasdan, “Experimental Analysis of the Fastest Optimum Cycle Ratio and Mean Algorithms,”
ACM Trans. Design Automation of Electronic Systems, vol. 9, no. 4, pp. 385-418, Oct. 2004.- [3] P. Poplavko, T. Basten, M. Bekooij, J. van Meerbergen, and B. Mesman, “Task-Level Timing Models for Guaranteed Performance in Multiprocessor Networks-on-Chip,”
Proc. Int'l Conf. Compilers, Architectures and Synthesis for Embedded Systems (CASES), pp. 63-72, 2003.- [4] S. Stuijk, T. Basten, B. Mesman, and M. Geilen, “Predictable Embedding of Large Data Structures in Multiprocessor Networks-on-Chip,”
Proc. Conf. Digital System Design (DSD), pp. 388-395, 2005.- [5] O. Moreira, M. Bekooij, and J. Mol, “Online Resource Management in a Multiprocessor with a Network-on-Chip.”
Proc. Symp. Applied Computing, pp. 1557-1564, 2007.- [6] R. Govindarajan, G. Gao, and P. Desai, “Minimizing Memory Requirements in Rate-Optimal Schedules,”
Proc. Int'l Conf. Application-Specific Array Processors, pp. 75-86, 1994.- [7] R. Govindarajan, G. Gao, and P. Desai, “Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks,”
J. VLSI Signal Processing, vol. 31, no. 3, pp. 207-229, 2002.- [8] J. Wang, A. Krall, M.A. Ertl, and C. Eisenbeis, “Software Pipelining with Register Allocation and Spilling,”
Proc. 27th Int'l Symp. and Workshop Microprogramming and Microarchitecture (MICRO-27), citeseer.ist.psu.eduwang94software.html, Dec. 1994.- [9] M.S. Lam, “Software Pipelining: An Effective Scheduling Technique for VLIW Machines,”
SIGPLAN Notices, vol. 39, no. 4, pp. 244-256, 2004.- [10] O. Moreira, J. Mol, M. Bekooij, and J. van Meerbergen, “Multiprocessor Resource Allocation for Hard Real-Time Streaming with a Dynamic Job Mix,”
Proc. IEEE Real-Time and Embedded Technology and Applications Symp. (RTAS), pp. 332-341, 2005.- [15] S. Sriram and S. Bhattacharyya,
Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker, Inc., 2000.- [17] T. Cormen, C. Leiserson, R. Rivest, and C. Stein,
Introduction to Algorithms. MIT Press/McGraw-Hill, 2001.- [18] R. Karp, “Reducibility among Combinatorial Problems,”
Complexity of Computer Computations, Plenum, pp. 85-103, 1972.- [19] M. Garey and D. Johnson,
Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.- [20] P. Murthy, “Scheduling Techniques for Synchronous and Multidimensional Synchronous Dataflow,” PhD dissertation, Univ. of California at Berkeley, 1996.
- [21] A. Ghamarian, M. Geilen, S. Stuijk, T. Basten, A. Moonen, M. Bekooij, B. Theelen, and M. Mousavi, “Throughput Analysis of Synchronous Data Flow Graphs,”
Proc. Int'l Conf. Application of Concurrency to System Design (ACSD), pp. 25-34, 2006.- [22] S. Stuijk, M. Geilen, and T. Basten, “SDF3: SDF for Free,”
Proc. Int'l Conf. Application of Concurrency to System Design (ACSD), pp. 276-278, 2006. |