Article

The impact of input error on the scheduling of task graphs with imprecise computations in heterogeneous distributed real-time systems

Authors:

ASMTA'11: Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications

Pages 273 - 287

Published: 20 June 2011 Publication History

Publisher Site

Abstract

In real-time systems, it is often more desirable for a job to produce an approximate, imprecise result by its deadline than to produce a precise result late. In this paper, we evaluate by simulation the performance of a heterogeneous distributed real-time system, where composite jobs with end-to-end deadlines are scheduled dynamically as they arrive in the system, utilizing imprecise computations. Each job is a directed acyclic graph of component tasks, where the output data of a task may be used as input by another task. In case the input data of a component task are imprecise, the processing time of the task is extended, in order to correct the error and produce a result of acceptable quality. The impact of input error on the system performance is investigated under various workloads and input error limits.

References

[1]

Buttazzo, G.C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, 2nd edn. Springer, New York (2004).

Digital Library

Google Scholar

[2]

Lin, K.J., Natarajan, S., Liu, J.W.S.: Imprecise Results: Utilizing Partial Computations in Real-Time Systems. In: 8th IEEE Real-Time Systems Symposium, pp. 210-217 (1987).

Google Scholar

[3]

Han, C.C., Shin, K.G., Wu, J.: A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults. IEEE Trans. Comp. 52(3), 362-372 (2003).

Digital Library

Google Scholar

[4]

Hull, D., Shankar, A., Nahrstedt, K., Liu, J.W.S.: An End-to-End QoS Model and Management Architecture. In: IEEE Workshop on Middleware for Distributed Real-time Systems and Services, pp. 82-89 (1997).

Google Scholar

[5]

Karatza, H.D.: Performance of Gang Scheduling Policies in the Presence of Critical Sporadic Jobs in Distributed Systems. In: 2007 International Symposium on Performance Evaluation of Computer and Telecommunication Systems, pp. 547-554 (2007).

Google Scholar

[6]

Sha, L., Abdelzaher, T., Arzen, K.E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., Mok, A.K.: Real Time Scheduling Theory: A Historical Perspective. Real-Time Systems 28(2-3), 101-155 (2004).

Digital Library

Google Scholar

[7]

Stavrinides, G.L., Karatza, H.D.: Scheduling Multiple Task Graphs with End-to-End Deadlines in Distributed Real-Time Systems Utilizing Imprecise Computations. Journal of Systems and Software 83(6), 1004-1014 (2010).

Digital Library

Google Scholar

[8]

Liu, C.L., Layland, J.W.: Scheduling Algorithms For Multiprogramming in a Hard Real-Time Environment. Journal of the ACM 20(1), 46-61 (1973).

Digital Library

Google Scholar

[9]

Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Trans. Par. Distr. Syst. 13(3), 260-274 (2002).

Digital Library

Google Scholar

[10]

Cheng, B.C., Stoyenko, A.D., Marlowe, T.J., Baruah, S.K.: LSTF: A New Scheduling Policy for Complex Real-Time Tasks in Multiple Processor Systems. Automatica 33(5), 921-926 (1997).

Digital Library

Google Scholar

[11]

Feng, W.C., Liu, J.W.S.: Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines. IEEE Trans. Soft. Eng. 23(2), 93-106 (1997).

Digital Library

Google Scholar

[12]

Haweet, W.A.E., Meligy, H.H.E., Salam, I.A.E.: Imprecise Computation Technique to Schedule AND/OR Tasks with Global End-to-End Deadline in Distributed Real-Time Systems. In: SICE 2003 Annual Conference, pp. 663-668 (2003).

Google Scholar

Cited By

View all

Stavrinides GKaratza HGarro AD'Ambrogio A(2017)The impact of data locality on the performance of a SaaS cloud with real-time data-intensive applicationsProceedings of the 21st International Symposium on Distributed Simulation and Real Time Applications10.5555/3199858.3199890(180-187)Online publication date: 18-Oct-2017
https://dl.acm.org/doi/10.5555/3199858.3199890
Stavrinides GKaratza H(2012)Scheduling real-time DAGs in heterogeneous clusters by combining imprecise computations and bin packing techniques for the exploitation of schedule holesFuture Generation Computer Systems10.1016/j.future.2012.03.00228:7(977-988)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1016/j.future.2012.03.002

The impact of input error on the scheduling of task graphs with imprecise computations in heterogeneous distributed real-time systems
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
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

Scheduling multiple task graphs with end-to-end deadlines in distributed real-time systems utilizing imprecise computations

In order to meet the inherent need of real-time applications for high quality results within strict timing constraints, the employment of effective scheduling techniques is crucial in distributed real-time systems. In this paper, we evaluate by ...
Fault-tolerant Gang Scheduling in Distributed Real-time Systems Utilizing Imprecise Computations

Distributed real-time systems play an increasingly vital role in our society. The most important aspect of such systems is the scheduling algorithm, which must guarantee that every job in the system will meet its deadline, providing high-quality (...
Energy-aware Scheduling of Task Graphs with Imprecise Computations and End-to-end Deadlines

Imprecise computations allow scheduling algorithms developed for energy-constrained computing devices to trade off output quality with utilization of system resources. The goal of such scheduling algorithms is to utilize imprecise computations to find a ...

Comments

Information & Contributors

Information

Published In

ASMTA'11: Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications

June 2011

346 pages

ISBN:9783642217128

Editors:
Khalid Al-Begain
University of Glamorgan, Faculty of Advanced Technology, UK
,
Simonetta Balsamo
Università Ca' Foscari di Venezia, Dipartimento di Scienze Ambientali, Informatica e Statistica, Venezia, Italy
,
Andrea Marin
Università Ca' Foscari di Venezia, Dipartimento di Scienze Ambientali, Informatica e Statistica, Venezia, Italy
,
Dieter Fiems
Ghent University, Department TELIN, Gent, Belgium

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 June 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Stavrinides GKaratza HGarro AD'Ambrogio A(2017)The impact of data locality on the performance of a SaaS cloud with real-time data-intensive applicationsProceedings of the 21st International Symposium on Distributed Simulation and Real Time Applications10.5555/3199858.3199890(180-187)Online publication date: 18-Oct-2017
https://dl.acm.org/doi/10.5555/3199858.3199890
Stavrinides GKaratza H(2012)Scheduling real-time DAGs in heterogeneous clusters by combining imprecise computations and bin packing techniques for the exploitation of schedule holesFuture Generation Computer Systems10.1016/j.future.2012.03.00228:7(977-988)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1016/j.future.2012.03.002

Abstract

References

Cited By

Recommendations

Scheduling multiple task graphs with end-to-end deadlines in distributed real-time systems utilizing imprecise computations

Fault-tolerant Gang Scheduling in Distributed Real-time Systems Utilizing Imprecise Computations

Energy-aware Scheduling of Task Graphs with Imprecise Computations and End-to-end Deadlines

Comments

Information

Published In

Sponsors

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations