Real-Time Task Replication for Fault Tolerance in Identical Multiprocessor Systems

Authors:
Jian-Jia Chen;Chuan-Yue Yang;Tei-Wei Kuo;Shau-Yin Tseng
Affiliations:
National Taiwan University, Taiwan;National Taiwan University, Taiwan;National Taiwan University, Taiwan;Industrial Technology Research Institute,Taiwan
Venue:
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Year:
2007

Citing 0
Cited 3

FLARe: a Fault-tolerant Lightweight Adaptive Real-time middleware for distributed real-time and embedded systems

Proceedings of the 4th on Middleware doctoral symposium
Maximizing job benefits on multiprocessor systems using a greedy algorithm

ACM SIGBED Review - Special issue on the the 14th IEEE real-time and embedded technology and applications symposium (RTAS'08) WIP session
Scheduling for real-time mobile MapReduce systems

Proceedings of the 5th ACM international conference on Distributed event-based system

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibility in tolerating processor failures via task replication. This paper considers the replication of periodic hard real-time tasks in identical multiprocessor environments. Each task is replicated on K distinct processors, where K is a user-determined integer for fault tolerance to improve system reliability. When the objective is to minimize the maximum utilization in a system with a specified number of processors, we present a greedy algorithm with a 2-approximation ratio, and a polynomial-time approximation scheme is developed. For the minimization of the number of processors required to derive feasible schedules with task replication, we develop greedy algorithms with a 2- approximation ratio and an asymptotic polynomial-time approximation scheme.