Choir: A Real-Time Middleware Architecture Supporting Benefit-Based Proactive Resource Allocation

Authors:
Peng Li;Binoy Ravindran;Jinggang Wang;Glenn Konowicz
Affiliations:
-;-;-;-
Venue:
ISORC '03 Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Year:
2003

Citing 0
Cited 4

Proactive resource allocation for asynchronous real-time distributed systems in the presence of processor failures

Journal of Parallel and Distributed Computing
Fast, Best-Effort Real-Time Scheduling Algorithms

IEEE Transactions on Computers
A Utility Accrual Scheduling Algorithm for Real-Time Activities with Mutual Exclusion Resource Constraints

IEEE Transactions on Computers
CFlood: A Constrained Flooding Protocol for Real-time Data Delivery in Wireless Sensor Networks

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Asynchronous real-time distributed systems are inherently non-deterministic. To deal with suchnon-determinism's, we have developed a family of proactive resource management algorithms that support benefit-function based, end-to-end QoS management. This paper describes a middleware implementation of these algorithms, called Choir. The Choir middleware allows the user express the task end-to-end timeliness requirements using Jensen's benefit functions. Furthermore, the middleware system can transparently replicate, and possibly migrate the computational subtasks to conquer uncertainties such as workload fluctuations, changes of system resources, so that the system aggregate benefit is maximized. Initial experimental results suggest the effectiveness the Choir middleware.