More Web Proxy on the site http://driver.im/

research-article

Monotonicity and run-time scheduling

Authors:

Maarten H. Wiggers,

Marco J.G. Bekooij,

Gerard J.M. SmitAuthors Info & Claims

EMSOFT '09: Proceedings of the seventh ACM international conference on Embedded software

Pages 177 - 186

https://doi.org/10.1145/1629335.1629359

Published: 12 October 2009 Publication History

Abstract

Modern embedded multi-processors can execute several stream-processing applications concurrently. Typically, these applications are partitioned into tasks that communicate over buffers together forming a task graph. The fact that these applications are started and stopped by the user combined with the knowledge that not all applications are necessarily completely characterised makes it attractive to use run-time scheduling. We define and characterise a class of budget schedulers that by construction bound the interference from other applications. Furthermore, we will show that the worst-case effects of these schedulers can be included in dataflow process networks. The execution of the resulting dataflow process network is shown to result in tight and conservative bounds on the end-to-end temporal behaviour of the execution of the task graph on a cycle-true simulator. Given that the inter-task synchronisation of the application allows for a dataflow model that is functionally deterministic, this enables exploration of various buffer capacities and scheduler settings at a high level of abstraction.

References

[1]

SoftWare ARM. www.cl.cam.ac.uk/ mwd24/phd/swarm.html.

[2]

L. Abeni and G. Butazzo. Resource Reservation in Dynamic Real-Time Systems. Real-Time Systems, (27):123--167, 2004.

Digital Library

[3]

M. J. G. Bekooij, S. Parmar, and J. van Meerbergen. Performance Guarantees by Simulation of Process Networks. In Proc. Int'l Workshop on Software and Compilers for Embedded Systems (SCOPES), September 2005.

Digital Library

[4]

G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete. Cyclo-Static Dataflow. IEEE Transactions on Signal Processing, 44(2):397--408, 1996.

Digital Library

[5]

G. C. Butazzo. Hard Real-Time Computing Systems. Kluwer, 1997.

Digital Library

[6]

R. L. Cruz. A Calculus for Network Delay, Part II: Network Analysis. IEEE Transactions on Information Theory, 37(1):132--141, January 1991.

Digital Library

[7]

E. A. de Kock, W. Smits, P. van der Wolf, J. Y. Brunel, W. M. Kruijtzer, P. Lieverse, K. Vissers, and G. Essink. YAPI: Application Modeling for Signal Processing Systems. In Proc. DAC, 2000.

Digital Library

[8]

A. Donlin. Transaction level modeling: Flows and use models. In Proc. ACM/IEEE Int'l Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS), 2004.

Digital Library

[9]

A. Gerstlauer, H. Yu, and D. D. Gajski. RTOS Modeling for System Level Design. In Proc. Design, Automation and Test in Europe (DATE), 2003.

Digital Library

[10]

R. L. Graham. Computer and Job Scheduling Theory, chapter Bounds on the Performance of Scheduling Alogrithms. John Wiley&Sons, 1976.

[11]

W. Haid and L. Thiele. Complex Task Activation Schemes in System Level Performance Analysis. In Proc. ACM/IEEE Int'l Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS), 2007.

Digital Library

[12]

A. Hamann, M. Jersak, K. Richter, and R. Ernst. Design Space Exploration and System Optimization with SymTA/S - Symbolic Timing Analysis for Systems. In Proc. IEEE Real-Time Systems Symposium (RTSS), 2004.

Digital Library

[13]

A. Hansson, M. H. Wiggers, A. J. M. Moonen, K. G. W. Goossens, and M. J. G. Bekooij. Enabling Application-Level Performance Guarantees in Network-Based Systems on Chip by Applying Dataflow Analysis. IET Computers&Digital Techniques, 2009. to appear.

[14]

M. Jersak, K. Richter, and R. Ernst. Performance Analysis of Complex Embedded Systems. Int'l Journal of Embedded Systems, 1(1-2):33--49, 2005.

[15]

E. A. Lee and T. M. Parks. Dataflow Process Networks. Proceedings of the IEEE, 83(5):773--801, 1995.

[16]

