Reduced communications fault tolerant task scheduling algorithm for multiprocessor systems

, Article Procedia Engineering ; Volume 29 , 2012 , Pages 3820-3825 ; 18777058 (ISSN) Tabbaa, N ; Entezari Maleki, R ; Movaghar, A ; Sharif University of Technology

2012

Abstract

Multiprocessor systems have been widely used for the execution of parallel applications. Task scheduling is crucial for the right operation of multiprocessor systems, where the aim is shortening the length of schedules. Fault tolerance is becoming a necessary attribute in multiprocessor systems as the number of processing elements is getting larger. This paper presents a fault tolerant scheduling algorithm for task graph applications in multiprocessor systems. The algorithm is an extension of a previously proposed algorithm with a reduced communications scheme. Simulation results show the efficiency of the proposed algorithm despite its simplicity

A New Fault Tolerant Task Scheduling Algorithm in Cluster Environments

, M.Sc. Thesis Sharif University of Technology Tabbaa, Nabil (Author) ; Movaghar Rahimabadi, Ali (Supervisor)

Abstract

Emerging technologies enable a set of distributed resources across a network tobe linked together and used in a coordinated fashion to solve a particular parallel applicationat the same time. Such applications are often abstracted as directed acyclicgraphs (DAGs), in which vertices represent application tasks and edges represent datadependencies between tasks.The problem of scheduling in a distributed environment is that ofdeciding where to place tasks, and when to start execution of the tasks. Effective scheduling mechanisms for DAG applicationsare essential to exploit the potential of computational resources. Fault tolerance is an important requirement in distributed computing systems when...

A fault tolerant scheduling algorithm for dag applications in cluster environments

, Article Communications in Computer and Information Science, 7 July 2011 through 9 July 2011 ; Volume 188 CCIS, Issue PART 1 , July , 2011 , Pages 189-199 ; 18650929 (ISSN) ; 9783642223884 (ISBN) Tabbaa, N ; Entezari Maleki, R ; Movaghar, A ; Springer ; Sharif University of Technology

2011

Abstract

Fault tolerance is an essential requirement in systems running applications which need a technique to continue execution where some system components are subject to failure. In this paper, a fault tolerant task scheduling algorithm is proposed for mapping task graphs to heterogeneous processing nodes in cluster computing systems. The starting point of the algorithm is a DAG representing an application with information about the tasks. This information consists of the execution time of the tasks on the target system processors, communication times between the tasks having data dependencies, and the number of the processor failures (ε) which should be tolerated by the scheduling algorithm. The...