Practical Parallel Algorithms for Personalized Communication and Integer Sorting (1995)
Cached
Download Links
- [hpc.eece.unm.edu]
- [www.cs.umd.edu]
- [www.cc.gatech.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS |
| Citations: | 21 - 5 self |
BibTeX
@ARTICLE{Bader95practicalparallel,
author = {David Bader and David R. Helman and Joseph JáJá},
title = {Practical Parallel Algorithms for Personalized Communication and Integer Sorting},
journal = {ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS},
year = {1995},
volume = {1},
pages = {199--6}
}
Years of Citing Articles
OpenURL
Abstract
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, algorithms which efficiently execute on general-purpose parallel machines. With the emergence of message passing standards such as MPI, it has become easier to design efficient and portable parallel algorithms by making use of these communication primitives. While existing primitives allow an assortment of collective communication routines, they do not handle an important communication event when most or all processors have non-uniformly sized personalized messages to exchange with each other. We focus in this paper on the h-relation personalized communication whose efficient implementation will allow high performance implementations of a large class of algorithms. While most previous h-relation algorithms use randomization, this paper presents a new deterministic approach for h-relation personalized communication with asymptoticaly optimal complexity for h p². As an application, we ...







