An Efficient Grid Scheduling Algorithm with Fault Tolerance and User Satisfaction
P. Keerthika,N. Kasthuri +1 more
TL;DR: A new bicriteria scheduling algorithm that considers user satisfaction along with fault tolerance has been introduced and achieves reduced makespan and better hit rate with higher user satisfaction and fault tolerance.
read more
Abstract: Problem Statement. The advances in human civilization lead to more complications in problem solving. Grid computing serves as an efficient technology in solving those complicated problems. In computational grids, the grid scheduler schedules the task and finds the appropriate resource for each task. The scheduler must consider several factors such as user demand, communication time, failure handling mechanisms, and reduced makespan. Most of the existing algorithms do not consider user satisfaction. Thus a scheduling algorithm that handles failure of resources and achieves user satisfaction gains more importance. Approach. A new bicriteria scheduling algorithm (BSA) that considers user satisfaction along with fault tolerance has been introduced. The main contribution of this paper includes achieving user satisfaction along with fault tolerance and minimizing the makespan of jobs. Results. The performance of this proposed algorithm is evaluated using GridSim based on makespan and number of jobs completed successfully within user deadline. Conclusions/Recommendations. The proposed BSA algorithm achieves reduced makespan and better hit rate with higher user satisfaction and fault tolerance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Task scheduling with fault-tolerance in real-time heterogeneous systems
TL;DR: This paper addresses the problem of scheduling tasks on heterogeneous systems with the target to support the maximum number of permanent failures while meeting a given time constraint and proposes a heuristic algorithm DBSA, which can effectively tolerate failures and improves system reliability.
33
A Hybrid Scheduling Algorithm with Load Balancing for Computational Grid
P. Keerthika,N. Kasthuri +1 more
TL;DR: This research proposes a new scheduling algorithm for computational grids that considers load balancing, fault tolerance and user satisfaction based on the grid architecture, resource heterogeneity, resource availability and job characteristics such as user deadline.
A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance
P. Keerthika,P. Suresh +1 more
TL;DR: The proposed Multiconstrained Load Balancing Fault Tolerant algorithm (MLFT) reduces the schedule makespan, schedule cost, and task failure rate and improves resource utilization.
Dynamic Scheduling in Grid Environent with the Improvement of Fault Tolerant Level
K. Nirmala Devi,A. Tamilarasi +1 more
TL;DR: The findings demonstrate that the Fault-Tolerant Based Dynamic Scheduling algorithm is presented and suggested that this method has high fault tolerance rate to prevent the task execution from the resource failure.
5
Efficient load balancing scheduling for deadline constrained tasks on grid computing
Ankita Jindal,Rakesh Kumar Bansal,Savina Bansal +2 more
- 01 Dec 2014
TL;DR: This research proposes a new scheduling algorithm for computational grids that considers user satisfaction, load balancing; fault tolerance based on the resource availability and job characteristics such as user deadline and decreases the make-span of the schedule.
3
References
The anatomy of the grid: enabling scalable virtual organizations
Ian Foster
- 28 Aug 2001
TL;DR: The term "the Grid" was coined in the mid-1990s to denote a proposed distributed computing infrastructure for advanced science and engineering but the term has also been conflated, at least in popular perception, to embrace everything from advanced networking to artificial intelligence.
The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration
Ian Foster,Carl Kesselman,Jeffrey M. Nick,Steven Tuecke +3 more
- 01 Jan 2002
TL;DR: This presentation complements an earlier foundational article, “The Anatomy of the Grid,” by describing how Grid mechanisms can implement a service-oriented architecture, explaining how Grid functionality can be incorporated into a Web services framework, and illustrating how the architecture can be applied within commercial computing as a basis for distributed system integration.
A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
Tracy D. Braun,Howard Jay Siegel,N.B. Beck,Ladislau Bölöni,Muthucumaru Maheswaran,Albert Reuther,James Patrick Robertson,Mitchell D. Theys,Bin Yao,Debra Hensgen,Richard F. Freund +10 more
TL;DR: It is shown that for the cases studied here, the relatively simple Min?min heuristic performs well in comparison to the other techniques, and one even basis for comparison and insights into circumstances where one technique will out-perform another.
1.9K
•Posted Content
A Deadline and Budget Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids
Rajkumar Buyya,Manzur Murshed +1 more
TL;DR: In this paper, the authors proposed a computational economy framework for regulating the supply and demand for resources and allocating them for applications based on the users quality of services requirements, which requires economy driven deadline and budget constrained (DBC) scheduling algorithms for allocating resources to application jobs in such a way that the users requirements are met.
•Proceedings Article
A deadline and budget constrained cost-time optimisation algorithm for scheduling task farming applications on global grids
Rajkumar Buyya,Manzur Murshed,David Abramson +2 more
- 01 Jan 2002
TL;DR: The superiority of this new scheduling algorithm, in achieving lower job completion time, is demonstrated by simulating the World-Wide Grid and scheduling task-farming applications for different deadline and budget scenarios using both this new and the cost optimisation scheduling algorithms.
155