Multiprocessing the Sieve of Eratosthenes
More than two thousand years ago, Eratosthenes of Cyrene described a procedure for finding all prime numbers in a given range. This straightforward algorithm, known as the Sieve of Eratosthenes, is to this day the only procedure for finding prime numbers. In recent years it has been of interest to c...
Gespeichert in:
| Veröffentlicht in: | Computer (Long Beach, Calif.) Calif.), 1987-04, Vol.20 (4), p.50-58 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 58 |
|---|---|
| container_issue | 4 |
| container_start_page | 50 |
| container_title | Computer (Long Beach, Calif.) |
| container_volume | 20 |
| creator | Bokhari, S H |
| description | More than two thousand years ago, Eratosthenes of Cyrene described a procedure for finding all prime numbers in a given range. This straightforward algorithm, known as the Sieve of Eratosthenes, is to this day the only procedure for finding prime numbers. In recent years it has been of interest to computer scientists and engineers because it serves as a convenient benchmark against which to measure some aspects of a computer's performance. Specifically, the Sieve tests the power of a machine (or of a compiler) to access a very large array in memory rapidly and repeatedly. This power is clearly influenced by memory access time, the speed at which indexing is done, and the overhead of looping. The parallel version of the Sieve is very useful as a test of some of the capabilities of a parallel machine. The parallel algorithm is straightforward, and so is the process for checking the final results. However, the efficient implementation of the algorithm on a real parallel machine, especially in the dynamic load-balancing case, requires thoughtful design. |
| doi_str_mv | 10.1109/MC.1987.1663535 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28791076</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1663535</ieee_id><sourcerecordid>28791076</sourcerecordid><originalsourceid>FETCH-LOGICAL-c358t-39fbc920544e894e6014ee859a7efb0b6bda26961ae7e3f94d721ea9bcdc824c3</originalsourceid><addsrcrecordid>eNpFkM1Lw0AQxRdRsFbPHrwED4KHtLvZ76OE-gEtHtTzstlM7Eqa1OxW8L93SwKehpn5vXnDQ-ia4AUhWC835YJoJRdECMopP0EzwrnKsSLsFM0wJirXRBTn6CKEr9QyxekM3W8ObfT7oXcQgu8-s7iF7M3DD2R9k60GG_uQRh2ES3TW2DbA1VTn6ONx9V4-5-vXp5fyYZ07ylXMqW4qpwvMGQOlGYjkBKC4thKaCleiqm0htCAWJNBGs1oWBKyuXO1UwRydo9vxbjL2JjgfwW1d33XgohGcSsVYgu5GKH3-fYAQzc4HB21rO-gPwRRKaoKlSOByBN3QhzBAY_aD39nh1xBsjrmZTWmOuZkpt6S4GRUeAP7pafsHDNRoDg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28791076</pqid></control><display><type>article</type><title>Multiprocessing the Sieve of Eratosthenes</title><source>IEEE Electronic Library (IEL)</source><creator>Bokhari, S H</creator><creatorcontrib>Bokhari, S H ; Univ. of Engineering and Technology, Lahore</creatorcontrib><description>More than two thousand years ago, Eratosthenes of Cyrene described a procedure for finding all prime numbers in a given range. This straightforward algorithm, known as the Sieve of Eratosthenes, is to this day the only procedure for finding prime numbers. In recent years it has been of interest to computer scientists and engineers because it serves as a convenient benchmark against which to measure some aspects of a computer's performance. Specifically, the Sieve tests the power of a machine (or of a compiler) to access a very large array in memory rapidly and repeatedly. This power is clearly influenced by memory access time, the speed at which indexing is done, and the overhead of looping. The parallel version of the Sieve is very useful as a test of some of the capabilities of a parallel machine. The parallel algorithm is straightforward, and so is the process for checking the final results. However, the efficient implementation of the algorithm on a real parallel machine, especially in the dynamic load-balancing case, requires thoughtful design.</description><identifier>ISSN: 0018-9162</identifier><identifier>EISSN: 1558-0814</identifier><identifier>DOI: 10.1109/MC.1987.1663535</identifier><identifier>CODEN: CPTRB4</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>990210 - Supercomputers- (1987-1989) ; 990230 - Mathematics & Mathematical Models- (1987-1989) ; Algorithm design and analysis ; ALGORITHMS ; ARRAY PROCESSORS ; Benchmark testing ; BENCHMARKS ; Computational modeling ; COMPUTER CODES ; Computer simulation ; Concurrent computing ; EXECUTIVE CODES ; GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE ; Indexing ; Load management ; Magnetic heads ; MATHEMATICAL LOGIC ; MEMORY DEVICES ; Parallel machines ; PARALLEL PROCESSING ; Performance evaluation ; PROGRAMMING ; SIGNALS ; TIME DEPENDENCE</subject><ispartof>Computer (Long Beach, Calif.), 1987-04, Vol.20 (4), p.50-58</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c358t-39fbc920544e894e6014ee859a7efb0b6bda26961ae7e3f94d721ea9bcdc824c3</citedby><cites>FETCH-LOGICAL-c358t-39fbc920544e894e6014ee859a7efb0b6bda26961ae7e3f94d721ea9bcdc824c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1663535$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,881,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1663535$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.osti.gov/biblio/6537844$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>Bokhari, S H</creatorcontrib><creatorcontrib>Univ. of Engineering and Technology, Lahore</creatorcontrib><title>Multiprocessing the Sieve of Eratosthenes</title><title>Computer (Long Beach, Calif.)</title><addtitle>MC</addtitle><description>More than two thousand years ago, Eratosthenes of Cyrene described a procedure for finding all prime numbers in a given range. This straightforward algorithm, known as the Sieve of Eratosthenes, is to this day the only procedure for finding prime numbers. In recent years it has been of interest to computer scientists and engineers because it serves as a convenient benchmark against which to measure some aspects of a computer's performance. Specifically, the Sieve tests the power of a machine (or of a compiler) to access a very large array in memory rapidly and repeatedly. This power is clearly influenced by memory access time, the speed at which indexing is done, and the overhead of looping. The parallel version of the Sieve is very useful as a test of some of the capabilities of a parallel machine. The parallel algorithm is straightforward, and so is the process for checking the final results. However, the efficient implementation of the algorithm on a real parallel machine, especially in the dynamic load-balancing case, requires thoughtful design.</description><subject>990210 - Supercomputers- (1987-1989)</subject><subject>990230 - Mathematics & Mathematical Models- (1987-1989)</subject><subject>Algorithm design and analysis</subject><subject>ALGORITHMS</subject><subject>ARRAY PROCESSORS</subject><subject>Benchmark testing</subject><subject>BENCHMARKS</subject><subject>Computational modeling</subject><subject>COMPUTER CODES</subject><subject>Computer simulation</subject><subject>Concurrent computing</subject><subject>EXECUTIVE CODES</subject><subject>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</subject><subject>Indexing</subject><subject>Load management</subject><subject>Magnetic heads</subject><subject>MATHEMATICAL LOGIC</subject><subject>MEMORY DEVICES</subject><subject>Parallel machines</subject><subject>PARALLEL PROCESSING</subject><subject>Performance evaluation</subject><subject>PROGRAMMING</subject><subject>SIGNALS</subject><subject>TIME DEPENDENCE</subject><issn>0018-9162</issn><issn>1558-0814</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1987</creationdate><recordtype>article</recordtype><recordid>eNpFkM1Lw0AQxRdRsFbPHrwED4KHtLvZ76OE-gEtHtTzstlM7Eqa1OxW8L93SwKehpn5vXnDQ-ia4AUhWC835YJoJRdECMopP0EzwrnKsSLsFM0wJirXRBTn6CKEr9QyxekM3W8ObfT7oXcQgu8-s7iF7M3DD2R9k60GG_uQRh2ES3TW2DbA1VTn6ONx9V4-5-vXp5fyYZ07ylXMqW4qpwvMGQOlGYjkBKC4thKaCleiqm0htCAWJNBGs1oWBKyuXO1UwRydo9vxbjL2JjgfwW1d33XgohGcSsVYgu5GKH3-fYAQzc4HB21rO-gPwRRKaoKlSOByBN3QhzBAY_aD39nh1xBsjrmZTWmOuZkpt6S4GRUeAP7pafsHDNRoDg</recordid><startdate>19870401</startdate><enddate>19870401</enddate><creator>Bokhari, S H</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>OTOTI</scope></search><sort><creationdate>19870401</creationdate><title>Multiprocessing the Sieve of Eratosthenes</title><author>Bokhari, S H</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c358t-39fbc920544e894e6014ee859a7efb0b6bda26961ae7e3f94d721ea9bcdc824c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1987</creationdate><topic>990210 - Supercomputers- (1987-1989)</topic><topic>990230 - Mathematics & Mathematical Models- (1987-1989)</topic><topic>Algorithm design and analysis</topic><topic>ALGORITHMS</topic><topic>ARRAY PROCESSORS</topic><topic>Benchmark testing</topic><topic>BENCHMARKS</topic><topic>Computational modeling</topic><topic>COMPUTER CODES</topic><topic>Computer simulation</topic><topic>Concurrent computing</topic><topic>EXECUTIVE CODES</topic><topic>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</topic><topic>Indexing</topic><topic>Load management</topic><topic>Magnetic heads</topic><topic>MATHEMATICAL LOGIC</topic><topic>MEMORY DEVICES</topic><topic>Parallel machines</topic><topic>PARALLEL PROCESSING</topic><topic>Performance evaluation</topic><topic>PROGRAMMING</topic><topic>SIGNALS</topic><topic>TIME DEPENDENCE</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bokhari, S H</creatorcontrib><creatorcontrib>Univ. of Engineering and Technology, Lahore</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>OSTI.GOV</collection><jtitle>Computer (Long Beach, Calif.)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bokhari, S H</au><aucorp>Univ. of Engineering and Technology, Lahore</aucorp><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiprocessing the Sieve of Eratosthenes</atitle><jtitle>Computer (Long Beach, Calif.)</jtitle><stitle>MC</stitle><date>1987-04-01</date><risdate>1987</risdate><volume>20</volume><issue>4</issue><spage>50</spage><epage>58</epage><pages>50-58</pages><issn>0018-9162</issn><eissn>1558-0814</eissn><coden>CPTRB4</coden><abstract>More than two thousand years ago, Eratosthenes of Cyrene described a procedure for finding all prime numbers in a given range. This straightforward algorithm, known as the Sieve of Eratosthenes, is to this day the only procedure for finding prime numbers. In recent years it has been of interest to computer scientists and engineers because it serves as a convenient benchmark against which to measure some aspects of a computer's performance. Specifically, the Sieve tests the power of a machine (or of a compiler) to access a very large array in memory rapidly and repeatedly. This power is clearly influenced by memory access time, the speed at which indexing is done, and the overhead of looping. The parallel version of the Sieve is very useful as a test of some of the capabilities of a parallel machine. The parallel algorithm is straightforward, and so is the process for checking the final results. However, the efficient implementation of the algorithm on a real parallel machine, especially in the dynamic load-balancing case, requires thoughtful design.</abstract><cop>United States</cop><pub>IEEE</pub><doi>10.1109/MC.1987.1663535</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9162 |
| ispartof | Computer (Long Beach, Calif.), 1987-04, Vol.20 (4), p.50-58 |
| issn | 0018-9162 1558-0814 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28791076 |
| source | IEEE Electronic Library (IEL) |
| subjects | 990210 - Supercomputers- (1987-1989) 990230 - Mathematics & Mathematical Models- (1987-1989) Algorithm design and analysis ALGORITHMS ARRAY PROCESSORS Benchmark testing BENCHMARKS Computational modeling COMPUTER CODES Computer simulation Concurrent computing EXECUTIVE CODES GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE Indexing Load management Magnetic heads MATHEMATICAL LOGIC MEMORY DEVICES Parallel machines PARALLEL PROCESSING Performance evaluation PROGRAMMING SIGNALS TIME DEPENDENCE |
| title | Multiprocessing the Sieve of Eratosthenes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T20%3A12%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multiprocessing%20the%20Sieve%20of%20Eratosthenes&rft.jtitle=Computer%20(Long%20Beach,%20Calif.)&rft.au=Bokhari,%20S%20H&rft.aucorp=Univ.%20of%20Engineering%20and%20Technology,%20Lahore&rft.date=1987-04-01&rft.volume=20&rft.issue=4&rft.spage=50&rft.epage=58&rft.pages=50-58&rft.issn=0018-9162&rft.eissn=1558-0814&rft.coden=CPTRB4&rft_id=info:doi/10.1109/MC.1987.1663535&rft_dat=%3Cproquest_RIE%3E28791076%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28791076&rft_id=info:pmid/&rft_ieee_id=1663535&rfr_iscdi=true |