Work

Fast Parallel Permutation Algorithms

Year: 1995

Type: article

Abstract: We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p) log n) and an improved algorithm with run time O(n/p + log n log log (n/p)). Both algorithms require n additional global bits and O(1) local storage per processor. If prefix summation is supported at the instruction level, the run time of the improved algorithm is O(n/p). The algorithms can be used to rehash the address space of a PRAM emulation.

Source: Parallel Processing Letters

DOI: 10.1142/s0129626495000126

Authors: TORBEN HAGERUP, JÖRG KELLER

Institutions: Max Planck Society, Max Planck Institute for Informatics, Saarland University

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2069270576

FWCI:

Cites:

Cited by: 2

Related to: 10