Y.-T. Li and S. Malik. Performance analysis of real-time embedded software. Kluwer academic publishers, 1999.

Digital Library

[17]

Z. Lu, M. Millberg, A. Jantsch, A. Bruce, P. van der Wolf, and T. Henriksson. Flow Regulation for On-Chip Communication. In Proc. Design, Automation and Test in Europe (DATE), 2009.

Digital Library

[18]

A. K. Mok and D. Chen. A Multiframe Model for Real-Time Tasks. IEEE Transactions on Software Engineering, 23(10):635--645, October 1997.

Digital Library

[19]

A. Nieuwland, J. Kang, O. P. Gangwal, R. Sethuraman, N. Busa, K. Goossens, and R. Peset Llopis. C-HEAP: A Heterogeneous Multi-Processor Architecture Template and Scalable and Flexible Protocol for the Design of Embedded Signal Processing Systems. Design Automation for Embedded Systems, 7(3):233--270, 2002.

Digital Library

[20]

S. Park, W. Olds, K. G. Shin, and S. Wang. Integrating Virtual Execution Platform for Accurate Analysis in Distributed Real-Time Control System Development. In Proc. IEEE Real-Time Systems Symposium (RTSS), 2007.

Digital Library

[21]

S. Sriram and S.S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker Inc., 2000.

Digital Library

[22]

B. Sprunt, L. Sha, and J. P. Lehoczky. Aperiodic Task Scheduling for Hard Real-Time Systems. Real-Time Systems, 1(1):27--60, 1989.

[23]

M. Spuri and G. C. Buttazzo. Scheduling aperiodic tasks in dynamic priority systems. Journal of Real-Time Systems, 10(2), 1996.

[24]

M. Steine, M. J. G. Bekooij, and M. H. Wiggers. A Priority-Based Budget Scheduler with Conservative Dataflow Model. In Proc. Euromicro Conference on Digital System Design (DSD), 2009.

Digital Library

[25]

D. Stiliadis and A. Varma. Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms. IEEE/ACM Transactions on Networking, 6(5):611--624, October 1998.

Digital Library

[26]

S. Stuijk, M. Geilen, and T. Basten. Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs. In Proc. Design Automation Conference (DAC), 2007.

Digital Library

[27]

S. Tripakis, C. Pinello, A. Benveniste, A. Sangiovanni-Vincentelli, P. Caspi, and M. Di Natale. Implementing Synchronous Models on Loosely Time Triggered Architectures. IEEE Transactions on Computers, 2008.

Digital Library

[28]

Underbit Technologies. Mad: Mpeg Audio Decoder. http://www.underbit.com/products/mad/, 2009.

[29]

M. H. Wiggers, M. J. G. Bekooij, and G. J. M. Smit. Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs. In Proc. Design Automation Conference (DAC), June 2007.

Digital Library

[30]

M. H. Wiggers, M. J. G. Bekooij, and G. J. M. Smit. Modelling Run-Time Arbitration by Latency-Rate Servers in Dataflow Graphs. In Proc. Int'l Workshop on Software and Compilers for Embedded Systems (SCOPES), 2007.

Digital Library

[31]

M. H. Wiggers, M. J. G. Bekooij, and G. J. M. Smit. Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication. In Proc. IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2008.

Digital Library

Cited By

Kurtin PBekooij M(2017)An Abstraction-Refinement Theory for the Analysis and Design of Real-Time SystemsACM Transactions on Embedded Computing Systems10.1145/312650716:5s(1-20)Online publication date: 27-Sep-2017
https://dl.acm.org/doi/10.1145/3126507
Hausmans JBekooij M(2016)A refinement theory for timed-dataflow analysis with support for reorderingProceedings of the 13th International Conference on Embedded Software10.1145/2968478.2968489(1-10)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1145/2968478.2968489
Kurtin PHausmans JBekooij M(2016)HAPIProceedings of the 19th International Workshop on Software and Compilers for Embedded Systems10.1145/2906363.2906381(60-66)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1145/2906363.2906381
Show More Cited By

Index Terms

Monotonicity and run-time scheduling
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems

Recommendations

Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor
EMSOFT '07: Proceedings of the 7th ACM & IEEE international conference on Embedded software

