{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:59:07Z","timestamp":1725577147728},"reference-count":20,"publisher":"CRC Press","isbn-type":[{"type":"print","value":"9781439825365"},{"type":"electronic","value":"9781439825372"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12,7]]},"DOI":"10.1201\/b10376-16","type":"book-chapter","created":{"date-parts":[[2011,1,28]],"date-time":"2011-01-28T09:37:12Z","timestamp":1296207432000},"page":"195-216","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial Algorithm Design on the Cell\/B.E. Processor"],"prefix":"10.1201","author":[{"given":"David","family":"Bader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Virat","family":"Agarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamesh","family":"Madduri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Petrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2011,1,28]]},"reference":[{"key":"p_1","unstructured":"D.A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). InProc. Int\u2019l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, April 2004."},{"key":"p_2","unstructured":"D.A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. InProc. Int\u2019l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, April 2004."},{"key":"p_3","doi-asserted-by":"crossref","unstructured":"D.A. Bader, G. Cong, and J. Feo. On the architectural requirements for efficient execution of graph algorithms. InProc. 34th Int\u2019l Conf. on Parallel Processing (ICPP 2005), Oslo, Norway, June 2005.","DOI":"10.1109\/ICPP.2005.55"},{"key":"p_4","doi-asserted-by":"crossref","unstructured":"K.J. Barker, K. Davis, A. Hoisie, D.J. Kerbyson, M. Lang, S. Pakin, and J.C. Sancho. Entering the petaflop era: The architecture and performance of Roadrunner. InProc. of the 2008 ACM\/IEEE Conference on Supercomputing (SC08), pages1-11, Piscataway, NJ, 2008. IEEE Press.","DOI":"10.1109\/SC.2008.5217926"},{"volume-title":"June","year":"2006","author":"Brokenshire D.A.","key":"p_5"},{"volume-title":"November","year":"2005","author":"Chen T.","key":"p_6"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90036-9"},{"key":"p_9","doi-asserted-by":"crossref","unstructured":"D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. InProc. 4th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPOPP 1993), pages1-12, San Diego, CA, May 1993.","DOI":"10.1145\/155332.155333"},{"key":"p_10","doi-asserted-by":"crossref","unstructured":"D.R. Helman and J. J\u00e1J\u00e1. Designing practical efficient algorithms for symmetric multiprocessors. InProc. 1st Intl. Workshop on Algorithm Engineering and Experimentation (ALENEX 1999), volume1619of Lecture Notes in Computer Science, pages 37-56, Baltimore, MD, January 1999. Springer-Verlag.","DOI":"10.1007\/3-540-48518-X_3"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1678"},{"key":"p_12","unstructured":"C. Jacobi, H.J. Oh, K.D. Tran, S.R. Cottier, B.W. Michael, H. Nishikawa, Y. Totsuka, T. Namatame, and N. Yano. The vector floating-point unit in a synergistic processor element of a Cell processor. InProc. 17th IEEE Symp. on Computer Arithmetic (ARITH 2005), pages59-67, Washington, DC, 2005."},{"volume-title":"An Introduction to Parallel Algorithms","year":"1992","author":"J\u00e1J\u00e1 J.","key":"p_13"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1147\/rd.494.0589"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1516-5_1"},{"key":"p_16","doi-asserted-by":"crossref","unstructured":"M.S. Rehman, K. Kothapalli, and P.J. Narayanan. Fast and scalable list ranking on the GPU. InICS '09: Proceedings of the 23rd International Conference on Supercomputing, pages235-243, New York, NY, 2009. ACM.","DOI":"10.1145\/1542275.1542311"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0074"},{"issue":"10","key":"p_18","first-page":"1381","volume":"19","author":"Scarpazza D.P.","year":"2008","journal-title":"IEEE Transactions on"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"p_20","doi-asserted-by":"crossref","unstructured":"S. Williams, J. Shalf, L. Oliker, S. Kamil, P. Husbands, and K. Yelick. The potential of the Cell processor for scientific computing. InProc. 3rd Conf. on Computing Frontiers (CF 2006), pages 9-20, Ischia, Italy, 2006. This chapter is based on the authors\u2019 previously published work: \u2022 D.A. Bader, V. Agarwal, and K. Madduri, \u201cOn the Design and Analysis of Irregular Algorithms on the Cell Processor: A case study on list ranking,\u201d 21th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Long Beach, CA, March 2007.","DOI":"10.1145\/1128022.1128027"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2007.09.005"}],"container-title":["Chapman & Hall\/CRC Computational Science","Scientific Computing with Multicore and Accelerators"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T01:43:02Z","timestamp":1559958182000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.crcnetbase.com\/doi\/abs\/10.1201\/b10376-16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,7]]},"ISBN":["9781439825365","9781439825372"],"references-count":20,"alternative-id":["10.1201\/b10376-16","10.1201\/CHCOMPUTSCI","10.1201\/b10376"],"URL":"https:\/\/doi.org\/10.1201\/b10376-16","relation":{},"ISSN":["2154-4492"],"issn-type":[{"type":"print","value":"2154-4492"}],"subject":[],"published":{"date-parts":[[2010,12,7]]}}}