Latency hiding by redundant processing: a technique for grid-enabled, iterative, synchronous parallel programs

Authors:
Jeremy F. Villalobos;Barry Wilkinson
Affiliations:
University of North Carolina at Charlotte, Charlotte, NC;University of North Carolina at Charlotte, Charlotte, NC
Venue:
Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities
Year:
2008

Citing 7
Cited 0

CHARM++: a portable concurrent object oriented system based on C++

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Parallel programming: techniques and applications using networked workstations and parallel computers

Parallel programming: techniques and applications using networked workstations and parallel computers
Cactus Tools for Grid Applications

Cluster Computing
Exploting communication Latency Hiding for Parallel Network

Proceedings of the 1994 International Conference on Parallel and Distributed Systems
MPICH-G2: a Grid-enabled implementation of the Message Passing Interface

Journal of Parallel and Distributed Computing - Special issue on computational grids
Using Message-Driven Objects to Mask Latency in Grid Computing Applications

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
The GrADS Project: Software Support for High-Level Grid Application Development

International Journal of High Performance Computing Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The increase in interconnected computational resources brought about by the Grid creates the possibility to port multiple parallel programming techniques to it. Porting parallel applications to the Grid could reduce the total computation time, or it could be used to create solutions with higher degrees of resolution. However, the Grid brings with it network state conditions that all too often work to the detriment of expediency in parallel applications. This paper proposes an algorithm designed to significantly reduce the amount of Wide Area Network (WAN) latency experienced when running an interactive synchronous parallel program on the Grid. The algorithm is called Latency Hiding by Redundant Processing (LHRP) and in tests done on two Grid nodes with emulated latency, it complemented Latency Hiding (LH) by performing better than LH on jobs with low internal computation time and performing worst than LH when the computation time was enough to hide the latency.