This paper proposes a scheduling strategy and an automatic scheduling flow that enable the simultaneous execution of multiple hard-real-time dataflow jobs. Each job has its own execution rate and starts and stops independently from other jobs, at ...
Analysis on quantum-based fixed priority scheduling of real-time tasks
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication

Fixed priority schedulers are widely used for real-time systems, and there were efforts to improve the schedulability. Preemption threshold scheduling is one of such efforts with a dual priority scheme. It increases the schedulability by introducing ...
Exact speedup factors and sub-optimality for non-preemptive scheduling

Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive earliest ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

EMSOFT '09: Proceedings of the seventh ACM international conference on Embedded software

October 2009

332 pages

ISBN:9781605586274

DOI:10.1145/1629335

Program Chairs:
Samarjit Chakraborty
TU Munich, Germany
,
Nicolas Halbwachs
Verimag/CNRS, Grenoble, France

Copyright © 2009 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 October 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ESWeek '09

Sponsor:

ESWeek '09: Fifth Embedded Systems Week

October 12 - 16, 2009

Grenoble, France

Acceptance Rates

EMSOFT '09 Paper Acceptance Rate 33 of 106 submissions, 31%;

Overall Acceptance Rate 60 of 203 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
318
Total Downloads

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

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kurtin PBekooij M(2017)An Abstraction-Refinement Theory for the Analysis and Design of Real-Time SystemsACM Transactions on Embedded Computing Systems10.1145/312650716:5s(1-20)Online publication date: 27-Sep-2017
https://dl.acm.org/doi/10.1145/3126507
Hausmans JBekooij M(2016)A refinement theory for timed-dataflow analysis with support for reorderingProceedings of the 13th International Conference on Embedded Software10.1145/2968478.2968489(1-10)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1145/2968478.2968489
Kurtin PHausmans JBekooij M(2016)HAPIProceedings of the 19th International Workshop on Software and Compilers for Embedded Systems10.1145/2906363.2906381(60-66)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1145/2906363.2906381
Kuiper GGeuns SHausmans JBekooij M(2016)Compositional Temporal Analysis Method for Fixed Priority Pre-emptive Scheduled Modal Stream Processing ApplicationsProceedings of the 19th International Workshop on Software and Compilers for Embedded Systems10.1145/2906363.2906375(98-107)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1145/2906363.2906375
Koek PGeuns SHausmans JCorporaal HBekooij M(2016)CSDFaProceedings of the 19th International Workshop on Software and Compilers for Embedded Systems10.1145/2906363.2906364(30-39)Online publication date: 23-May-2016
https://dl.acm.org/doi/10.1145/2906363.2906364
Kuiper GGeuns SBekooij MCorporaal HStuijk S(2015)Utilization Improvement by Enforcing Mutual Exclusive Task Execution in Modal Stream Processing ApplicationsProceedings of the 18th International Workshop on Software and Compilers for Embedded Systems10.1145/2764967.2764970(28-37)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1145/2764967.2764970
Ali HAkesson BPinho L(2015)Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow GraphsProceedings of the 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing10.1109/PDP.2015.57(701-710)Online publication date: 4-Mar-2015
https://dl.acm.org/doi/10.1109/PDP.2015.57
Wilmanns PGeuns SHausmans JBekooij M(2015)Buffer Sizing to Reduce Interference and Increase Throughput of Real-Time Stream Processing ApplicationsProceedings of the 2015 IEEE 18th International Symposium on Real-Time Distributed Computing10.1109/ISORC.2015.14(9-18)Online publication date: 13-Apr-2015
https://dl.acm.org/doi/10.1109/ISORC.2015.14
Dekens BBekooij MSmit G(2015)Real-Time Multiprocessor Architecture for Sharing Stream Processing AcceleratorsProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop10.1109/IPDPSW.2015.147(81-89)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPSW.2015.147
Nelson AGoossens KAkesson B(2015)Dataflow formalisation of real-time streaming applications on a Composable and Predictable Multi-Processor SOCJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2015.04.00161:9(435-448)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.sysarc.2015.04.001
Show More Cited By

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 Table of Contents