Welcome to the InfoSci Platform
Reference Hub2
Adaptive Hierarchical Scheduling Framework for TiRTOS

Adaptive Hierarchical Scheduling Framework for TiRTOS

Hesham Hussien, Eman Shaaban, Said Ghoniemy
Copyright: © 2019 |Volume: 10 |Issue: 1 |Pages: 17
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781522566786|DOI: 10.4018/IJERTCS.2019010107
Cite Article Cite Article

MLA

Hussien, Hesham, et al. "Adaptive Hierarchical Scheduling Framework for TiRTOS." IJERTCS vol.10, no.1 2019: pp.119-135. http://doi.org/10.4018/IJERTCS.2019010107

APA

Hussien, H., Shaaban, E., & Ghoniemy, S. (2019). Adaptive Hierarchical Scheduling Framework for TiRTOS. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 10(1), 119-135. http://doi.org/10.4018/IJERTCS.2019010107

Chicago

Hussien, Hesham, Eman Shaaban, and Said Ghoniemy. "Adaptive Hierarchical Scheduling Framework for TiRTOS," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 10, no.1: 119-135. http://doi.org/10.4018/IJERTCS.2019010107

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The complexity of embedded real-time systems has increased, and most applications have large diversity in execution times of their tasks. Therefore, most traditional scheduling techniques do not satisfy requirements of such applications. This article proposes an adaptive hierarchical scheduling framework for a set of independent concurrent applications composing of soft and hard real time tasks, that run on a single processor. It ensures temporal partitioning between independent applications with budget adaption feature, where CPU time of each application is periodically and dynamically assigned. Implemented in the kernel of TI-RTOS on a resource constrained platform, experiments show that proposed scheme provides good performance for multiple applications with dynamic tasks under overload conditions. Compared with traditional priority scheduler originally implemented in TI-RTOS and EDF scheduler, it achieves low miss ratio with minimal overhead while yielding temporal partitioning.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.