Welcome to the InfoSci Platform
A Self-Organized Scheduling Algorithm for Embedded Real-Time Systems

A Self-Organized Scheduling Algorithm for Embedded Real-Time Systems

Sonia Sabrina Bendib, Hamoudi Kalla, Salim Kalla, Riadh Hocine
Copyright: © 2021 |Volume: 12 |Issue: 2 |Pages: 17
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781799861652|DOI: 10.4018/IJERTCS.2021040104
Cite Article Cite Article

MLA

Bendib, Sonia Sabrina, et al. "A Self-Organized Scheduling Algorithm for Embedded Real-Time Systems." IJERTCS vol.12, no.2 2021: pp.57-73. http://doi.org/10.4018/IJERTCS.2021040104

APA

Bendib, S. S., Kalla, H., Kalla, S., & Hocine, R. (2021). A Self-Organized Scheduling Algorithm for Embedded Real-Time Systems. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 12(2), 57-73. http://doi.org/10.4018/IJERTCS.2021040104

Chicago

Bendib, Sonia Sabrina, et al. "A Self-Organized Scheduling Algorithm for Embedded Real-Time Systems," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 12, no.2: 57-73. http://doi.org/10.4018/IJERTCS.2021040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this paper, the authors present a self-organized approach for scheduling tasks on processors in embedded real-time systems. For such a mapping, two conflicting objectives have to be optimized: the reliability and the schedule length. Since the scheduling problem is NP-hard, a heuristic algorithm is used to produce schedules achieving different trade-offs between the two objectives. Moreover, a self-organization strategy based on dynamic crowding distance is adopted. This allows a better exploration of the objective space as well as an enhanced solution diversity. The proposed algorithm, reliability schedule length trad-offs algorithm (RSTA), is tested and compared with the popular SPEA2 algorithm where experimental results are promising on both quality and diversity of solutions.

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.