research-article

Buffer minimization in earliest-deadline first scheduling of dataflow graphs

Authors:

Jean-Pierre TalpinAuthors Info & Claims

ACM SIGPLAN Notices, Volume 48, Issue 5

Pages 133 - 142

https://doi.org/10.1145/2499369.2465558

Published: 20 June 2013 Publication History

Abstract

Symbolic schedulability analysis of dataflow graphs is the process of synthesizing the timing parameters (i.e. periods, phases, and deadlines) of actors so that the task system is schedulable and achieves a high throughput when using a specific scheduling policy. Furthermore, the resulted schedule must ensure that communication buffers are underflow- and overflow-free. This paper describes a (partitioned) earliest-deadline first symbolic schedulability analysis of dataflow graphs that minimizes the buffering requirements.

Our scheduling analysis consists of three major steps. (1) The construction of an abstract affine schedule of the graph that excludes overflow and underflow exceptions and minimizes the buffering requirements assuming some precedences between jobs. (2) Symbolic deadlines adjustment that guarantees precedences without the need for lock-based synchronizations. (3) The concretization of the affine schedule using a symbolic, fast-converging, processor-demand analysis for both uniprocessor and multiprocessor systems. Experimental results show that our technique improves the buffering requirements in many cases.

References

[1]

M. Bamakhrama and T. Stefanov. Hard-real-time scheduling of data-dependent tasks in embedded streaming applications. In Proceedings of the 9th ACM International Conference on Embedded Software, pages 195--204, 2011.

Digital Library

[2]

M. A. Bamakhrama and T. Stefanov. Managing latency in embedded streaming applications under hard-real-time scheduling. In Proceedings of the 8th IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, pages 83--92, 2012.

Digital Library

[3]

S. Baruah, V. Bonifaci, A. Marchetti-Spaccamela, and S. Stiller. Implementation of speedup-optimal global EDF schedulability test. In Proceedings of the 21st Euromicro Conference on Real-Time Systems, pages 259--268, 2009.

Digital Library

[4]

S. K. Baruah and N. W. Fisher. The partitioned dynamic-priority scheduling of sporadic task systems. Real-Time Syst., 36(3):199--226, 2007.

Digital Library

[5]

M. Bertogna and S. Baruah. Tests for global EDF schedulability analysis. J. Syst. Archit., 57(5):487--497, 2011.

Digital Library

[6]

G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete. Cycle-static dataflow. IEEE Transactions on Signal Processing, 44:397--408, 1996.

Digital Library

[7]

A. Bouakaz and J.-P. Talpin. Design of safety-critical Java Level 1 applications using affine abstract clocks. In Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems, 2013.

Digital Library

[8]

A. Bouakaz, J.-P. Talpin, and J. Vitek. Affine data-flow graphs for the synthesis of hard real-time applications. In Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012.

Digital Library

[9]

C. Chevalier and F. Pellegrini. PT-Scotch: a tool for efficient parallel graph ordering. Parallel Comput., 34(6--8):318--331, 2008.

Digital Library

[10]

A. Cimatti, L. Palopoli, and Y. Ramadian. Symbolic computation of schedulability regions using parametric automata. In the 29th IEEE Real-Time Systems Symposium, pages 80--89, 2008.

Digital Library

[11]

R. I. Davis and A. Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv., 43(4):35:1--35:44, 2001.

Digital Library

[12]

J. Forget, F. Boniol, E. Grolleau, D. Lesens, and C. Pagetti. Scheduling dependent periodic tasks without synchronization mechanisms. In Proceedings of the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 301--310, 2010.

Digital Library

[13]

L. Fribourg, R. Soulat, D. Lesens, and P. Moro. Robustness analysis for scheduling problems using the inverse method. In 19th International Symposium on Temporal Representation and Reasoning, pages 73--80, 2012.

Digital Library

[14]

A. Gamatié. Design of streaming applications on MPSoCs using abstract clocks. In Design, Automation and Test in Europe Conference, pages 763--768, 2012.

Digital Library

[15]

E. A. Lee and D. G. Messerchmitt. Static scheduling of synchronous dataflow programs for digital signal processing. IEEE Trans. Comput., 36:24--35, 1987.

Digital Library

[16]

C. Pagetti, J. Forget, F. Boniol, M. Cordovilla, and D. Lesens. Multi-task implementation of multi-periodic synchronous programs. Discrete event dynamic systems, 21(3):307--338, 2011.

Digital Library

[17]

I. Ripoll, A. Crespo, and A. K. Mok. Improvement in feasibility testing for real-time tasks. Real-Time Syst., 11(1):19--39, 1996.

Digital Library

[18]

L. Sha, T. Abdelzaher, K.-E. Arzén, A. Cervin, T. Baker, A. Burns, G. Buttazzo, M. Caccamo, J. Lehoczky, and A. K. Mok. Real time scheduling theory: a historical perspective. Real-Time Syst., 28(2--3):101--155, 2004.

Digital Library

[19]

I. M. Smarandache, T. Gautier, and P. L. Guernic. Validation of mixed signal-alpha real-time systems through affine calculus on clock synchronisation constraints. In Proceedings of the World Congress on Formal Methods in the Development of Computing Systems, volume 2, pages 1364--1383, 1999.

Digital Library

[20]

S. Stuijk, M. Geilen, and T. Basten. Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. In Proceedings of the 43rd annual Design Automation Conference, pages 899--904, 2006.

Digital Library

[21]

S. Stuijk, M. Geilen, and T. Basten. Sdf$^\mbox3$: Sdf for free. In Proceedings of the 6th International Conference on Application of Concurrency to System Design, pages 276--278, 2006.

Digital Library

[22]

S. Stuijk, M. Geilen, and T. Basten. Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs. IEEE Trans. Comput., 57:1331--1345, 2008.

