Published in

2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)

DOI: 10.1109/ipdpsw.2010.5470763

Links

Tools

Export citation

Search in Google Scholar

Investigating the robustness of adaptive Dynamic Loop Scheduling on heterogeneous computing systems.

Proceedings article published in 2010 by Srishti Srivastava, Ioana Banicescu, Florina M. Ciorba ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Dynamic Loop Scheduling (DLS) algorithms are a powerful approach towards improving the performance of scientific applications via load balancing. The adaptive DLS (ADLS) methods have been proven to be the most appropriate for effectively balancing such applications, due to the fact that they are designed to address highly irregular, stochastic behavior caused by algorithmic and systemic variations. To guarantee certain performance levels of such DLS methods, metrics are required to measure their robustness against various unpredictable variations of factors in the computing environment. In this paper, the focus is on investigating metrics for the robustness of two Adaptive Weighted Factoring (AWF) techniques, AWFB and AWFC, as well as of the Adaptive Factoring (AF) technique. Two robustness metrics, called flexibility and resilience, are formulated for these techniques. We also discuss their computational complexity and give notes on their usefulness.