Mechanisms for reliable distributed real-time operating systems: The Alpha Kernel
Mechanisms for reliable distributed real-time operating systems: The Alpha Kernel
A scheduling algorithm for tasks described by time value function
Real-Time Systems
Scheduling in distributed soft real-time systems with autonomous components
Scheduling in distributed soft real-time systems with autonomous components
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Deadline Assignment in a Distributed Soft Real-Time System
IEEE Transactions on Parallel and Distributed Systems
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
Optimized priority assignment for tasks and messages in distributed hard real-time systems
WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
An Engineering Approach to Decomposing End-to-End Delays on a Distributed Real-Time System
WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems
Resource Conscious Design of Distributed Real-Time Systems: An End-to-End Approach
ICECCS '96 Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems
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
IEEE Transactions on Parallel and Distributed Systems
Utility accrual real-time scheduling: models and algorithms
Utility accrual real-time scheduling: models and algorithms
30 seconds is not enough!: a study of operating system timer usage
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
On Fuzzy Projection-Based Utility Decomposition in Compound Multi-agent Negotiations
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Online robust optimization framework for QoS guarantees in distributed soft real-time systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Journal of Systems and Software
Utility accrual object distribution in MPSoC real-time embedded systems
Journal of Computer and System Sciences
| Hi-index | 14.98 |
We consider Real-Time CORBA 1.2's distributable threads (DTs), whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resources驴both physical and logical驴are shared among time-critical DTs and local applications that may also be time-critical. Hence, DTs that are scheduled using their propagated TUFs, as mandated by Real-Time CORBA 1.2's Case 2 approach, may suffer performance degradation, if a node utility accrual (UA) scheduler achieves higher locally accrued utility by giving higher eligibility to local threads than to DTs. To alleviate this, we consider decomposing TUFs of DTs into "sub-TUFs驴 for scheduling segments of DTs. We present five decomposition techniques, called UT, SCEQF, SCALL, OPTCON, and TUFS, which are specific to different classes of UA scheduling algorithms, such as those that use utility density and those that use deadline as their key decision metric. Our experimental studies identify the decomposition technique that performs best for each class of UA scheduling algorithms. In particular, our studies show that OPTCON and TUFS perform best for utility density-based UA algorithms, while SCEQF and SCALL perform best for deadline-based UA algorithms.