loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Parallel and Distributed Processing Symposium (IPDPS'03)
Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor
Nice, France
April 22-April 26
ISBN: 0-7695-1926-1
ASCII Text
x 
 
Josep M. Banús, Alex Arenas, Jesús Labarta, "Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor," Parallel and Distributed Processing Symposium, International, pp. 112b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/IPDPS.2003.1213223,
author = {Josep M. Banús and Alex Arenas and Jesús Labarta},
title = {Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor},
journal ={Parallel and Distributed Processing Symposium, International},
volume = {0},
year = {2003},
issn = {1530-2075},
pages = {112b},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213223},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Processing Symposium, International
TI - Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor
SN - 1530-2075
SP
EP
A1 - Josep M. Banús,
A1 - Alex Arenas,
A1 - Jesús Labarta,
PY - 2003
KW - real-time
KW - shared memory multiprocessors
KW - global scheduling
KW - soft-aperiodic tasks
VL - 0
JA - Parallel and Distributed Processing Symposium, International
ER -
 
Josep M. Banús, Universitat Rovira i Virgili
Alex Arenas, Universitat Rovira i Virgili
Jesús Labarta, Universitat Politècnica de Catalunya
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard real-time periodic tasks and soft-aperiodic tasks in shared memory multiprocessor systems. The goal is to achieve low mean aperiodic response times while meeting all periodic task deadlines. Our proposal allows periodic and aperiodic tasks to migrate to other processors to improve aperiodic mean response time. We show via extensive simulations that our approach gives better results than local Slack Stealing Schedulers.
Index Terms:
real-time, shared memory multiprocessors, global scheduling, soft-aperiodic tasks
Citation:
Josep M. Banús, Alex Arenas, Jesús Labarta, "Dual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor," ipdps, pp.112b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.