Abstract
While component technology has been widely accepted as a methodology for designing complex systems, there are few component technologies that have been developed to accommodate the characteristics of embedded systems. Embedded systems are often subject to resource constraints as well as timing constraints. Typical scarce resources include memory for cost-sensitive systems. Many techniques, developed for reducing code size, often yield code size vs. execution time tradeoffs. Our goal is to develop a framework for supporting the compositionality of resource and timing properties. The proposed framework allows component-level resource and timing properties, which include the resource/time tradeoffs, to be independently analyzed, abstracted, and composed into the system-level resource and timing properties. In this paper, we focus on the problem of composing the collective task-level code size vs. execution time tradeoffs into a component-level code size vs. execution time tradeoff.
This research was supported in part by NSF CCF-0429948, NSF CCR-0209024, and ARO DAAD19-01-1-0473.
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
Almeida, L., Pedreiras, P.: Scheduling within temporal partitions: response-time analysis and server design. In: Proc. of the Fourth ACM International Conference on Embedded Software (September 2004)
Audsley, N., Burns, A., Wellings, A.: Deadline monotonic scheduling theory and application. Control Engineering Practice 1(1), 71–78 (1993)
Baruah, S., Howell, R., Rosier, L.: Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Journal of Real-Time Systems 2, 301–324 (1990)
Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proc. of IEEE Real-Time Systems Symposium, pp. 182–190 (December 1990)
Deng, Z., Liu, J.W.-S.: Scheduling real-time applications in an open environment. In: Proc. of IEEE Real-Time Systems Symposium, pp. 308–319 (December 1997)
Feng, X., Mok, A.: A model of hierarchical real-time virtual resources. In: Proc. of IEEE Real-Time Systems Symposium, pp. 26–35 (December 2002)
Furber, S.: ARM System Architecture. Addison Wisley, New York (1996)
Goudge, L., Segars, S.: Thumb: Reducing the cost of 32-bit RISC performance in portable and consumer applications. In: Proc. of the 1996 COMPCON (September 1996)
Halambi, A., Shrivastava, A., Biswas, P., Dutt, N., Nicolau, A.: An efficient compiler technique for code size reduction using reduced bit-width isas. In: Proceedings of Design Automation and Test in Europe, (DATE 2002) (2002)
Kuo, T.-W., Li, C.H.: A fixed-priority-driven open environment for real-time applications. In: Proc. of IEEE Real-Time Systems Symposium, pp. 256–267 (December 1999)
Lee, S., Lee, J., Park, C.Y., Min, S.L.: A flexible tradeoff between code size and WCET using a dual instruction set processor. In: Proceedings of the 8th International Workshop on Software and Compilers for Embedded Systems (SCOPES), Amsterdam, The Netherlands, pp. 244–258 (September 2004)
Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proc. of IEEE Real-Time Systems Symposium, pp. 166–171 (1989)
Lipari, G., Baruah, S.: A hierarchical extension to the constant bandwidth server framework. In: Proc. of IEEE Real-Time Technology and Applications Symposium, pp. 26–35 (May 2001)
Lipari, G., Bini, E.: Resource partitioning among real-time applications. In: Proc. of Euromicro Conference on Real-Time Systems (July 2003)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multi-programming in a hard-real-time environment. Journal of the ACM 20(1), 46–61 (1973)
Mok, A., Feng, X., Chen, D.: Resource partition for real-time systems. In: Proc. of IEEE Real-Time Technology and Applications Symposium, pp. 75–84 (May 2001)
Regehr, J., Stankovic, J.: HLS: A framework for composing soft real-time schedulers. In: Proc. of IEEE Real-Time Systems Symposium, pp. 3–14 (December 2001)
Saewong, S., Rajkumar, R., Lehoczky, J.P., Klein, M.H.: Analysis of hierarchical fixed-priority scheduling. In: Proc. of Euromicro Conference on Real-Time Systems (June 2002)
Shin, I., Lee, I.: Periodic resource model for compositional real-time guarantees. In: Proc. of IEEE Real-Time Systems Symposium, pp. 2–13 (December 2003)
Shin, I., Lee, I.: Compositional real-time scheduling framework. In: Proc. of IEEE Real-Time Systems Symposium (December 2004)
Shin, I., Lee, I., Min, S.: Embedded system design framework for minimizing code size and guaranteeing real-time requirements. In: Proc. of IEEE Real-Time Systems Symposium, pp. 201–211 (December 2002)
Sweetman, D.: See MIPS Run. Morgan Kaufmann, San Francisco (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shin, I., Lee, I. (2005). A Compositional Framework for Real-Time Embedded Systems. In: Malek, M., Nett, E., Suri, N. (eds) Service Availability. ISAS 2005. Lecture Notes in Computer Science, vol 3694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560333_12
Download citation
DOI: https://doi.org/10.1007/11560333_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29103-9
Online ISBN: 978-3-540-32018-0
eBook Packages: Computer ScienceComputer Science (R0)