Weitere Kapitel dieses Buchs durch Wischen aufrufen
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.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
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. CrossRef
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).
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. CrossRef
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. CrossRef
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).
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. CrossRef
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. CrossRef
Sprunt, B., Sha, L., & Lehoczky, J. (1989). Aperiodic task scheduling for hard-real-time systems. Real-Time Systems, 1(1), 27–60.
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).
- Hybrid Metaheuristic Approach for Scheduling of Aperiodic OS Tasks
Samir Ben Ahmed
Neuer Inhalt/© ITandMEDIA, Best Practices für die Mitarbeiter-Partizipation in der Produktentwicklung/© astrosystem | stock.adobe.com