Stack-based scheduling for realtime processes
Real-Time Systems
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Function-driven scheduling: a general framework for expression and analysis of scheduling
Function-driven scheduling: a general framework for expression and analysis of scheduling
A scheduling algorithm for tasks described by time value function
Real-Time Systems
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
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
A resource allocation model for QoS management
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Choir: A Real-Time Middleware Architecture Supporting Benefit-Based Proactive Resource Allocation
ISORC '03 Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Scheduling dependent real-time activities
Scheduling dependent real-time activities
An incremental approach to scheduling during overloads in real-time systems
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Utility Accrual Real-Time Scheduling under Variable Cost Functions
IEEE Transactions on Computers
Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds
IEEE Transactions on Computers
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
Adaptive data-aware utility-based scheduling in resource-constrained systems
Adaptive data-aware utility-based scheduling in resource-constrained systems
Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time
Proceedings of the 2010 ACM Symposium on Applied Computing
Adaptive data-aware utility-based scheduling in resource-constrained systems
Journal of Parallel and Distributed Computing
Improving architecture-based self-adaptation using preemption
SOAR'09 Proceedings of the First international conference on Self-organizing architectures
On best-effort utility accrual real-time scheduling on multiprocessors
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
On-line scheduling of real-time services with profit and penalty
Proceedings of the 2011 ACM Symposium on Applied Computing
On-line scheduling of target sensitive periodic tasks with the gravitational task model
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 14.99 |
This paper presents a uni-processor real-time scheduling algorithm called the Generic Utility Scheduling algorithm (which we will refer to simply as GUS). GUS solves a previously open real-time scheduling problem—scheduling application activities that have time constraints specified using arbitrarily shaped time/utility functions and have mutual exclusion resource constraints. A time/utility function is a time constraint specification that describes an activity's utility to the system as a function of that activity's completion time. Given such time and resource constraints, we consider the scheduling objective of maximizing the total utility that is accrued by the completion of all activities. Since this problem is {\cal N}{\cal P}{\hbox{-}}{\rm hard}, GUS heuristically computes schedules with a polynomial-time cost of O(n^3) at each scheduling event, where n is the number of activities in the ready queue. We evaluate the performance of GUS through simulation and by an actual implementation on a real-time POSIX operating system. Our simulation studies and implementation measurements reveal that GUS performs close to, if not better than, the existing algorithms for the cases that they apply. Furthermore, we analytically establish several properties of GUS.