Abstract
This book chapter deals with the purpose of one hybrid approach for solving the real-time embedded systems scheduling composed of aperiodic OS tasks which are used to control physical processes that range in complexity from automobile ignition systems to controllers for flight systems and nuclear power plants. In these systems, the correctness of system functions depends upon not only the results of computation but also on the times at which results are produced. This book chapter presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on uniprocessor systems where two problems are addressed: (i) the scheduling of aperiodic tasks when they arrive in order to obtain a feasible system, and (ii) the scheduling of periodic and aperiodic tasks to minimize their response time. Indeed, in order to improve the responsiveness to both types of problems, our approach proposed in this book chapter presents an efficient hybrid methaheuristic based on the combination of the Polling Server (PS) and the Background Server (BS). The effectiveness and the performance of the designed approach are evaluated through simulation studies. A tool named RT-Reconfiguration is developed in our research laboratory at INSAT Institute to support this new proposed approach.
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
Similar content being viewed by others
References
Abdelzaher, T. S. V., Sharma, V., & Lu, C. (2004a). A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Transactions on Computers, 53(3), 334–350.
Abdelzaher, T., Thaker, G., & Lardieri, P. (2004b). A feasible region for meeting aperiodic end-to-end deadlines in source pipelines. In IEEE International Conference on Distributed Computing Systems (pp. 436–445).
Abeni, L., & Buttazzo, G. (1998). Integrating multimedia applications in hard real-time systems. In Proceedings of the 19th IEEE Real-Time Systems Symposium (pp. 4–13).
Abeni, L., & Buttazzo, G. (2001). Hierarchical QoS management for time sensitive applications. In proceedings of the IEEE Real-Time Technology and Applications Symposium (pp. 63–72).
Abeni, L., & Buttazzo, G. (2004). Resource reservations in dynamic real-time systems. Real-Time Systems, 27(2), 123–165.
Aggarwal, S., & Chraibi, C. (1995). Scheduling of hyperperiodic tasks in a multiprocessor environment. In Proceedings of the 2nd ISSAT Conference on Reliability and Quality in Design.
Burns, A., & Guillem, B. (1999). New results on fixed priority aperiodic servers. In 20th IEEE Real-Time Systems Symposium, RTSS (pp. 68–78).
Buttazzo, G., & Stankovic, J. (1993). RED: A robust earliest deadline scheduling. 3rd International Workshop on Responsive Computing.
Gharsellaoui, H., Khalgui, M., & Ben Ahmed, S. (2012). New optimal preemptively scheduling for real-time reconfigurable sporadic tasks based on earliest deadline first algorithm. Journal of International Advanced Pervasive and Ubiquitous Computing, IJAPUC, 4(2), 65–81.
Ghazalie, T., & Baker, T. (1994). Aperiodic servers in a deadline scheduling environment. Tallahassee, FL: Department of Computer Science, Florida State University. (32306).
Guillem, B. (2001). Weakly hard real-time systems. IEEE Transactions on Computers, 50(4), 308–321.
Hamdaoui, M., & Ramanathan, P. (1995). A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Transactions on Computers, 44(1), 1443–1451.
Hamidzadeh, B., & Atif, Y. (1996). Dynamic scheduling of real-time aperiodic tasks on multiprocessor architectures. In Proceedings of the 29th Annual Hawaii International Conference on System Sciences (pp. 469–478).
Layland, J., & Liu, C. (1973). Scheduling algorithms for multi-programming in a hard-real-time environment. Journal of the ACM, 20(1), 46–61.
Lehoczky, J. P., Sha L., & Strosnider, J. K. (1987). Enhanced aperiodic responsiveness in hard-real-time environments. In Proceedings of IEEE Real-Time Systems Symposium (pp. 261–270).
Lipari, G., & Buttazzo, G. (1999). Schedulability analysis of periodic and aperiodic tasks with resource constraints. International Journal of Systems Architecture, 46(4), 327–338.
Marouf, M., George, L., & Sorel, Y. (2012). Schedulability analysis for a combination of non-preemptive strict periodic tasks and preemptive sporadic tasks. In ETFA’12—17th IEEE International Conference on Emerging Technologies and Factory Automation (pp. 1–8).
Marouf, M., & Sorel, B. Y. (2010). Schedulability conditions for non-preemptive hard real-time tasks with strict period. In 18th International Conference on Real-Time and Network Systems, RTNS10.
Marouf, M., & Sorel, B. Y. (2011). Scheduling non-preemptive hard real-time tasks with strict periods. In 16th IEEE International Conference on Emerging Technologies and Factory Automation ETFA2011 (pp. 1–8).
Naveen, A., & Venkatesan, M. (2013). Energy aware scheduling of aperiodic real-time tasks on multiprocessor systems. Journal of Computing Science and Engineering JCSE, 7(1), 30–43.
Sprunt, B., Sha, L., & Lehoczky, J. (1989). Aperiodic task scheduling for hard-real-time systems. Real-Time Systems, 1(1), 27–60.
Strosnider, K., Lehoczky, J. P., & Sha, L. (1995). The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Transactions on Computers, 44(1), 73–91.
Thuel, S. R., & Lehoczky, J. (1994). Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing. In Real-Time Systems Symposium (pp. 22–33).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Gharsellaoui, H., Ben Ahmed, S. (2015). Hybrid Metaheuristic Approach for Scheduling of Aperiodic OS Tasks. In: Zhu, Q., Azar, A. (eds) Complex System Modelling and Control Through Intelligent Soft Computations. Studies in Fuzziness and Soft Computing, vol 319. Springer, Cham. https://doi.org/10.1007/978-3-319-12883-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-12883-2_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12882-5
Online ISBN: 978-3-319-12883-2
eBook Packages: EngineeringEngineering (R0)