Abstract
It is desirable to develop large complex systems using components based on systematic abstraction and composition. Our goal is to develop a compositional real-time scheduling framework to support abstraction and composition techniques for real-time aspects of components. In this paper, we present a formal description of compositional real-time scheduling problems, which are the component abstraction and composition problems. We identify issues that need be addressed by solutions and provide our framework for the solutions, which is based on the periodic interface. Specifically, we introduce the periodic resource model to characterize resource allocations provided to a single component. We present exact schedulability conditions for the standard Liu and Layland periodic task model and the proposed periodic resource model under EDF and RM scheduling, and we show that the component abstraction and composition problems can be addressed with periodic interfaces through the exact schedulability conditions. We also provide the utilization bounds of a periodic task set over the periodic resource model and the abstraction bounds of periodic interfaces for a periodic task set under EDF and RM scheduling. We finally present the analytical bounds of overheads that our solution incurs in terms of resource utilization increase and evaluate the overheads through simulations.
- Abeni, L. and Buttazzo, G. 1998. Integrating multimedia applications in hard real-time systems. In RTSS '98: Proceedings of the 19th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 4--13. Google Scholar
Digital Library
- Almeida, L. and Pedreiras, P. 2004. Scheduling within temporal partitions: response-time analysis and server design. In EMSOFT '04: Proceedings of the 4th ACM International Conference on Embedded Software. ACM Press, New York. 95--103. Google Scholar
Digital Library
- Baruah, S., Howell, R., and Rosier, L. 1990a. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. J. Real-Time Syst. 2, 301--324. Google Scholar
Digital Library
- Baruah, S., Mok, A., and Rosier, L. 1990b. Preemptively scheduling hard-real-time sporadic tasks on one processor. In RTSS '90: Proceedings of the 11th IEEE Real-Time Systems Symposium. 182--190.Google Scholar
- Bernat, G., Burns, A., and Llamosi, A. 2001. Weakly hard real-time systems. IEEE Trans. Comput. 50, 4, 308--321. Google Scholar
Digital Library
- Deng, Z. and Liu, J. W.-S. 1997. Scheduling real-time applications in an open environment. In RTSS '97: Proceedings of the 18th IEEE Real-Time Systems Symposium. 308--319. Google Scholar
Digital Library
- Feng, X. 2004. Design of real-time virtual resource architecture for large-scale embedded systems. Ph.D. thesis, University of Texas, Austin, TX. Google Scholar
Digital Library
- Feng, X. A. and Mok, A. K. 2002. A model of hierarchical real-time virtual resources. In RTSS '02: Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS'02). IEEE Computer Society, Los Alamitos, CA. 26--35. Google Scholar
Digital Library
- Goyal, P., Guo, X., and Vin, H. M. 1996. A hierarchical CPU scheduler for multimedia operating systems. In Usenix Association Second Symposium on Operating Systems Design and Implementation (OSDI). 107--121. Google Scholar
Digital Library
- Hamdaoui, M. and Ramanathan, P. 1995. A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Trans. Comput. 44, 12, 1443--1451. Google Scholar
Digital Library
- Henzinger, T. A., Horowitz, B., and Kirsch, C. M. 2003. Giotto: A time-triggered language for embedded programming. Proc. IEEE 91, 84--99.Google Scholar
Cross Ref
- Kuo, T.-W. and Li, C.-H. 1999. A fixed-priority-driven open environment for real-time applications. In RTSS '99: Proceedings of the 20th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 256--267. Google Scholar
Digital Library
- Lehoczky, J. and Ramos-Thuel, S. 1992. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In Proceedings of IEEE Real-Time Systems Symposium. 110--123.Google Scholar
- Lehoczky, J. P., Sha, L., and Strosnider, J. K. 1987. Enhanced aperiodic responsiveness in hard real-time environments. In RTSS '87: Proceedings of 8th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 261--270.Google Scholar
- Lehoczky, J., Sha, L., and Ding, Y. 1989. The rate monotonic scheduling algorithm: exact characterization and average case behavior. In RTSS '89: Proceedings of the 10th IEEE Real-Time Systems Symposium. 166--171.Google Scholar
- Lipari, G. and Baruah, S. 2000. Efficient scheduling of real-time multi-task applications in dynamic systems. In Proceedings of the IEEE. 166--175. Google Scholar
Digital Library
- Lipari, G. and Bini, E. 2003. Resource partitioning among real-time applications. In ECRTS '03: Proceedings of 15th Euromicro Conference on Real-Time Systems. 151--158.Google Scholar
- Lipari, G., Carpenter, J., and Baruah, S. 2000. A framework for achieving inter-application isolation in multiprogrammed hard-real-time environments. In RTSS '00: Proceedings of the 21st IEEE Real-Time Systems Symposium. Google Scholar
Digital Library
- Liu, C. and Layland, J. 1973. Scheduling algorithms for multi-programming in a hard-real-time environment. J. ACM 20, 1, 46--61. Google Scholar
Digital Library
- Mathworks. 2005. Models with multiple sample rates. In Real-Time Workshop User Guide. 1--34.Google Scholar
- Matic, S. and Henzinger, T. A. 2005. Trading end-to-end latency for composability. In RTSS '05: Proceedings of the 26th IEEE Real-Time Systems Symposium. 99--110. Google Scholar
Digital Library
- Mok, A., Feng, X., and Chen, D. 2001. Resource partition for real-time systems. In RTAS '01: Proceedings of the 7th IEEE Real-Time Technology and Applications Symposium. 75--84. Google Scholar
Digital Library
- Rajkumar, R., Sha, L., and Lehoczky, J. P. 1988. Real-time synchronization protocols for multiprocessors. In RTSS '88: Proceedings of the 9th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 259--269.Google Scholar
- Regehr, J. and Stankovic, J. 2001. HLS: A framework for composing soft real-time schedulers. In RTSS '01: Proceedings of the 22nd IEEE Real-Time Systems Symposium. 3--14. Google Scholar
Digital Library
- Saewong, S., Rajkumar, R. R., Lehoczky, J. P., and Klein, M. H. 2002. Analysis of hierarhical fixed-priority scheduling. In ECRTS '02: Proceedings of the 14th Euromicro Conference on Real-Time Systems. IEEE Computer Society, Los Alamitos, CA. 173--181. Google Scholar
Digital Library
- Sha, L., Lehoczky, J. P., and Rajkumar, R. 1987. Task scheduling in distributed real-time systems. In Proceedings of the International Conference on Industrial Electronics, Control, and Instrumentation. Cambridge, MA. 909--916.Google Scholar
- Shin, I. and Lee, I. 2003. Periodic resource model for compositional real-time guarantees. In RTSS '03: Proceedings of the 24th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 2--13. Google Scholar
Digital Library
- Shin, I. and Lee, I. 2004. Compositional real-time scheduling framework. In RTSS '04: Proceedings of the 25th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 57--67. Google Scholar
Digital Library
- Sprunt, B., Sha, L., and Lehoczky, J. P. 1989. Aperiodic task scheduling for hard real-time systems. Real-Time Syst. 1, 1 (June), 27--60.Google Scholar
Cross Ref
- Spuri, M. and Buttazzo, G. C. 1994. Efficient aperiodic service under earliest deadline scheduling. In RTSS '94: Proceedings of the 15th IEEE Real-Time Systems Symposium. IEEE Computer Society, Los Alamitos, CA. 2--11.Google Scholar
- Strosnider, J. K., Lehoczky, J. P., and Sha, L. 1995. The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Trans. Comput. 44, 1 (Jan.), 73--91. Google Scholar
Digital Library
Index Terms
Compositional real-time scheduling framework with periodic model
Recommendations
Combining Hard Periodic and Soft Aperiodic Real-Time Task Scheduling on Heterogeneous Compute Resources
ICPP '11: Proceedings of the 2011 International Conference on Parallel ProcessingEffectively scheduling tasks on heterogeneous resources is critical to maximizing the overall benefit of those resources in system-on-a-chip architectures. In this paper we focus on scheduling soft a periodic tasks alongside periodic tasks with hard ...
Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor*This work is supported in part by Brain Korea 21 project and in part by ICT.
Multiprocessor architecture becomes common on real-time systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these ...
Analysis on quantum-based fixed priority scheduling of real-time tasks
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and CommunicationFixed 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 ...






Comments