Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines

Authors:
Wu-chun Feng;Jane W.-S. Liu
Affiliations:
-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1997

Citing 10
Cited 13

A fault-tolerant scheduling problem

IEEE Transactions on Software Engineering
Minimizing mean weighted execution time loss on identical and uniform processors

Information Processing Letters
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 imprecise computations with timing constraints

SIAM Journal on Computing
Deliberation scheduling for problem solving in time-constrained environments

Artificial Intelligence
Operational rationality through compilation of anytime algorithms

Operational rationality through compilation of anytime algorithms
CIRCA: the cooperative intelligent real-time control architecture

CIRCA: the cooperative intelligent real-time control architecture
Scheduling imprecise hard real-time jobs with cumulative error

Scheduling imprecise hard real-time jobs with cumulative error
Optimizing decision quality with contract algorithms

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Optimal Reward-Based Scheduling for Periodic Real-Time Tasks

IEEE Transactions on Computers
Parametric Design Synthesis of Distributed Embedded Systems

IEEE Transactions on Computers
Real-Time Processing in Client-Server Databases

IEEE Transactions on Computers
Flexible Soft Real-Time Processing in Middleware

Real-Time Systems - Flexible Scheduling on Real-Time Systems
A Specification Framework for Real-Time Scheduling

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Evaluation of Process Scheduling Mechanism for a Web Server Based on Its Behavior while Executing

APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
An Analysis of Totally Clairvoyant Scheduling

Journal of Scheduling
Real-time arithmetic unit

Real-Time Systems
Flexible hard real-time scheduling for deliberative AI systems

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

Journal of Systems and Software
A fast algorithm for scheduling imprecise computations with timing constraints to minimize weighted error

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
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
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real-time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing times of its mandatory and optional parts may become larger. The composite tasks are scheduled by a two-level scheduler. At the high level, the composite tasks are scheduled preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of the composite task