Abstract
The Sieve of Eratosthenes, an algorithm for calculating prime numbers, has been used for years as a benchmark for evaluating the processing power of single CPUs. A recent modification to the sieve algorithm provides a concurrent solution method for calculating prime numbers. This paper describes an Ada program which uses a multitasking solution for the Sieve of Eratosthenes. The program illustrates the use of Ada tasking to obtain concurrency in the solution of compute-intensive numerical algorithms and may also serve as a benchmark program for evaluating multiple CPU systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
