TY - GEN
T1 - Task partitioning with replication upon heterogeneous multiprocessor systems
AU - Gopalakrishnan, Sathish
AU - Caccamo, Marco
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Approximation scheme
KW - Fault tolerance
KW - Multiprocessor scheduling
KW - Partitioning
KW - Recurring tasks
UR - https://www.scopus.com/pages/publications/33749588167
U2 - 10.1109/RTAS.2006.43
DO - 10.1109/RTAS.2006.43
M3 - Conference contribution
AN - SCOPUS:33749588167
SN - 0769525164
SN - 9780769525167
T3 - Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
SP - 199
EP - 207
BT - Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
T2 - 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Y2 - 4 April 2006 through 7 April 2006
ER -