Autonomic runtime manager for adaptive distributed applications

Jingmei Yang, Huoping Chen, Salim A Hariri, Manish Parashar

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

3 Citations (Scopus)

Abstract

For adaptive distributed applications, the computational complexity associated with each computational region varies continuously and dramatically both in space and time throughout the life cycle of the application execution. Consequently, static scheduling techniques are inefficient for such applications. In this paper, we present an Autonomic Runtime Manager (ARM) that uses the application spatial and temporal characteristics as well as resource status as the main criteria to self-optimize the execution of distributed applications at runtime. We applied the ARM system to a wildfire simulation and our experimental results show that the performance of the wildfire simulation has been improved by 45% when compared with a static partitioning algorithm. We also evaluate the performance of ARM using two partitioning strategies: Natural Regions (NR) approach and a graph partitioning approach.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Symposium on High Performance Distributed Computing
Pages69-78
Number of pages10
StatePublished - 2005
Event14th IEEE International Symposium on High Performance Distributed Computing, HPDC-14 - Research Triangle Park, NC, United States
Duration: Jul 24 2005Jul 27 2005

Other

Other14th IEEE International Symposium on High Performance Distributed Computing, HPDC-14
CountryUnited States
CityResearch Triangle Park, NC
Period7/24/057/27/05

Fingerprint

Managers
Life cycle
Computational complexity
Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yang, J., Chen, H., Hariri, S. A., & Parashar, M. (2005). Autonomic runtime manager for adaptive distributed applications. In Proceedings of the IEEE International Symposium on High Performance Distributed Computing (pp. 69-78)

Autonomic runtime manager for adaptive distributed applications. / Yang, Jingmei; Chen, Huoping; Hariri, Salim A; Parashar, Manish.

Proceedings of the IEEE International Symposium on High Performance Distributed Computing. 2005. p. 69-78.

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

Yang, J, Chen, H, Hariri, SA & Parashar, M 2005, Autonomic runtime manager for adaptive distributed applications. in Proceedings of the IEEE International Symposium on High Performance Distributed Computing. pp. 69-78, 14th IEEE International Symposium on High Performance Distributed Computing, HPDC-14, Research Triangle Park, NC, United States, 7/24/05.
Yang J, Chen H, Hariri SA, Parashar M. Autonomic runtime manager for adaptive distributed applications. In Proceedings of the IEEE International Symposium on High Performance Distributed Computing. 2005. p. 69-78
Yang, Jingmei ; Chen, Huoping ; Hariri, Salim A ; Parashar, Manish. / Autonomic runtime manager for adaptive distributed applications. Proceedings of the IEEE International Symposium on High Performance Distributed Computing. 2005. pp. 69-78
@inproceedings{a57f9eef4cd345a9aff78db7489f82bd,
title = "Autonomic runtime manager for adaptive distributed applications",
abstract = "For adaptive distributed applications, the computational complexity associated with each computational region varies continuously and dramatically both in space and time throughout the life cycle of the application execution. Consequently, static scheduling techniques are inefficient for such applications. In this paper, we present an Autonomic Runtime Manager (ARM) that uses the application spatial and temporal characteristics as well as resource status as the main criteria to self-optimize the execution of distributed applications at runtime. We applied the ARM system to a wildfire simulation and our experimental results show that the performance of the wildfire simulation has been improved by 45{\%} when compared with a static partitioning algorithm. We also evaluate the performance of ARM using two partitioning strategies: Natural Regions (NR) approach and a graph partitioning approach.",
author = "Jingmei Yang and Huoping Chen and Hariri, {Salim A} and Manish Parashar",
year = "2005",
language = "English (US)",
pages = "69--78",
booktitle = "Proceedings of the IEEE International Symposium on High Performance Distributed Computing",

}

TY - GEN

T1 - Autonomic runtime manager for adaptive distributed applications

AU - Yang, Jingmei

AU - Chen, Huoping

AU - Hariri, Salim A

AU - Parashar, Manish

PY - 2005

Y1 - 2005

N2 - For adaptive distributed applications, the computational complexity associated with each computational region varies continuously and dramatically both in space and time throughout the life cycle of the application execution. Consequently, static scheduling techniques are inefficient for such applications. In this paper, we present an Autonomic Runtime Manager (ARM) that uses the application spatial and temporal characteristics as well as resource status as the main criteria to self-optimize the execution of distributed applications at runtime. We applied the ARM system to a wildfire simulation and our experimental results show that the performance of the wildfire simulation has been improved by 45% when compared with a static partitioning algorithm. We also evaluate the performance of ARM using two partitioning strategies: Natural Regions (NR) approach and a graph partitioning approach.

AB - For adaptive distributed applications, the computational complexity associated with each computational region varies continuously and dramatically both in space and time throughout the life cycle of the application execution. Consequently, static scheduling techniques are inefficient for such applications. In this paper, we present an Autonomic Runtime Manager (ARM) that uses the application spatial and temporal characteristics as well as resource status as the main criteria to self-optimize the execution of distributed applications at runtime. We applied the ARM system to a wildfire simulation and our experimental results show that the performance of the wildfire simulation has been improved by 45% when compared with a static partitioning algorithm. We also evaluate the performance of ARM using two partitioning strategies: Natural Regions (NR) approach and a graph partitioning approach.

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

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

M3 - Conference contribution

AN - SCOPUS:27544432557

SP - 69

EP - 78

BT - Proceedings of the IEEE International Symposium on High Performance Distributed Computing

ER -