TY - GEN
T1 - Incremental schedulability analysis of hierarchical real-time components
AU - Easwaran, Arvind
AU - Shin, Insik
AU - Sokolsky, Oleg
AU - Lee, Insup
PY - 2006
Y1 - 2006
N2 - Embedded systems are complex as a whole but consist of smaller independent modules minimally interacting with each other. This structure makes embedded systems amenable to compositional system design. Compositional design of real-time embedded systems can be done using hierarchical systems which consist of real-time components arranged in a scheduling hierarchy. Each component consists of a real-time workload and a scheduling policy for the workload. To simplify schedulability analysis of hierarchical systems, analysis can be done compositionally using interfaces that abstract the timing requirements of components. Associative composition will facilitate analysis of systems in which components are modified on the fly. In this paper, we propose efficient algorithms to abstract the resource requirements of components in the form of periodic resource models. Each component interface consists of a set of periodic resource models for different values of period, which allows the selection of a periodic interface that minimizes the collective real-time requirements of hierarchical components. We also describe an interface composition algorithm which accounts for context switch overheads incurred by components and is associative.
AB - Embedded systems are complex as a whole but consist of smaller independent modules minimally interacting with each other. This structure makes embedded systems amenable to compositional system design. Compositional design of real-time embedded systems can be done using hierarchical systems which consist of real-time components arranged in a scheduling hierarchy. Each component consists of a real-time workload and a scheduling policy for the workload. To simplify schedulability analysis of hierarchical systems, analysis can be done compositionally using interfaces that abstract the timing requirements of components. Associative composition will facilitate analysis of systems in which components are modified on the fly. In this paper, we propose efficient algorithms to abstract the resource requirements of components in the form of periodic resource models. Each component interface consists of a set of periodic resource models for different values of period, which allows the selection of a periodic interface that minimizes the collective real-time requirements of hierarchical components. We also describe an interface composition algorithm which accounts for context switch overheads incurred by components and is associative.
KW - Associative real-time interfaces
KW - Compositional schedulability analysis
KW - Hierarchical scheduling
KW - Incremental schedulability analysis
UR - http://www.scopus.com/inward/record.url?scp=34547471004&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547471004&partnerID=8YFLogxK
U2 - 10.1145/1176887.1176927
DO - 10.1145/1176887.1176927
M3 - Conference contribution
AN - SCOPUS:34547471004
SN - 1595935428
SN - 9781595935427
T3 - IEEE International Conference on Embedded Software, EMSOFT 2006
SP - 272
EP - 281
BT - Proceedings of the 6th ACM and IEEE International Conference on Embedded Software, EMSOFT 2006
T2 - 6th ACM and IEEE International Conference on Embedded Software, EMSOFT 2006
Y2 - 22 October 2006 through 25 October 2006
ER -