Loading...

Reduced communications fault tolerant task scheduling algorithm for multiprocessor systems

Tabbaa, N ; Sharif University of Technology

662 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.proeng.2012.01.577
  3. Abstract:
  4. 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
  5. Keywords:
  6. Fault tolerant scheduling ; Fault-tolerant ; Multi processor systems ; Parallel application ; Processing elements ; Task graph ; Task scheduling ; Task-scheduling algorithms ; Electronics engineering ; Multitasking ; Scheduling algorithms ; Fault tolerance
  7. Source: Procedia Engineering ; Volume 29 , 2012 , Pages 3820-3825 ; 18777058 (ISSN)
  8. URL: http://www.sciencedirect.com/science/article/pii/S1877705812005875