Massively parallel mathematical sieves

Journal Article · Sun Jan 01 00:00:00 EST 1989 · Int. J. Supercomput. Appl.; (United States)

DOI:https://doi.org/10.1177/109434208900300105· OSTI ID:6089812

Montry, G R

The Sieve of Eratosthenes is a well-known algorithm for finding all prime numbers in a given subset of integers. A parallel version of the Sieve is described that produces computational speedups over 800 on a hypercube with 1,024 processing elements for problems of fixed size. Computational speedups as high as 980 are achieved when the problem size per processor is fixed. The method of parallelization generalizes to other sieves and will be efficient on any ensemble architecture. We investigate two highly parallel sieves using scattered decomposition and compare their performance on a hypercube multiprocessor. A comparison of different parallelization techniques for the sieve illustrates the trade-offs necessary in the design and implementation of massively parallel algorithms for large ensemble computers.

• Research Organization: Sandia National Labs., Albuquerque, NM (US)
• OSTI ID: 6089812
• Journal Information: Int. J. Supercomput. Appl.; (United States), Vol. 3:1
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ARRAY PROCESSORS
SIZE
PARALLEL PROCESSING
ALGORITHMS
DESIGN
HYPERCUBE COMPUTERS
PERFORMANCE TESTING
COMPUTERS
MATHEMATICAL LOGIC
PROGRAMMING
TESTING
990210* - Supercomputers- (1987-1989)