Robust resource allocation for sensor-actuator distributed computing systems

Abstract

This research investigates two distinct issues related to a resource allocation: its robustness and the failure rate of the heuristic used to determine the allocation. The target system consists of a number of sensors feeding a set of het-erogeneous applications continuously executing on a set of heterogeneous machines connected together by high-speed heterogeneous links. There are a number of quality of ser-vice (QoS) constraints that must be satisfied. A heuristic failure occurs if the heuristic cannot find an allocation 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 sen-sors, is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial work-load estimate. The focus of this paper is the design of a static heuristic that: (a) determines a robust resource allo-cation, i.e., a resource allocation that maximizes the allow-able 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. This study proposes a heuristic that performs well with respect to the failure rates and robustness to unpredictable workload increases. This heuristic is, therefore, very desir-able for systems where low failure rates can be a critical re-quirement and where unpredictable circumstances can lead to unknown increases in the system workload.