Stable Allocations in Distributed Real-Time Systems with Multiple Environmental Parameters and Replicable Applications

Authors:
Hang Zhao;Dazhang Gu;Lonnie Welch;Frank Drews;David Juedes
Affiliations:
Ohio University, Athens;Ohio University, Athens;Ohio University, Athens;Ohio University, Athens;Ohio University, Athens
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Year:
2005

Citing 5
Cited 0

Utilization Bounds for N-Processor Rate MonotoneScheduling with Static Processor Assignment

Real-Time Systems
Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations

IEEE Transactions on Software Engineering
Greedy Heuristics for Resource Allocation in Dynamic Distributed Real-Time Heterogeneous Computing Systems

PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 2
MIP Formulation for Robust Resource Allocation in Dynamic Real-Time Systems

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Strategies for CORBA Middleware-Based Load Balancing

IEEE Distributed Systems Online

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends the previous work on the maximal allowable workload (MAW) problem by investigating a resource allocation problem for distributed real-time systems that contain replicable applications. The systems may use multiple resources of a single type and be affected by multiple environmental factors. The approach searches for a feasible allocation that maximizes a user defined metric of stability. Several algorithms were developed and experiments were conducted to demonstrate the relative strength of these algorithms. The results showed that Simulated Annealing provides results that are the closest to the optimal for maximizing environmental parameter settings. In addition modified greedy first fit is shown to be the best performing algorithm for finding feasible allocations.