Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems

TitleTask Partitioning with Replication upon Heterogeneous Multiprocessor Systems
Publication TypeConference Paper
Year of Publication2006
AuthorsGopalakrishnan, S., and M. Caccamo
Conference NameReal-Time and Embedded Technology and Applications Symposium, 2006. Proceedings of the 12th IEEE
Pagination199 - 207
Date Publishedapr.
Keywordsapproximation, fault tolerance, Multiprocessor scheduling, Partitioning, Recurring, tasks
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.

URLhttp://dx.doi.org/10.1109/RTAS.2006.43
DOI10.1109/RTAS.2006.43

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia