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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buttazzo, G.C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, 2nd edn. Springer, New York (2004)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stavrinides, G.L., Karatza, H.D. (2011). The Impact of Input Error on the Scheduling of Task Graphs with Imprecise Computations in Heterogeneous Distributed Real-Time Systems. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2011. Lecture Notes in Computer Science, vol 6751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21713-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-21713-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21712-8
Online ISBN: 978-3-642-21713-5
eBook Packages: Computer ScienceComputer Science (R0)