Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Graph Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Resource Management Middleware for Dynamic, DependableReal-Time Systems
Real-Time Systems - Special issue on challenges in design and implementation of middlewares for real time systems
IEEE Transactions on Software Engineering
Expanding Small Example into Large Scale Real-Time Control System
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
Template-Based Real-Time Dwell Scheduling with Energy Constraint
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Efficient Online Schedulability Tests for Real-Time Systems
IEEE Transactions on Software Engineering
Enhanced Utilization Bounds for QoS Management
IEEE Transactions on Computers
Journal of Systems and Software
A Technique for Adaptive Scheduling of Soft Real-Time Tasks
Real-Time Systems
Event-driven scheduling for dynamic workload scaling in uniprocessor embedded systems
Proceedings of the 2006 ACM symposium on Applied computing
Modified MUF and EDF algorithms for overloaded soft real time systems
ACACOS'08 Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science
| Hi-index | 14.98 |
We provide a framework for discussing how to adjust load in order to handle periodic processes whose timing parameters vary with time. The schedulability of adjustable periodic processes by a preemptive fixed priority scheduler is formulated in terms of a configuration selection problem for which a PTIME solution is shown. When the list of allowable configurations is implicitly given by a set of scalable periodic processes, the corresponding period assignment problem is shown to be NP-Complete. We present an approximation algorithm for the period assignment problem for which we show some encouraging experimental results.