{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:58:24Z","timestamp":1725796704765},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091464"},{"type":"electronic","value":"9783319091471"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09147-1_43","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T03:41:10Z","timestamp":1404272470000},"page":"592-606","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Prime Sieve in Heterogeneous Computer Clusters"],"prefix":"10.1007","author":[{"given":"Carlos M.","family":"Costa","sequence":"first","affiliation":[]},{"given":"Altino M.","family":"Sampaio","sequence":"additional","affiliation":[]},{"given":"Jorge G.","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Standard, RSA Cryptography: RSA Public Key Cryptography Standard# 1 v. 2.2. RSA Laboratories (2012)"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Lenstra Jr., H.W.: Primality testing algorithms (after Adleman, Rumely and Williams). In: Sminaire Bourbaki, vol. 1980\/81 Exposs 561578, pp. 243\u2013257. Springer, Heidelberg (1981)","DOI":"10.1007\/BFb0097201"},{"issue":"1","key":"43_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S0956796808007004","volume":"19","author":"M.E. O\u2019Neill","year":"2009","unstructured":"O\u2019Neill, M.E.: The genuine sieve of Eratosthenes. Journal of Functional Programming\u00a019(1), 95 (2009)","journal-title":"Journal of Functional Programming"},{"issue":"246","key":"43_CR4","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1090\/S0025-5718-03-01501-1","volume":"73","author":"A. Atkin","year":"2004","unstructured":"Atkin, A., Bernstein, D.: Prime sieves using binary quadratic forms. Mathematics of Computation\u00a073(246), 1023\u20131030 (2004)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"43_CR5","first-page":"73","volume":"2","author":"V.R. Aiyar","year":"1934","unstructured":"Aiyar, V.R.: Sundaram\u2019s Sieve for Prime Numbers. The Mathematics Student\u00a02(2), 73 (1934)","journal-title":"The Mathematics Student"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-44499-8_27","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"M. Joye","year":"2000","unstructured":"Joye, M., Paillier, P., Vaudenay, S.: Efficient generation of prime numbers. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 340\u2013354. Springer, Heidelberg (2000)"},{"key":"43_CR7","unstructured":"Distributed prime sieve C++ implementation (git repository), \n                    \n                      https:\/\/github.com\/carlosmccosta\/Distributed-Prime-Sieve"},{"issue":"1","key":"43_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L. Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry standard API for shared-memory programming. Computational Science & Engineering\u00a05(1), 46\u201355 (1998)","journal-title":"Computational Science & Engineering"},{"issue":"4","key":"43_CR9","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF00264164","volume":"17","author":"P. Pritchard","year":"1982","unstructured":"Pritchard, P.: Explaining the wheel sieve. Acta Informatica\u00a017(4), 477\u2013485 (1982)","journal-title":"Acta Informatica"},{"key":"43_CR10","unstructured":"Primesieve, \n                    \n                      http:\/\/primesieve.org\/"},{"issue":"4","key":"43_CR11","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0196-6774(83)90014-7","volume":"4","author":"P. Pritchard","year":"1983","unstructured":"Pritchard, P.: Fast compact prime number sieves (among others). Journal of Algorithms\u00a04(4), 332\u2013344 (1983)","journal-title":"Journal of Algorithms"},{"key":"43_CR12","unstructured":"J\u00e1rai, A., Vatai, E.: Cache optimized linear sieve. arXiv preprint arXiv:1111.3297 (2011)"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/363235.363247","volume":"12","author":"R.C. Singleton","year":"1969","unstructured":"Singleton, R.C.: An efficient prime number generator. Communications of the ACM\u00a012, 563\u2013564 (1969)","journal-title":"Communications of the ACM"},{"key":"43_CR14","unstructured":"Paillard, G. A. L.: A Fully Distributed Prime Numbers Generation using the Wheel Sieve. In: Parallel and Distributed Computing and Networks, pp. 651\u2013656 (2005)"},{"key":"43_CR15","unstructured":"Sorenson, J.: An analysis of two prime number sieves. In: Computer Sciences Department. University of Wisconsin-Madison (1991)"},{"key":"43_CR16","unstructured":"David, J.W.: Parallel Prime Sieve: Finding Prime Numbers. In.: Parallel Computing Seminar Report, Institute of Information & Mathematical Sciences, Massey University at Albany, Auckland, New Zealand (2009)"},{"key":"43_CR17","unstructured":"Cordeiro, M.: Parallelization of the Sieve of Eratosthenes. In: Parallel Programming, Doctoral Program in Informatics Engineering, Engineering Faculty. University of Porto (2012)"},{"issue":"1","key":"43_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1006\/inco.1994.1082","volume":"114","author":"J. Sorenson","year":"1994","unstructured":"Sorenson, J., Parberry, I.: Two Fast Parallel Prime Number Sieves. Information and Computation\u00a0114(1), 115\u2013130 (1994)","journal-title":"Information and Computation"},{"issue":"4","key":"43_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MC.1987.1663535","volume":"20","author":"S.H. Bokhari","year":"1987","unstructured":"Bokhari, S.H.: Multiprocessing the Sieve of Eratosthenes. Computer Journal\u00a020(4), 50\u201358 (1987)","journal-title":"Computer Journal"},{"issue":"5","key":"43_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/51624.51628","volume":"8","author":"G. Anderson","year":"1988","unstructured":"Anderson, G.: An Ada Multitasking Solution for the Sieve of Eratosthenes. Ada Lett.\u00a08(5), 71\u201374 (1988)","journal-title":"Ada Lett."},{"issue":"3","key":"43_CR21","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1145\/72551.72555","volume":"21","author":"E. Shapiro","year":"1989","unstructured":"Shapiro, E.: The family of concurrent logic programming languages. ACM Computing Surveys (CSUR)\u00a021(3), 413\u2013510 (1989)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Gropp, W., Lusk, E., Skjellum, A.: Using MPI: portable parallel programming with the message-passing interface, vol.\u00a01. MIT press (1999)","DOI":"10.7551\/mitpress\/7056.001.0001"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09147-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T01:51:17Z","timestamp":1558921877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09147-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091464","9783319091471"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09147-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}