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

Authors:
Georgios L. Stavrinides;Helen D. Karatza
Affiliations:
Department of Informatics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece;Department of Informatics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece
Venue:
Journal of Systems and Software
Year:
2010

Citing 15
Cited 10

Scheduling Periodic Jobs that Allow Imprecise Results

IEEE Transactions on Computers
Algorithms for Scheduling Imprecise Computations

Computer - Special issue on real-time systems
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines

IEEE Transactions on Software Engineering
LSTF: a new scheduling policy for complex real-time tasks in multiple processor systems

Automatica (Journal of IFAC)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
A comparison of list schedules for parallel processing systems

Communications of the ACM
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults

IEEE Transactions on Computers
Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Applications and extensions of the imprecise-computation model

Applications and extensions of the imprecise-computation model
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
Fault-tolerant Gang Scheduling in Distributed Real-time Systems Utilizing Imprecise Computations

Simulation

A novel statistical time-series pattern based interval forecasting strategy for activity durations in workflow systems

Journal of Systems and Software
Boosting adaptivity of fault-tolerant scheduling for real-time tasks with service requirements on clusters

Journal of Systems and Software
The impact of input error on the scheduling of task graphs with imprecise computations in heterogeneous distributed real-time systems

ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
An effective duplication-based task-scheduling algorithm for heterogeneous systems

Simulation
Sharp utilization thresholds for some realtime scheduling problems

ACM SIGMETRICS Performance Evaluation Review
Scheduling real-time DAGs in heterogeneous clusters by combining imprecise computations and bin packing techniques for the exploitation of schedule holes

Future Generation Computer Systems
Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

Journal of Systems and Software
Task scheduling in heterogeneous distributed systems with security and QoS requirements

International Journal of Communication Networks and Distributed Systems
On using adversary simulators to evaluate global fixed-priority and FPZL scheduling of multiprocessors

Journal of Systems and Software
An approach for constructing private storage services as a unified fault-tolerant system

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to meet the inherent need of real-time applications for high quality results within strict timing constraints, the employment of effective scheduling techniques is crucial in distributed real-time systems. In this paper, we evaluate by simulation the performance of strategies for the dynamic scheduling of composite jobs in a homogeneous distributed real-time system. Each job that arrives in the system is a directed acyclic graph of component tasks and has an end-to-end deadline. For each scheduling policy, we provide an alternative version which allows imprecise computations, taking into account the effects of input error on the processing time of the component tasks of a job. The simulation results show that the alternative versions of the algorithms outperform their respective counterparts. To our knowledge, an imprecise computations approach for the dynamic scheduling of multiple task graphs with end-to-end deadlines and input error has never been discussed in the literature before.