Improved algorithms for synchronizing computer network clocks
IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
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
Responsive Computer Systems: Steps toward Fault-Tolerant Real-Time System
Responsive Computer Systems: Steps toward Fault-Tolerant Real-Time System
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Guest Editors' Introduction to Special Section on Asynchronous Real-Time Distributed Systems
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
End-Host Architecture for QoS-Adaptive Communication
RTAS '98 Proceedings of the Fourth 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)
On adaptive resource allocation for complex real-time applications
RTSS '97 Proceedings of the 18th 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
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
On quality of service management (resource allocation)
On quality of service management (resource allocation)
DPR, LPR: Proactive Resource Allocation Algorithms for Asynchronous Real-Time Distributed Systems
IEEE Transactions on Computers
Fast, Best-Effort Real-Time Scheduling Algorithms
IEEE Transactions on Computers
Proactive QoS negotiation in asynchronous real-time distributed systems
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Efficiently tolerating failures in asynchronous real-time distributed systems
Journal of Systems Architecture: the EUROMICRO Journal
MIP formulation for robust resource allocation in dynamic real-time systems
Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
An object replication algorithm for real-time distributed databases
Distributed and Parallel Databases
Workflow-based resource allocation to optimize overall performance of composite services
Future Generation Computer Systems
Considerations on using transactions in workflow design
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Hi-index | 14.98 |
This paper presents two proactive resource allocation algorithms, called RBA* and OBA, for asynchronous real-time distributed systems. The algorithms consider an application model where timeliness requirements are expressed using Jensen's benefit functions and propose adaptation functions to describe anticipated application workload during future time intervals. Furthermore, the algorithms consider an adaptation model, where application processes are dynamically replicated for sharing workload increases and a switched real-time Ethernet network as the underlying system model. Given such models, the objective of the algorithms is to maximize aggregate application benefit and minimize aggregate missed deadline ratio. Since determining the optimal allocation is computationally intractable, the algorithms heuristically compute near-optimal resource allocations in polynomial-time. While RBA* analyzes process response times to determine resource allocation decisions, which is computationally expensive, OBA analyzes processor overloads to compute its decisions in a much faster way. RBA* incurs a quadratic amortized complexity in terms of process arrivals for its most computationally intensive component when DASA is used as the underlying scheduling algorithm, whereas OBA incurs a logarithmic amortized complexity for the corresponding component. Our benchmark-driven experimental studies reveal that RBA* produces a higher aggregate benefit and lower missed deadline ratio than OBA.