Parallel remapping algorithms for adaptive problems

Authors:
Chao-Wei Ou;S. Ranka
Affiliations:
-;-
Venue:
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Year:
1995

Citing 0
Cited 6

Architecture-independent locality-improving transformations of computational graphs embedded in k-dimensions

ICS '95 Proceedings of the 9th international conference on Supercomputing
Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves

IEEE Transactions on Parallel and Distributed Systems
Efficient Parallel Algorithms for Solvent Accessible Surface Area of Proteins

IEEE Transactions on Parallel and Distributed Systems
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Dynamic Alignment and Distribution of Irregularly Coupled Data Arrays for Scalable Parallelization of Particle-in-Cell Problems

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Maintaining Spatial Data Sets in Distributed-Memory Machines

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present fast parallel algorithms for remapping a class of irregular and adaptive problems on coarse-grained distributed-memory machines. We show that the remapping of these applications, using simple index-based mapping algorithms, can be reduced to sorting a nearly sorted list of integers or merging an assorted list of integers with a sorted list of integers. By using the algorithms we have developed, the remapping of these problems can be achieved at a fraction of the cost of mapping from scratch. Results of experiments performed on the CM-5 are presented.