Optimal rate-based scheduling on multiprocessors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Rate-Based Resource Allocation Models for Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Proceedings of the 40th annual Design Automation Conference
Real-Time Digital Signal Processing of Phased Array Radars
IEEE Transactions on Parallel and Distributed Systems
Scheduling Analysis Integration for Heterogeneous Multiprocessor SoC
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Resource Reservation in Dynamic Real-Time Systems
Real-Time Systems
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Real-Time Dwell Scheduling of Component-Oriented Phased Array Radars
IEEE Transactions on Computers
Scheduling legacy multimedia applications
Journal of Systems and Software - Special issue: Adaptive multimedia computing
Global Control of Robotic Highway Safety Markers: A Real-time Solution
Real-Time Systems
LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
The Granularity Metric for Fine-Grain Real-Time Scheduling
IEEE Transactions on Computers
Optimal rate-based scheduling on multiprocessors
Journal of Computer and System Sciences
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
An anomaly prevention approach for real-time task scheduling
Journal of Systems and Software
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
Journal of Computer and System Sciences
Partition oriented frame based fair scheduler
Journal of Parallel and Distributed Computing
Real-time digital signal processing of component-oriented phased array radars
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Embedded Systems Design
A dual-band priority assignment algorithm for dynamic QoS resource management
Future Generation Computer Systems
Hi-index | 0.01 |
We present a task model for the real-time execution of event-driven tasks in which no a priori characterization of the actual arrival rates of events is known; only the expected arrival rates of events is known. The model, called rate-based execution (RBE), is a generalization of Mok's sporadic task model [14]. The RBE model is motivated naturally by distributed multimedia and digital signal processing applications. We derive necessary and sufficient conditions for determining the feasibility of an RBE task set and demonstrate that earliest deadline first (EDF) scheduling is an optimal scheduling algorithm for both preemptive and non-preemptive execution environments, as well as hybrid environments wherein RBE tasks access shared resources.Our analysis of RBE tasks demonstrates a fundamental distinction between deadline based scheduling methods and static priority based methods. We show that for deadline-based scheduling methods, feasibility is solely a function of the distribution of task deadlines in time. This is contrasted with static priority schedulers where feasibility is a function of the actual arrival rates of work for tasks. Thus whereas the feasibility of static priority schedulers is a function of the periodicity of tasks, the feasibility of deadline schedulers is independent of task arrival processes and hence deadline schedulers are more suitable for use in distributed, event-driven, real-time systems.