Document Type
Working Paper
Date
1995
Keywords
parallelism, parallel remapping algorithms
Language
English
Disciplines
Computer Sciences
Description/Abstract
In this paper 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 algorithm, can be reduced to sorting a nearly sorted list of integers or merging an unsorted 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. Experimental results are presented on the CM-5.
Recommended Citation
Ou, Chao Wei and Ranka, Sanjay, "Parallel Remapping Algorithms for Adaptive Problems" (1995). Northeast Parallel Architecture Center. 21.
https://surface.syr.edu/npac/21
