Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems

This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynamic scheduling algorithms are analyzed. 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 Rate-Monotonic (RM) and Earliest-Deadline-First (EDF) policies. A tool is developed which enables to experimentally evaluate the performance of the algorithms from the graph of tasks. The results show that among several partitioning algorithms evaluated, the RM-SmallTask (RMST) algorithm is the best static algorithm and the EDF-Best-Fit (EDF-BF) is the best dynamic algorithm, for non fault-tolerant systems. For faulttolerant systems which require about 49% more processors, the results show that the RM-First-Fit Decreasing Utilization (RM-FFDU) is the best static algorithm and ...

• Type: Conference
• Year: 2006
• Where: PRDC
• Authors: Hakem Beitollahi, Geert Deconinck
• Keywords: Algorithm, Dependable Computing, Partitioning Scheduling Algorithms, PRDC 2006, Scheduling Algorithms