BOOK-CHAPTER

A Fault Tolerant Decentralized Scheduling in Large Scale Distributed Systems

Florin Pop

Year: 2010 IGI Global eBooks Pages: 566-588   Publisher: IGI Global

Abstract

This chapter presents a fault tolerant framework for the applications scheduling in large scale distributed systems (LSDS). Due to the specific characteristics and requirements of distributed systems, a good scheduling model should be dynamic. More specifically, it should adapt the scheduling decisions to resource state changes, which are commonly captured through monitoring. The scheduler and the monitor are two important middleware pieces that correlate their actions to ensure the high performance execution of distributed applications. The chapter presents and analyses agent based architecture for scheduling in large scale distributed systems. Then the user and resources management are presented. Optimization schemes for scheduling consider the near-optimal algorithm for distributed scheduling. The chapter presents the solution for scheduling optimization. The chapter covers and explains the fault tolerance cases for Grid environments and describes two possible scenarios for scheduling system.

Keywords:
Distributed computing Computer science Fair-share scheduling Scheduling (production processes) Dynamic priority scheduling Two-level scheduling Round-robin scheduling Fixed-priority pre-emptive scheduling Grid Rate-monotonic scheduling Fault tolerance Engineering Operating system Schedule

Metrics

4
Cited By
1.57
FWCI (Field Weighted Citation Impact)
4
Refs
0.79
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Distributed and Parallel Computing Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Cloud Computing and Resource Management
Physical Sciences →  Computer Science →  Information Systems
Parallel Computing and Optimization Techniques
Physical Sciences →  Computer Science →  Hardware and Architecture
© 2026 ScienceGate Book Chapters — All rights reserved.