Minimizing data and synchronization costs in one-way communication

Kandemir, Mahmut; Shenoy, Niraj; Banerjee, P.; Ramanujam, J.; Choudhary, Alok

doi:10.1109/icpp.1998.708483

Cited by 3 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Barrier synchronization is a fundamental collective communication operation that is frequently used in parallel systems [2], [3]. It has been extensively studied in the literature and many schemes have been proposed for fast barrier synchronization through software, hardware, or their combination [4], [5], [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

Barrier synchronization on wormhole-routed networks

Sun¹,

Cheung

2001

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

AbstractÐIn this paper, we propose an efficient barrier synchronization scheme on networks with arbitrary topologies. We first present a distributed method in building a barrier routing tree. The barrier messages can be delivered adaptively according to the hierarchy of the established barrier tree to void congestion and faulty nodes in the network. We then propose a new technique, called bandwidth-preempting technique, for a blocked barrier message to preempt a channel occupied by a data message so that the latency of a barrier message can be controlled without affecting much of the overall system performance. We also propose an analytical performance model and present simulation results for the performance evaluation of the proposed scheme. Performance evaluations show that the proposed scheme outperforms the existing algorithms for barrier synchronization.

show abstract

Section: Introductionmentioning

confidence: 99%

Barrier synchronization on wormhole-routed networks

Sun¹,

Cheung

2001

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Overlapping communication and computation has long been recognized as an important technique for hiding communication latencies [8,12,20,25]. Consequently, there have been ongoing efforts in promoting nonblocking communication as a standard feature in the PGAS language community.…”

Section: Related Workmentioning

confidence: 99%

Automatic nonblocking communication for partitioned global address space programs

Chen

Bonachea

Iancu

et al. 2007

Proceedings of the 21st Annual International Conference on Supercomputing

View full text Add to dashboard Cite

Overlapping communication with computation is an important optimization on current cluster architectures; its importance is likely to increase as the doubling of processing power far outpaces any improvements in communication latency. PGAS languages offer unique opportunities for communication overlap, because their one-sided communication model enables low overhead data transfer. Recent results have shown the value of hiding latency by manually applying language-level nonblocking data transfer routines, but this process can be both tedious and error-prone. In this paper, we present a runtime framework that automatically schedules the data transfers to achieve overlap. The optimization framework is entirely transparent to the user, and aggressively reorders and aggregates both remote puts and gets. We preserve correctness via runtime conflict checks and temporary buffers, using several techniques to lower the overhead. Experimental results on application benchmarks suggest that our framework can be very effective at hiding communication latency on clusters, improving performance over the blocking code by an average of 16% for some of the NAS Parallel Benchmarks, 48% for GUPS, and over 25% for a multi-block fluid dynamics solver. While the system is not yet as effective as aggressive manual optimization, it increases programmers' productivity by freeing them from the details of communication management.

show abstract