@inproceedings{00554dd2506444f9b2c34155ce2dc639,
title = "Task partitioning with replication upon heterogeneous multiprocessor systems",
abstract = "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.",
keywords = "Approximation scheme, Fault tolerance, Multiprocessor scheduling, Partitioning, Recurring, tasks",
author = "Sathish Gopalakrishnan and Marco Caccamo",
year = "2006",
doi = "10.1109/RTAS.2006.43",
language = "English",
isbn = "9780769525167",
series = "Real-Time Technology and Applications - Proceedings",
pages = "199--207",
booktitle = "Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2006",
note = "12th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2006 ; Conference date: 04-04-2006 Through 07-04-2006",
}