Improved algorithms for synchronizing computer network clocks
IEEE/ACM Transactions on Networking (TON)
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
Real-Time Systems
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Assignment in a Distributed Soft Real-Time System
IEEE Transactions on Parallel and Distributed Systems
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
FARA ¾ A Framework for Adaptive Resource Allocation in Complex Real-Time Systems
RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
End-Host Architecture for QoS-Adaptive Communication
RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
An End-to-End QoS Management Architecture
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
A Dynamic Real-time Benchmark for Assessment of QoS and Resource Management Technology
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
On Quality of Service Optimization with Discrete QoS Options
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
An Automated Profiling Subsystem for QoS-Aware Services
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
A Modified Least-Laxity-First Scheduling Algorithm for Real-Time Tasks
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
A resource allocation model for QoS management
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
On adaptive resource allocation for complex real-time applications
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Practical Solutions for QoS-Based Resource Allocation
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Dynamic Quality of Service Middleware Agent for Mediating Application Resource Usage
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Specification and Modeling of Dynamic, Distributed Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Scalable Solution to the Multi-Resource QoS Problem
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
FARACost: An Adaptation Cost Model Aware of Pending Constraints
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
CoQoS: Coordinating QoS-aware shared resources in NoC-based SoCs
Journal of Parallel and Distributed Computing
| Hi-index | 14.98 |
Abstract-- We present two proactive resource allocation algorithms, called DPR and LPR, for satisfying the timeliness requirements of real-time tasks in asynchronous real-time distributed systems. The algorithms are proactive in the sense that they allow application-specified and user-triggered resource allocation by allowing anticipated task workloads to be specified for future time intervals. When proactively triggered, the algorithms allocate resources to maximize the aggregate deadline-satisfied ratio for the future time interval under the anticipated workload. While DPR uses the Earliest Deadline First scheduling algorithm as the underlying algorithm for process scheduling and packet scheduling, LPR uses a modified Least Laxity First scheduling algorithm. We show that LPR is computationally more expensive than DPR. Further, our experimental studies reveal that LPR yields a higher deadline-satisfied ratio than DPR.