Pre-Scheduling

Authors:
Weirong Wang;Aloysius K. Mok;Gerhard Fohler
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin 78712-1188;Department of Computer Sciences, University of Texas at Austin, Austin 78712-1188;Department of Computer Engineering, Malardalen University, Sweden
Venue:
Real-Time Systems
Year:
2005

Citing 15
Cited 1

A new polynomial-time algorithm for linear programming

Combinatorica
A decomposition approach to non-preemptive real-time scheduling

Real-Time Systems
Allocation and Scheduling of Precedence-Related Periodic Tasks

IEEE Transactions on Parallel and Distributed Systems
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems

IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Real-Time Systems: Design Principles for Distributed Embedded Applications

Real-Time Systems: Design Principles for Distributed Embedded Applications
Parametric Dispatching of Hard Real-Time Tasks

IEEE Transactions on Computers
Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Scheduling real-time applications in an open environment

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
HLS: A Framework for Composing Soft Real-Time Schedulers

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Towards Compositionality in Real-Time Resource Partitioning Based on Regularity Bounds

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Execution environment for real-time rule-based decision systems

Execution environment for real-time rule-based decision systems
Periodic Resource Model for Compositional Real-Time Guarantees

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Pre-Scheduling on the Domain of Integers

RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
A framework for achieving inter-application isolation in multiprogrammed, hard real-time environments

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium

Task graph pre-scheduling, using Nash equilibrium in game theory

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Static scheduling has been well accepted for its predictability and online simplicity. Traditional static schedule generation techniques are usually based on the assumption of constant rate of resource supply known at design time. Under resource composition schemes, however, this assumption may not be valid for a workload to be statically scheduled. A pre-schedule is a static schedule without assuming constant and completely predictable rate of resource supply. In this paper, concepts of supply function and supply contract are introduced to define the actual online resource supply rate and the constraints to this rate known off-line. Based on these concepts, this paper defines the pre-scheduling problem, and presents a sound, complete, and PTIME pre-scheduler.