loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06)
Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems
San Jose, California
April 04-April 07
ISBN: 0-7695-2516-4
ASCII Text
x 
 
Sathish Gopalakrishnan, Marco Caccamo, "Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems," Real-Time and Embedded Technology and Applications Symposium, IEEE, pp. 199-207, 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/RTAS.2006.43,
author = {Sathish Gopalakrishnan and Marco Caccamo},
title = {Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems},
journal ={Real-Time and Embedded Technology and Applications Symposium, IEEE},
volume = {0},
year = {2006},
isbn = {0-7695-2516-4},
pages = {199-207},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTAS.2006.43},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time and Embedded Technology and Applications Symposium, IEEE
TI - Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems
SN - 0-7695-2516-4
SP199
EP207
A1 - Sathish Gopalakrishnan,
A1 - Marco Caccamo,
PY - 2006
KW - Multiprocessor scheduling; Recurring tasks; Fault tolerance; Partitioning; Approximation scheme
VL - 0
JA - Real-Time and Embedded Technology and Applications Symposium, IEEE
ER -
 
Sathish Gopalakrishnan, University of Illinois at Urbana-Champaign
Marco Caccamo, University of Illinois at Urbana-Champaign
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units in such a way that all tasks meet their timing constraints and no two replicas of the same task are assigned to the same processing unit. The replication requirement improves the resilience of the real-time system to a finite number of processor failures. This problem is NP-hard in the strong sense. We develop a Fully Polynomial-Time Approximation Scheme (FPTAS) for this problem.
Index Terms:
Multiprocessor scheduling; Recurring tasks; Fault tolerance; Partitioning; Approximation scheme
Citation:
Sathish Gopalakrishnan, Marco Caccamo, "Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems," rtas, pp.199-207, 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.