Hybrid Parallel Bidirectional Sieve based on SMP Cluster
Gang Liao, Lian Luo, Lei Liu

TL;DR
This paper introduces a hybrid parallel bidirectional sieve method on SMP clusters that leverages multicore shared-memory systems and dual-core processing to efficiently generate prime numbers with significant speedup.
Contribution
It proposes a novel hybrid parallel sieve approach using deque data structures and dual-core processing on SMP clusters for improved prime number generation efficiency.
Findings
Achieved significant speedup and efficiency improvements.
Utilized deque structures for dual-direction sieving.
Implemented dynamic FIFO queues for inter-node data transfer.
Abstract
In this article, hybrid parallel bidirectional sieve method is implemented by SMP Cluster, the individual computational units joined together by the communication network, are usually shared-memory systems with one or more multicore processor. To high-efficiency optimization, we propose average divide data into nodes, generating double-ended queues (deque) for sieve method that are able to exploit dual-cores simultaneously start sifting out primes from the head and tail.And each node create a FIFO queue as dynamic data buffer to ache temporary data from another nodes send to. The approach obtains huge speedup and efficiency on SMP Cluster.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Algorithms and Data Compression · Advanced Data Storage Technologies
