Task allocation algorithms for maximizing reliability of distributed computing systems

Kartik, S. Vijay; Murthy, C. Siva Ram

doi:10.1109/12.600888

Cited by 117 publications

(65 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, a task can be replicated on multiple nodes so that even if a subset of these nodes fail, the execution of a task is not impacted. Studies that employ this technique ( [30,17]) assume a probability for node failure to determine the number of nodes on which to replicate the task. Second, the system can checkpoint all the jobs periodically so that work loss is limited when a failure occurs, and there are several studies on tuning checkpoint parameters [21,4,22].…”

Section: Related Workmentioning

confidence: 99%

Performance Implications of Failures in Large-Scale Cluster Scheduling

Zhang

Squillante

Sivasubramaniam

et al. 2005

Job Scheduling Strategies for Parallel Processing

View full text Add to dashboard Cite

Abstract. As we continue to evolve into large-scale parallel systems, many of them employing hundreds of computing engines to take on mission-critical roles, it is crucial to design those systems anticipating and accommodating the occurrence of failures. Failures become a commonplace feature of such large-scale systems, and one cannot continue to treat them as an exception. Despite the current and increasing importance of failures in these systems, our understanding of the performance impact of these critical issues on parallel computing environments is extremely limited. In this paper we develop a general failure modeling framework based on recent results from large-scale clusters and then we exploit this framework to conduct a detailed performance analysis of the impact of failures on system performance for a wide range of scheduling policies. Our results demonstrate that such failures can have a significant impact on the mean job response time and mean job slowdown under existing scheduling policies that ignore failures. We therefore investigate different scheduling mechanisms and policies to address these performance issues. Our results show that periodic checkpointing of jobs seems to do little to ease this problem. On the other hand, we demonstrate that information about the spatial and temporal correlation of failure occurrences can be very useful in designing a scheduling (job allocation) strategy to enhance system performance, with the former providing the greatest benefits.

show abstract

Section: Related Workmentioning

confidence: 99%

Performance Implications of Failures in Large-Scale Cluster Scheduling

Zhang

Squillante

Sivasubramaniam

et al. 2005

Job Scheduling Strategies for Parallel Processing

View full text Add to dashboard Cite

show abstract

“…In line with the existing literature [19], [33], [43], we assume that the transient faults that occur during the execution of different tasks are independent. However, considering the effects of voltage and frequency scaling on transient faults [13], [43], the average rate will depend on the system processing frequency and supply voltage.…”

Section: B Fault Modelmentioning

confidence: 79%

On Maximizing Reliability of Real-Time Embedded Applications Under Hard Energy Constraint

Zhao

Aydın

Zhu

2010

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

Abstract-The dynamic voltage and frequency scaling (DVFS)technique is the basis of numerous state-of-the-art energy management schemes proposed for real-time embedded systems. However, recent research has illustrated the alarmingly negative impact of DVFS on task and system reliability. In this paper, we consider the problem of assigning processing frequencies to a set of real-time tasks in order to maximize the overall reliability, under given time and energy constraints. First, under the frame-based task model, we formulate the problem as a nonlinear optimization problem and show how to obtain the static optimal solution. Then, we propose online (dynamic) algorithms that detect early completions and adjust the task frequencies at runtime, to improve overall reliability. Furthermore, we extend these solutions to the periodic task model, with both static and dynamic solutions. All our solutions ensure that all timing constraints are met while the cumulative energy consumption of tasks does not exceed the given energy budget. Our simulation results indicate that our algorithms perform comparably to a clairvoyant optimal scheduler that knows the exact workload in advance.Index Terms-Dynamic voltage and frequency scaling, real-time embedded systems, reliability.

show abstract

“…Many algorithms and heuristics [9,12,13,14] have been developed to solve the problem of resource allocation in dynamic real-time systems. Most of these resource allocation techniques do not consider the changing environment in which the system operates.…”

Section: Related Workmentioning

confidence: 99%