By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
H. Zhao ; Center for Intelligent, Distributed & Dependable Syst., Ohio Univ., Athens, OH, USA ; D. Gu ; L. Welch ; F. Drews
more authors

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.

Published in:

19th IEEE International Parallel and Distributed Processing Symposium

Date of Conference:

04-08 April 2005