Digital Library

[23]

M. H. Wiggers, M. J. G. Bekooij, and G. J. M. Smit. Efficient computation of buffer capacities for cyclo-static datatflow graphs. In Proceedings of the 44th annual Design Automation Conference, pages 658--663, 2007.

Digital Library

[24]

F. Zhang and A. Burns. improvement to quick processor-demand analysis for EDF-scheduled real-time systems. In Proceedings of the 21st Euromicro Conference on Real-Time Systems, pages 76--86, 2009.

Digital Library

[25]

F. Zhang and A. Burns. Schedulability analysis for real-time systems with EDF scheduling. IEEE Transactions on Computers, 58:1250--1258, 2009.

Digital Library

Cited By

Besnard LBouakaz AGautier TLe Guernic PMa YTalpin JYu H(2015)Timed behavioural modelling and affine scheduling of embedded software architectures in the AADL using PolychronyScience of Computer Programming10.1016/j.scico.2014.05.014106:C(54-77)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1016/j.scico.2014.05.014
Bouakaz AGautier TTalpin J(2014)Earliest-deadline first scheduling of multiple independent dataflow graphs2014 IEEE Workshop on Signal Processing Systems (SiPS)10.1109/SiPS.2014.6986102(1-6)Online publication date: Oct-2014
https://doi.org/10.1109/SiPS.2014.6986102
(2014)An abstraction-refinement framework for priority-driven scheduling of static dataflow graphsProceedings of the Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign10.1109/MEMCOD.2014.6961838(2-11)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1109/MEMCOD.2014.6961838
Show More Cited By

Index Terms

Buffer minimization in earliest-deadline first scheduling of dataflow graphs
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems
2. Theory of computation
  1. Logic
  2. Models of computation

Recommendations

Buffer minimization in earliest-deadline first scheduling of dataflow graphs
LCTES '13: Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems

Symbolic schedulability analysis of dataflow graphs is the process of synthesizing the timing parameters (i.e. periods, phases, and deadlines) of actors so that the task system is schedulable and achieves a high throughput when using a specific ...
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
LCTES '13: Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems

Symbolic schedulability analysis of dataflow graphs is the process of synthesizing the timing parameters (i.e. periods, phases, and deadlines) of actors so that the task system is schedulable and achieves a high throughput when using a specific ...
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

In this paper, we focus on the semi-partitioned scheduling of sporadic tasks with constrained deadlines and identical processors. We study two cases of semi-partitioning: (i) the case where the worst case execution time (WCET) of a job can be portioned, ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 48, Issue 5

LCTES '13

May 2013

165 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2499369

Issue’s Table of Contents

LCTES '13: Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
June 2013
184 pages
ISBN:9781450320856
DOI:10.1145/2491899
General Chair:
Björn Franke
University of Edinburgh, UK
,
Program Chair:
Jingling Xue
University of New South Wales, Australia

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 June 2013

Published in SIGPLAN Volume 48, Issue 5

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
131
Total Downloads

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

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Besnard LBouakaz AGautier TLe Guernic PMa YTalpin JYu H(2015)Timed behavioural modelling and affine scheduling of embedded software architectures in the AADL using PolychronyScience of Computer Programming10.1016/j.scico.2014.05.014106:C(54-77)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1016/j.scico.2014.05.014
Bouakaz AGautier TTalpin J(2014)Earliest-deadline first scheduling of multiple independent dataflow graphs2014 IEEE Workshop on Signal Processing Systems (SiPS)10.1109/SiPS.2014.6986102(1-6)Online publication date: Oct-2014
https://doi.org/10.1109/SiPS.2014.6986102
(2014)An abstraction-refinement framework for priority-driven scheduling of static dataflow graphsProceedings of the Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign10.1109/MEMCOD.2014.6961838(2-11)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1109/MEMCOD.2014.6961838
Honorat ATran HBesnard LGautier TTalpin JBouakaz ABini EPagetti C(2017)ADFGProceedings of the 25th International Conference on Real-Time Networks and Systems10.1145/3139258.3139267(158-167)Online publication date: 4-Oct-2017
https://dl.acm.org/doi/10.1145/3139258.3139267
(2015)Towards refinement types for time-dependent data-flow networksProceedings of the 2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign10.1109/MEMCOD.2015.7340465(36-41)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1109/MEMCOD.2015.7340465
Hausmans JGeuns SWiggers MBekooij MCorporaal HStuijk S(2014)Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on mpsocs with non-starvation-free schedulersProceedings of the 17th International Workshop on Software and Compilers for Embedded Systems10.1145/2609248.2609262(108-117)Online publication date: 10-Jun-2014
https://dl.acm.org/doi/10.1145/2609248.2609262
Pagetti CSaussie DGratia RNoulard ESiron P(2014)The ROSACE case study: From Simulink specification to multi/many-core execution2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS.2014.6926012(309-318)Online publication date: Apr-2014
https://doi.org/10.1109/RTAS.2014.6926012
Bouakaz ATalpin JCorporaal HStuijk S(2013)Design of safety-critical Java level 1 applications using affine abstract clocksProceedings of the 16th International Workshop on Software and Compilers for Embedded Systems10.1145/2463596.2463600(58-67)Online publication date: 19-Jun-2013
https://dl.acm.org/doi/10.1145/2463596.2463600
Honorat ATran HGautier TBesnard LBhattacharyya STalpin J(undefined)Real-Time Fixed Priority Scheduling Synthesis using Affine DataFlow Graphs: from Theory to PracticeACM Transactions on Embedded Computing Systems10.1145/3615586
https://dl.acm.org/doi/10.1145/3615586

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.

Media

Figures

Other

Tables

View Issue’s Table of Contents