Static heuristics for robust resource allocation of continuously executing applications

  • Authors:

  • Shoukat Ali;Jong-Kook Kim;Howard Jay Siegel;Anthony A. Maciejewski

  • Affiliations:

  • Intel Corporation, Platform Validation and Enabling, Folsom, CA 95630, USA;Department of Electronics and Computing Engineering, College of Engineering, Korea University, 5-ka Anam-dong, Sungbuk-gu, Seoul, 136-701, South Korea;Colorado State University, Department of Electrical and Computer Engineering, Fort Collins, CO 80523-1373, USA and Colorado State University, Department of Computer Science, Fort Collins, CO 80523 ...;Colorado State University, Department of Electrical and Computer Engineering, Fort Collins, CO 80523-1373, USA

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate two distinct issues related to resource allocation heuristics: robustness and failure rate. The target system consists of a number of sensors feeding a set of heterogeneous applications continuously executing on a set of heterogeneous machines connected together by high-speed heterogeneous links. There are two quality of service (QoS) constraints that must be satisfied: the maximum end-to-end latency and minimum throughput. A failure occurs if no allocation is found that allows the system to meet its QoS constraints. The system is expected to operate in an uncertain environment where the workload, i.e., the load presented by the set of sensors, is likely to change unpredictably, possibly resulting in a QoS violation. The focus of this paper is the design of a static heuristic that: (a) determines a robust resource allocation, i.e., a resource allocation that maximizes the allowable increase in workload until a run-time reallocation of resources is required to avoid a QoS violation, and (b) has a very low failure rate (i.e., the percentage of instances a heuristic fails). Two such heuristics proposed in this study are a genetic algorithm and a simulated annealing heuristic. Both were ''seeded'' by the best solution found by using a set of fast greedy heuristics.