research-article

Constrained global scheduling of streaming applications on MPSoCs

Authors:

Axel JantschAuthors Info & Claims

ASPDAC '10: Proceedings of the 2010 Asia and South Pacific Design Automation Conference

Pages 223 - 228

Published: 18 January 2010 Publication History

Abstract

We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. The global scheduling of processors computing and communication transactions are formulated as constraint based problem, to avoid the scheduling overhead in TDMA-like heuristic schemes. A public domain constraint solver is exploited to solve the NP-complete scheduling efficiently, together with problem specific constraint modeling techniques. Experimental results show that the proposed framework can achieve a high predictable application throughput with minimized buffer cost. For instance, for applications in communication domain, higher throughput (up to 87%) has been observed with less buffer cost, compared to scenarios considering the heuristic scheduling overhead.

References

[1]

W. Wolf, "The future of multiprocessor systems-on-chips," in Proceedings of the 41st annual Conference on Design Automation (DAC '04). New York, NY, USA: ACM, 2004, pp. 681--685.

Digital Library

[2]

E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing," IEEE Transactions on Computers, vol. C-36, no. 1, pp. 24--35, January 1987.

Digital Library

[3]

S. Stuijk, T. Basten, M. C. W. Geilen, and H. Corporaal, "Multiprocessor resource allocation for throughput-constrained synchronous dataflow graphs," in Proceedings of the 44th annual Conference on Design Automation (DAC '07). New York, NY, USA: ACM, 2007, pp. 777--782.

Digital Library

[4]

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, January 1979.

Digital Library

[5]

P. Eles, Z. Peng, P. Pop, and A. Doboli, "Scheduling with bus access optimization for distributed embedded systems," IEEE Trans. Very Large Scale Integr. Syst., vol. 8, no. 5, pp. 472--491, 2000.

Digital Library

[6]

Gecode, "Generic Constraint Development Environment," 2009, http://www.gecode.org/.

[7]

R. Govindarajan, G. R. Gao, and P. Desai, "Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks," Journal of VLSI Signal Processing, vol. 31, no. 3, pp. 207--229, July 2002.

Digital Library

[8]

M. Geilen, T. Basten, and S. Stuijk, "Minimising buffer requirements of synchronous dataflow graphs with model checking," in DAC '05: Proceedings of the 42nd annual conference on Design automation. New York, NY, USA: ACM, 2005, pp. 819--824.

Digital Library

[9]

W. Liu, M. Yuan, X. He, Z. Gu, and X. Liu, "Efficient SAT-based mapping and scheduling of homogeneous synchronous dataflow graphs for throughput optimization," in Proceedings of the 28th IEEE international real-time systems symposium (RTSS '08). Barcelona, Spain: IEEE Computer Society, November 2008.

Digital Library

[10]

S. Sriram and S. S. Bhattacharyya, Embedded multiprocessors: Scheduling and synchronization. CRC Press, 2000.

Digital Library

[11]

L. Benini, M. Lombardi, M. Milano, and M. Ruggiero, "A constraint programming approach for allocation and scheduling on the cell broadband engine," in CP '08: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming. Berlin, Heidelberg: Springer-Verlag, 2008, pp. 21--35.

Digital Library

[12]

P.-E. Hladik, H. Cambazard, A.-M. Déplanche, and N. Jussien, "Solving a real-time allocation problem with constraint programming," J. Syst. Softw., vol. 81, no. 1, pp. 132--149, 2008.

Digital Library

[13]

J. Zhu, I. Sander, and A. Jantsch, "Buffer minimization of real-time streaming applications scheduling on hybrid CPU/FPGA architectures," in Proceedings of Design Automation and Test in Europe (DATE '09), Nice, France, April 2009, pp. 1506--1511.

Digital Library

[14]

M. Bekooij, O. Moreira, P. Poplavko, B. Mesman, M. Pastrnak, and J. V. Meerbergen, "Predictable embedded multiprocessor system design," in Proceedings of Workshop on Software and Compilers for Embedded Systems (SCOPES), LNCS 3199. Springer, 2004.

[15]

K. Goossens, J. Dielissen, and A. Radulescu, "Æthereal network on chip: Concepts, architectures, and implementations," IEEE Des. Test, vol. 22, no. 5, pp. 414--421, 2005.

Digital Library

[16]

S. S. Bhattacharyya, P. K. Murthy, and E. A. Lee, "Synthesis of embedded software from synchronous dataflow specifications," Journal of VLSI Signal Processing Systems, vol. 21, no. 2, pp. 151--166, June 1999.

Digital Library

[17]

O. Moreira, F. Valente, and M. Bekooij, "Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor," in Proceedings of the 7th ACM & IEEE International conference on Embedded Software (EMSOFT '07). New York, NY, USA: ACM, 2007, pp. 57--66.

Digital Library

Cited By

Rosvall KKhalilzad NUngureanu GSander I(2017)Throughput Propagation in Constraint-Based Design Space Exploration for Mixed-Criticality SystemsProceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools10.1145/3023973.3023977(1-8)Online publication date: 23-Jan-2017
https://dl.acm.org/doi/10.1145/3023973.3023977
Rosvall KSander IFettweis GNebel W(2014)A constraint-based design space exploration framework for real-time applications on MPSoCsProceedings of the conference on Design, Automation & Test in Europe10.5555/2616606.2617072(1-6)Online publication date: 24-Mar-2014
https://dl.acm.org/doi/10.5555/2616606.2617072
Zhai JNikolov HStefanov T(2013)Mapping of streaming applications considering alternative application specificationsACM Transactions on Embedded Computing Systems10.1145/2435227.243523012:1s(1-21)Online publication date: 21-Mar-2013
https://dl.acm.org/doi/10.1145/2435227.2435230

Constrained global scheduling of streaming applications on MPSoCs
1. General and reference
  1. Cross-computing tools and techniques
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Approximation schemes for constrained scheduling problems
SFCS '89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Several constrained scheduling problems are considered. The first polynomial approximation schemes for the problem of minimizing maximum completion time in a two-machine flow shop with release dates and for the problem of minimizing maximum lateness for ...
Global EDF-based scheduling with laxity-driven priority promotion

This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based ...
Online Scheduling of Precedence Constrained Tasks

A fundamental problem in scheduling theory is that of scheduling a set of n tasks, with precedence constraints, on $m \ge 1$ identical and parallel processors so as to minimize the makespan (schedule length). In the past, research has focused on the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ASPDAC '10: Proceedings of the 2010 Asia and South Pacific Design Automation Conference

January 2010

920 pages

ISBN:9781605588377

General Chair:
Youn-Long Lin
National Tsing Hua University

Sponsors

TICD: TICD
SIGDA: ACM Special Interest Group on Design Automation
IEEE CAS

Publisher

IEEE Press

Publication History

Published: 18 January 2010

Check for updates

Qualifiers

Research-article

Conference

ASPDAC '10

Sponsor:

TICD
SIGDA

ASPDAC '10: Asia and South Pacific Design Automation Conference

January 18 - 21, 2010

Taipei, Taiwan

Acceptance Rates

Overall Acceptance Rate 466 of 1,454 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
77
Total Downloads

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

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Rosvall KKhalilzad NUngureanu GSander I(2017)Throughput Propagation in Constraint-Based Design Space Exploration for Mixed-Criticality SystemsProceedings of the 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools10.1145/3023973.3023977(1-8)Online publication date: 23-Jan-2017
https://dl.acm.org/doi/10.1145/3023973.3023977
Rosvall KSander IFettweis GNebel W(2014)A constraint-based design space exploration framework for real-time applications on MPSoCsProceedings of the conference on Design, Automation & Test in Europe10.5555/2616606.2617072(1-6)Online publication date: 24-Mar-2014
https://dl.acm.org/doi/10.5555/2616606.2617072
Zhai JNikolov HStefanov T(2013)Mapping of streaming applications considering alternative application specificationsACM Transactions on Embedded Computing Systems10.1145/2435227.243523012:1s(1-21)Online publication date: 21-Mar-2013
https://dl.acm.org/doi/10.1145/2435227.2435230

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten