Robust resource allocation for sensor-actuator distributed computing systems

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

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 heterogeneous applications continuously executing on a set of heterogeneous machines connected together by high-speed heterogeneous links. There are a number of quality of service (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 sensors, is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial workload estimate. 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. 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 desirable for systems where low failure rates can be a critical requirement and where unpredictable circumstances can lead to unknown increases in the system workload.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsR. Eigenmann
Pages178-185
Number of pages8
Publication statusPublished - 2004
Externally publishedYes
EventProceedings - 2004 International Conference on Parallel Processing, ICPP 2004 - Montreal, Que, Canada
Duration: 2004 Aug 152004 Aug 18

Other

OtherProceedings - 2004 International Conference on Parallel Processing, ICPP 2004
CountryCanada
CityMontreal, Que
Period04/8/1504/8/18

Fingerprint

Distributed computer systems
Resource allocation
Actuators
Quality of service
Sensors

ASJC Scopus subject areas

  • Hardware and Architecture
  • Engineering(all)

Cite this

Ali, S., Maciejewski, A. A., Siegel, H. J., & Kim, J-K. (2004). Robust resource allocation for sensor-actuator distributed computing systems. In R. Eigenmann (Ed.), Proceedings of the International Conference on Parallel Processing (pp. 178-185)

Robust resource allocation for sensor-actuator distributed computing systems. / Ali, Shoukat; Maciejewski, Anthony A.; Siegel, Howard Jay; Kim, Jong-Kook.

Proceedings of the International Conference on Parallel Processing. ed. / R. Eigenmann. 2004. p. 178-185.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ali, S, Maciejewski, AA, Siegel, HJ & Kim, J-K 2004, Robust resource allocation for sensor-actuator distributed computing systems. in R Eigenmann (ed.), Proceedings of the International Conference on Parallel Processing. pp. 178-185, Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004, Montreal, Que, Canada, 04/8/15.
Ali S, Maciejewski AA, Siegel HJ, Kim J-K. Robust resource allocation for sensor-actuator distributed computing systems. In Eigenmann R, editor, Proceedings of the International Conference on Parallel Processing. 2004. p. 178-185
Ali, Shoukat ; Maciejewski, Anthony A. ; Siegel, Howard Jay ; Kim, Jong-Kook. / Robust resource allocation for sensor-actuator distributed computing systems. Proceedings of the International Conference on Parallel Processing. editor / R. Eigenmann. 2004. pp. 178-185
@inproceedings{0a3682a9030e4378a77c4794bfe935f9,
title = "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 heterogeneous applications continuously executing on a set of heterogeneous machines connected together by high-speed heterogeneous links. There are a number of quality of service (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 sensors, is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial workload estimate. 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. 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 desirable for systems where low failure rates can be a critical requirement and where unpredictable circumstances can lead to unknown increases in the system workload.",
author = "Shoukat Ali and Maciejewski, {Anthony A.} and Siegel, {Howard Jay} and Jong-Kook Kim",
year = "2004",
language = "English",
pages = "178--185",
editor = "R. Eigenmann",
booktitle = "Proceedings of the International Conference on Parallel Processing",

}

TY - GEN

T1 - Robust resource allocation for sensor-actuator distributed computing systems

AU - Ali, Shoukat

AU - Maciejewski, Anthony A.

AU - Siegel, Howard Jay

AU - Kim, Jong-Kook

PY - 2004

Y1 - 2004

N2 - 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 heterogeneous applications continuously executing on a set of heterogeneous machines connected together by high-speed heterogeneous links. There are a number of quality of service (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 sensors, is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial workload estimate. 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. 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 desirable for systems where low failure rates can be a critical requirement and where unpredictable circumstances can lead to unknown increases in the system workload.

AB - 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 heterogeneous applications continuously executing on a set of heterogeneous machines connected together by high-speed heterogeneous links. There are a number of quality of service (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 sensors, is likely to change unpredictably, possibly invalidating a resource allocation that was based on the initial workload estimate. 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. 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 desirable for systems where low failure rates can be a critical requirement and where unpredictable circumstances can lead to unknown increases in the system workload.

UR - http://www.scopus.com/inward/record.url?scp=10044254452&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10044254452&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:10044254452

SP - 178

EP - 185

BT - Proceedings of the International Conference on Parallel Processing

A2 - Eigenmann, R.

ER -