System support for automatic profiling and optimization
Proceedings of the sixteenth ACM symposium on Operating systems principles
An Adaptive, Distributed Airborne Tracking System ("process the Right Tracks at the Right Time")
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
Scheduling dependent real-time activities
Scheduling dependent real-time activities
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Efficient scheduling of soft real-time applications on multiprocessors
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Adapting Pfair scheduling for symmetric multiprocessors
Journal of Embedded Computing - Cache exploitation in embedded systems
Optimizing on-demand data broadcast scheduling in pervasive environments
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Fair and efficient scheduling in data ferrying networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Hi-index | 0.00 |
We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called gMUA. The algorithm considers an application model where real-time activities are subject to time/utility function time constraints, variable execution time demands, and resource overloads where the total activity utilization demand exceeds the total capacity of all processors. We establish several properties of gMUA including optimal total utility (for a special case), conditions under which individual activity utility lower bounds are satisfied, a lower bound on system-wide total accrued utility, and bounded sensitivity for assurances to variations in execution time demand estimates. Our simulation experiments confirm our analysis and illustrate the algorithm's effectiveness