Compositional real-time scheduling framework for periodic reward-based task model
- Authors
- Tchamgoue, Guy Martin; Kim, Kyong Hoon; Jun, Yong-Kee; Lee, Wan Yeon
- Issue Date
- Jun-2013
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- Compositional and hierarchical real-time scheduling; Interface model; Resource model; Imprecise computation; Reward function
- Citation
- JOURNAL OF SYSTEMS AND SOFTWARE, v.86, no.6, pp 1712 - 1724
- Pages
- 13
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF SYSTEMS AND SOFTWARE
- Volume
- 86
- Number
- 6
- Start Page
- 1712
- End Page
- 1724
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/20650
- DOI
- 10.1016/j.jss.2013.02.052
- ISSN
- 0164-1212
1873-1228
- Abstract
- As the size and complexity of embedded software systems increase, compositional real-time scheduling framework is widely accepted as means to build large and complex systems. A compositional real-time scheduling framework proposes to decompose a system into independent subsystems and provides ways to assemble them into a flexible hierarchical real-time scheduling system while guaranteeing the internal real-time requirements of each subsystem. In this paper, we consider the imprecise reward-based periodic task model in compositional scheduling framework. Thus, we introduce the imprecise periodic resource model to characterize the imprecise resource allocations provided by the system to a single component, and the interface model to abstract the imprecise real-time requirements of the component. The schedulability of mandatory parts is also analyzed to meet the minimum requirement of tasks. Finally, we provide a scheduling algorithm to guarantee a certain amount of reward, which makes it feasible to efficiently compose multiple imprecise components. (C) 2013 Elsevier Inc. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 공과대학 > Department of Aerospace and Software Engineering > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.