Referenced Items are not available for this document.
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.
Published in:
Real-Time and Embedded Technology and Applications Symposium, 2006. Proceedings of the 12th IEEE
Date of Conference: 04-07 April 2006
- Page(s):
- 199 - 207
- ISSN :
- 1545-3421
- Print ISBN:
- 0-7695-2516-4
- Digital Object Identifier :
- 10.1109/RTAS.2006.43
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
