Skip to Main Content
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.