By Topic

A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Paillard, G. ; Inst. Galilee, Univ. Paris XIII, Villetaneuse ; Lavault, C. ; Franca, F.

In this article, we propose a fully distributed algorithm for finding all primes in a given interval [2..n] (or (L, R), more generally), based on the SMER - scheduling by multiple edge reversal - multigraph dynamics. Given a multigraph M of arbitrary topology, having N nodes, an SMER-driven system is defined by the number of directed edges (arcs) between any two nodes of M and by the global period length of all "arc reversals" in M. In the domain of prime numbers generation, such a graph method shows quite elegant, and it also yields a totally new kind of distributed prime sieving algorithms of an entirely original design. The maximum number of steps required by the algorithm is at most n + radicn. Although far beyond the O(n/log log n) steps required by the improved sequential "wheel sieve" algorithms, our SMER-based algorithm is fully distributed and of linear (step) complexity. The message complexity of the algorithm is at most nDeltaN + radicnDeltaN, where DeltaN denotes the maximum "multidegree" of the arbitrary multigraph M, and the space required per process is linear

Published in:

Parallel and Distributed Computing, 2005. ISPDC 2005. The 4th International Symposium on

Date of Conference:

4-6 July 2005