Adaptive communication algorithms for distributed heterogeneous systems

Bhat, Prashanth B.; Prasanna, Viktor K.; Raghavendra, C.S.

doi:10.1109/hpdc.1998.710017

Cited by 30 publications

(24 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Yet another model of communication is introduced in [10,9]: the time needed to transfer the message between any processor pair (P i , P j ) is supposed to be divided into a start-up cost T i,j and a part depending on the size m of the message and the transmission rate B i,j between the two processors,…”

Section: Related Workmentioning

confidence: 99%

Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms

Legrand

Marchal

Robert

2005

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous large-scale distributed platform. Such applications intensively use collective macro-communication schemes, such as scatters, personalized all-to-alls or gather/reduce operations. Rather than aiming at minimizing the execution time of a single macro-communication, we focus on the steady-state operation. We assume that there is a large number of macro-communications to perform in pipeline fashion, and we aim at maximizing the throughput, i.e., the (rational) number of macro-communications which can be initiated every time-step. We target heterogeneous platforms, modeled by a graph where resources have different communication and computation speeds. The situation is simpler for series of scatters or personalized all-to-alls than for series of reduces operations, because of the possibility of combining various partial reductions of the local values, and of interleaving computations with communications. In all cases, we show how to determine the optimal throughput, and how to exhibit a concrete periodic schedule that achieves this throughput.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms

Legrand

Marchal

Robert

2005

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…(Our worksharing protocols employ only point-to-point communications.) Collective communication models where clusters may contain other clusters, and networks may be hierarchical-can be found in [9,10,11,24].…”

Section: The Hnow-rental Problem One Seeks To Complete W Units Of Womentioning

confidence: 99%

Optimal sharing of bags of tasks in heterogeneous clusters

Adler

Gong

Rosenberg

2003

Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA '03

View full text Add to dashboard Cite

We prove that "FIFO" worksharing protocols provide asymptotically optimal solutions to a problem related to sharing a bag of identically complex tasks in a heterogeneous network of workstations (HNOW) N . In the HNOW-Exploitation Problem, one seeks to accomplish as much work as possible on N during a prespecified fixed period of L time units. The worksharing protocols we study are crafted within an architectural model that characterizes N via parameters that measure workstations' computational and communicational powers. The protocols are self-scheduling, in that they determine completely both an amount of work to allocate to each of N 's workstations and a schedule for all related interworkstation communications. A protocol observes a FIFO regimen if it has N 's workstations finish their assigned work, and return their results, in the same order in which they are supplied with their workloads. The optimality of FIFO protocols resides in the fact that they accomplish at least as much work as any other protocol during all sufficiently long worksharing episodes. Simulation experiments indicate that the superiority of FIFO protocols is often observed during worksharing episodes of only a few minutes' duration.

show abstract

“…Communication systems adapt based on the underlying physical communication fabric which is dynamic (for instance [9][10][11]). In the same way, a system can also adapt to the underlying variation-affected hardware layer.…”

Section: Introductionmentioning

confidence: 99%

Software adaptation in quality sensitive applications to deal with hardware variability

Pant

Gupta

Schaar

2010

Proceedings of the 20th Symposium on Great Lakes Symposium on VLSI

View full text Add to dashboard Cite

In this work, we propose a method to reduce the impact of process variations by adapting the application's algorithm at the software layer. We introduce the concept of hardware signatures as the measured post manufacturing hardware characteristics that can be used to drive software adaptation across different die. Using H.264 encoding as an example, we demonstrate significant yield improvements (as much as 40% points at 0% over-design), a reduction in overdesign (by as much as 10% points at 80% yield) as well as application quality improvements (about 2.6dB increase in average PSNR at 80% yield). Further, we investigate implications of limited information exchange (i.e. signature measurement granularity) on yield and quality. We show that our proposed technique for determining optimal signature measurement points results in an improvement in PSNR of about 1.3dB over naive sampling for the H.264 encoder. We conclude that hardware-signature based application adaptation is an easy and inexpensive (to implement), better informed (by actual application requirements) and effective way to manage yield-cost-quality tradeoffs in applicationimplementation design flows.

show abstract

Adaptive communication algorithms for distributed heterogeneous systems

Abstract: Abstract

Cited by 30 publications

References 20 publications

Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms

Optimizing the steady-state throughput of scatter and reduce operations on heterogeneous platforms

Optimal sharing of bags of tasks in heterogeneous clusters

Software adaptation in quality sensitive applications to deal with hardware variability

Contact Info

Product

Resources

About