Loading...

Performance evaluation of fault-tolerant scheduling algorithms in real-time multiprocessor systems

Beitollahi, H ; Sharif University of Technology | 2005

164 Viewed
  1. Type of Document: Article
  2. Publisher: 2005
  3. Abstract:
  4. This paper presents the performance analysis of several best-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. To do this, multiple versions of tasks are executed on different processors. Both static and dynamic scheduling algorithms are analyzed. In the case of static scheduling algorithms, rate-monotonic (RM) scheduling policy is considered. In the dynamic scheduling algorithms, the scheduling policies are rate-monotonic and earliest-deadline-first (EDF). Partitioning scheduling algorithms which are studied here are heuristic algorithms that are formed by combining any of the bin-packing algorithms with any of the schedulability conditions for the RM and EDF policies. A tool is designed and implemented for performance evaluation. The simulation results show that among several evaluated algorithms, the rate-monotonic first-fit decreasing utilization (RM-FFDU) is the best static and the earliest-deadline- first best-fit (EDF-BF) is the best dynamic partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems
  5. Keywords:
  6. Algorithms ; Multiprocessing systems ; Real time systems ; Scheduling ; Earliest-deadline-first (EDF) ; Partitioning scheduling algorithms ; Rate-monotonic ; Scheduling policies ; Fault tolerant computer systems
  7. Source: IASTED International Conference on Parallel and Distributed Computing and Networks, as part of the 23rd IASTED International Multi-Conference on Applied Informatics, Innsbruck, 15 February 2005 through 17 February 2005 ; 2005 , Pages 479-484 ; 10272666 (ISSN)
  8. URL: https://www.actapress.com/Abstract.aspx?paperId=19243