Welcome to the InfoSci Platform
Reference Hub2
New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm

New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm

Hamza Gharsellaoui, Mohamed Khalgui, Samir Ben Ahmed
Copyright: © 2012 |Volume: 4 |Issue: 2 |Pages: 17
ISSN: 1937-965X|EISSN: 1937-9668|EISBN13: 9781466610583|DOI: 10.4018/japuc.2012040106
Cite Article Cite Article

MLA

Gharsellaoui, Hamza, et al. "New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm." IJAPUC vol.4, no.2 2012: pp.65-81. http://doi.org/10.4018/japuc.2012040106

APA

Gharsellaoui, H., Khalgui, M., & Ben Ahmed, S. (2012). New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm. International Journal of Advanced Pervasive and Ubiquitous Computing (IJAPUC), 4(2), 65-81. http://doi.org/10.4018/japuc.2012040106

Chicago

Gharsellaoui, Hamza, Mohamed Khalgui, and Samir Ben Ahmed. "New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm," International Journal of Advanced Pervasive and Ubiquitous Computing (IJAPUC) 4, no.2: 65-81. http://doi.org/10.4018/japuc.2012040106

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper examines the problem of scheduling the mixed workload of both sporadic (on-line) and periodic (off-line) tasks on uniprocessor in a hard real-time environment. The authors introduce an optimal earliest deadline scheduling algorithm to optimize response time while ensuring that all periodic tasks meet their deadlines and to accept as many sporadic tasks. A necessary and sufficient schedulability test is presented, and an efficient O(n+m) guarantee algorithm is proposed. This optimal algorithm results in dynamic scheduling solutions. They are presented by a proposed intelligent agent-based architecture where a software agent is used to evaluate the response time, to calculate the processor utilization factor and also to verify the satisfaction of real-time deadlines. The agent dynamically provides technical solutions for users where the system becomes unfeasible by sending sporadic tasks to idle times, by modifying the deadlines of tasks, the worst case execution times (WCETs), the activation time, by tolerating some non critical tasks according to the (m, n) firm and a reasonable cost, or in the worst case by removing some non hard (soft) tasks according to predefined heuristic. The authors implement the agent to support these services which are applied to extensive experiments with real-life design examples in order to demonstrate the effectiveness and the excellent performance of the new optimal algorithm in normal and overload conditions.

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.