Please use this identifier to cite or link to this item:
|Title:||Incremental schedulability analysis of hierarchical real-time components||Authors:||Easwaran, Arvind
|Keywords:||DRNTU::Engineering::Computer science and engineering||Issue Date:||2006||Source:||Easwaran, A., Shin, I., Sokolsky, O., & Lee, I. (2006). Incremental Schedulability Analysis of Hierarchical Real-Time Components. ESWEEK '06 Second Embedded Systems Week 2006, pp.272-281.||Abstract:||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 realtime workload and a scheduling policy for the workload. To simplify schedulability analysis of hierarchical systems, analysis 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.||URI:||https://hdl.handle.net/10356/96911
|DOI:||10.1145/1176887.1176927||Rights:||© 2006 Association for Computing Machinery.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.