Incremental schedulability analysis of hierarchical real-time components

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 con...

Full description

Saved in:
Bibliographic Details
Main Authors: Easwaran, Arvind, Shin, Insik, Sokolsky, Oleg, Lee, Insup
Other Authors: School of Computer Engineering
Format: Conference or Workshop Item
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/96911
http://hdl.handle.net/10220/10200
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-96911
record_format dspace
spelling sg-ntu-dr.10356-969112020-05-28T07:17:58Z Incremental schedulability analysis of hierarchical real-time components Easwaran, Arvind Shin, Insik Sokolsky, Oleg Lee, Insup School of Computer Engineering International conference on Embedded software (6th : 2006) DRNTU::Engineering::Computer science and engineering 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. 2013-06-11T07:44:42Z 2019-12-06T19:36:35Z 2013-06-11T07:44:42Z 2019-12-06T19:36:35Z 2006 2006 Conference Paper 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. https://hdl.handle.net/10356/96911 http://hdl.handle.net/10220/10200 10.1145/1176887.1176927 173529 en © 2006 Association for Computing Machinery.
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering
spellingShingle DRNTU::Engineering::Computer science and engineering
Easwaran, Arvind
Shin, Insik
Sokolsky, Oleg
Lee, Insup
Incremental schedulability analysis of hierarchical real-time components
description 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.
author2 School of Computer Engineering
author_facet School of Computer Engineering
Easwaran, Arvind
Shin, Insik
Sokolsky, Oleg
Lee, Insup
format Conference or Workshop Item
author Easwaran, Arvind
Shin, Insik
Sokolsky, Oleg
Lee, Insup
author_sort Easwaran, Arvind
title Incremental schedulability analysis of hierarchical real-time components
title_short Incremental schedulability analysis of hierarchical real-time components
title_full Incremental schedulability analysis of hierarchical real-time components
title_fullStr Incremental schedulability analysis of hierarchical real-time components
title_full_unstemmed Incremental schedulability analysis of hierarchical real-time components
title_sort incremental schedulability analysis of hierarchical real-time components
publishDate 2013
url https://hdl.handle.net/10356/96911
http://hdl.handle.net/10220/10200
_version_ 1681056395897602048