Parallel Sieve algorithms on a hypercube multiprocessor

Authors:
R. L. Wainwright
Affiliations:
Computer Science Department, The University of Tulsa, Tulsa, Oklahoma
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 2
Cited 0

Multiprocessing the Sieve of Eratosthenes

Computer
Deriving parallel computations from functional specifications: a seismic example on a hypercube

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two sieve algorithms, a pipeline and a parallel version are presented for a distributed-memory multiprocessor. Traditionally, the sieve algorithm is solved using a pipeline approach. This algorithm has a high communication to computation ratio and as a result performs poorly. The parallel algorithm is a substantial improvement over the traditional pipeline algorithm. It has a low communication to computation ratio. The speedup for this algorithm is nearly linear. Further, unlike the pipeline algorithm, the parallel algorithm performs just as well or even better on a shared memory multiprocessor system.