Fault-tolerant Gang Scheduling in Distributed Real-time Systems Utilizing Imprecise Computations

Authors:
Georgios L. Stavrinides;Helen D. Karatza
Affiliations:
Department of Informatics Aristotle University of Thessaloniki54124 Thessaloniki, Greece;Department of Informatics Aristotle University of Thessaloniki54124 Thessaloniki, Greece
Venue:
Simulation
Year:
2009

Citing 12
Cited 4

Algorithms for Scheduling Imprecise Computations

Computer - Special issue on real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Simulation Modeling and Analysis

Simulation Modeling and Analysis
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults

IEEE Transactions on Computers
Improved Utilization and Responsiveness with Gang Scheduling

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Gang Scheduling in a Distributed System under Processor Failures and Time-Varying Gang Size

FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
A Simulation - Based Performance Analysis of Gang Scheduling in a Distributed System

SS '99 Proceedings of the Thirty-Second Annual Simulation Symposium
Real-Time Gang Schedulings with Workload Models for Parallel Computers

ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
An environment for imprecise computations

An environment for imprecise computations
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)

Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Real Time Scheduling Theory: A Historical Perspective

Real-Time Systems
The Impact of Critical Sporadic Jobs on Gang Scheduling Performance in Distributed Systems

Simulation

Scheduling multiple task graphs with end-to-end deadlines in distributed real-time systems utilizing imprecise computations

Journal of Systems and Software
Gang scheduling in multi-core clusters implementing migrations

Future Generation Computer Systems
Boosting adaptivity of fault-tolerant scheduling for real-time tasks with service requirements on clusters

Journal of Systems and Software
Scheduling of frequently communicating tasks

International Journal of Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed real-time systems play an increasingly vital role in our society. The most important aspect of such systems is the scheduling algorithm, which must guarantee that every job in the system will meet its deadline, providing high-quality (precise) results. In this paper we evaluate by simulation the performance of strategies for the scheduling of parallel jobs (gangs) in a homogeneous distributed real-time system with possible software faults. For each scheduling policy we provide an alternative version which allows imprecise computations. We propose a performance metric applicable to our problem, which takes into account the number of jobs guaranteed, as well as the precision of the results of each guaranteed job. The simulation results show that the alternative versions of the algorithms outperform their respective counterparts. To the best of our knowledge, a real-time gang scheduling approach that utilizes imprecise computations has never been discussed in the literature before.