Newsgroups: comp.parallel
From: rshankar@top.cis.syr.edu (Ravi Shankar)
Subject: Paper available - Commn efficient External Redistribution
Organization: Syracuse University, CIS Dept.
Date: 28 Feb 1995 18:50:06 GMT
Message-ID: <3j03ff$e19@usenet.srv.cis.pitt.edu>

The following paper is available through anonymous ftp:

Communication-Efficient and Memory-Bounded External Redistribution
Jang Sun Lee, Sanjay Ranka, Ravi V. Shankar
February 1995

ftp site: top.cis.syr.edu
File: ~ranka/ParallelComputing/ExternalRedistribution.ps.Z

Abstract:

This paper presents communication-efficient algorithms for the external
data redistribution problem. Deterministic lower bounds and upper bounds
are presented for the number of I/O operations, communication time and the
memory requirements of external redistribution. Our algorithms differ from
most other algorithms presented for out-of-core applications in that they 
are optimal (within a small constant factor) not only in the number of I/O
operations, but also in the time taken for communication.
A coarse-grained MIMD architecture with I/O subsystems attached to each 
processor is assumed, but the results are expected to be applicable
over a wider variety of architectures.

--
Ravi Shankar
rshankar@top.cis.syr.edu

