Newsgroups: comp.parallel,comp.parallel.mpi,comp.sys.super
From: dbader@Glue.umd.edu (David Bader)
Subject: ANNOUNCEMENT: Practical Parallel Algorithms for Personalized Communication and Integer Sorting
Organization: Institute for Advanced Computer Studies (UMIACS), Univ of Maryland, College Park
Date: 30 Nov 1995 10:32:51 -0500
Message-ID: <49kir3$408@mocha.eng.umd.edu>

--------------------------------------------------------------------
     Practical Parallel Algorithms for Personalized Communication
			 and Integer Sorting
--------------------------------------------------------------------

We have released our technical report entitled ``Practical Parallel
Algorithms for Personalized Communication and Integer Sorting,'' by
David A. Bader, David R. Helman, and Joseph Ja'Ja'. Technical Report
Number: CS-TR-3548 and UMIACS-TR-95-101. Institute for Advanced
Computer Studies (UMIACS), and the Department of Electrical
Engineering, University of Maryland, College Park, November 1995.

The paper is available in HTML and PostScript format via WWW:

http://www.umiacs.umd.edu/~dbader
http://www.umiacs.umd.edu/~dbader/3548.ps

or via anonymous ftp to either of these locations:

ftp://ftp.cs.umd.edu/pub/papers/papers/3548/3548.ps.Z
ftp://ftp.umiacs.umd.edu/pub/dbader/papers/3548.ps.Z

If you prefer a hardcopy, please reply to this message and send me
your mailing address.

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. As
an application, we present an efficient algorithm for stable integer
sorting.

	The algorithms presented in this paper have been coded in
Split-C and run on a variety of platforms, including the Thinking
Machines CM-5, IBM SP-1 and SP-2, Cray Research T3D, Meiko Scientific
CS-2, and the Intel Paragon. Our experimental results are consistent
with the theoretical analysis and illustrate the scalability and
efficiency of our algorithms across different platforms. In fact, they
seem to outperform all similar algorithms known to the authors on
these platforms.

---
David A. Bader 
Electrical Engineering Department
A.V. Williams Building
University of Maryland
College Park, MD 20742
Office: 301-405-6755   
FAX:    301-314-9658

Internet: dbader@eng.umd.edu
WWW:      http://www.umiacs.umd.edu/~dbader



