Competitive analysis of task scheduling algorithms on a fault-prone machine and the impact of resource augmentation
AuthorFernández Anta, Antonio
Kowalski, D. R.
Source2nd International Workshop on Adaptive Resource Management and Scheduling for Cloud Computing, ARMS-CC 2015
Google Scholar check
MetadataShow full item record
Reliable task execution on machines that are prone to unpredictable crashes and restarts is both important and challenging, but not much work exists on the analysis of such systems. We consider the online version of the problem, with tasks arriving over time at a single machine under worst-case assumptions. We analyze the fault-tolerant properties of four popular scheduling algorithms: Longest In System (LIS), Shortest In System (SIS), Largest Processing Time (LPT) and Shortest Processing Time (SPT). We use three metrics for the evaluation and comparison of their competitive performance, namely, completed load, pending load, and latency. We also investigate the effect of resource augmentation in their performance, by increasing the speed of the machine. Hence, we compare the behavior of the algorithms for different speed intervals and show that there is no clear winner with respect to all the three considered metrics. While SPT is the only algorithm that achieves competitiveness on completed load for small speed, LIS is the only one that achieves competitiveness on latency (for large enough speed). © Springer International Publishing Switzerland 2015.
Showing items related by title, author, creator and subject.
A neural-type parallel algorithm for fast matrix inversion Polycarpou, Marios M.; Ioannou, P. A. (1991)
Online parallel scheduling of non-uniform tasks: Trading failures for energy Fernández Anta, Antonio; Georgiou, Chryssis; Kowalski, D. R.; Zavou, Elli (2015)Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of machines that are prone to crashes and restarts. In this paper we model and study the impact of parallelism ...
Max-product algorithms for the generalized multiple-fault diagnosis problem Le, T.; Hadjicostis, Christoforos N. (2007)In this paper, we study the application of the max-product algorithm (MPA) to the generalized multiple-fault diagnosis (GMFD) problem, which consists of components (to be diagnosed) and alarms/connections that can be ...