{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:44:07Z","timestamp":1743054247080,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_3","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"28-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Bulk-Parallel Priority Queue in External Memory with STXXL"],"prefix":"10.1007","author":[{"given":"Timo","family":"Bingmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Keh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Kopinsky, J., Li, J., Shavit, N.: The SprayList: A scalable relaxed priority queue. Tech. Rep. MSR-TR-2014-16, Microsoft Research, September 2014","DOI":"10.1145\/2688500.2688523"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-003-1021-x","volume":"37","author":"L Arge","year":"2003","unstructured":"Arge, L.: The buffer tree: A technique for designing batched external data structures. Algorithmica 37(1), 1\u201324 (2003)","journal-title":"Algorithmica"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Arge, L., Goodrich, M.T., Nelson, M., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: SPAA, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1378533.1378573"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann, A., Dementiev, R., Singler, J.: Building a parallel pipelined external memory algorithm library. In: IPDPS 2009, pp. 1\u201310. IEEE (2009)","DOI":"10.1109\/IPDPS.2009.5161001"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bingmann, T., Fischer, J., Osipov, V.: Inducing suffix and LCP arrays in external memory. In: ALENEX 2013, pp. 88\u2013102. SIAM (2013)","DOI":"10.1137\/1.9781611972931.8"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bingmann, T., Keh, T., Sanders, P.: A bulk-parallel priority queue in external memory with STXXL, April 2015. see ArXiv e-print arXiv:1504.00545","DOI":"10.1007\/978-3-319-20086-6_3"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0054359","volume-title":"Algorithm Theory - SWAT 1998","author":"GS Brodal","year":"1998","unstructured":"Brodal, G.S., Katajainen, J.: Worst-case efficient external-memory priority queues. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol. 1432, pp. 107\u2013118. Springer, Heidelberg (1998)"},{"key":"3_CR8","unstructured":"Chiang, Y.J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: SODA 1995, pp. 139\u2013149. SIAM (1995)"},{"issue":"6","key":"3_CR9","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1002\/spe.844","volume":"38","author":"R Dementiev","year":"2008","unstructured":"Dementiev, R., Kettner, L., Sanders, P.: STXXL: Standard template library for XXL data sets. Software & Practice and Experience 38(6), 589\u2013637 (2008)","journal-title":"Software & Practice and Experience"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Dementiev, R., Sanders, P.: Asynchronous parallel disk sorting. In: SPAA 2003, pp. 138\u2013148. ACM (2003)","DOI":"10.1145\/777412.777435"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00128644","volume":"6","author":"N Deo","year":"1992","unstructured":"Deo, N., Prasad, S.: Parallel heap: An optimal parallel priority queue. The Journal of Supercomputing 6(1), 87\u201398 (1992)","journal-title":"The Journal of Supercomputing"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hutchinson, D.A., Sanders, P., Vitter, J.S.: Duality between prefetching and queued writing with parallel disks. SIAM Journal on Computing 34(6) (2005)","DOI":"10.1137\/S0097539703431573"},{"key":"3_CR13","unstructured":"Keh, T.: Bulk-parallel priority queue in external memory, Bachelor Thesis, Karlsruhe Institute of Technology, Germany (2014)"},{"key":"3_CR14","unstructured":"Petersen, L.H.: External Priority Queues in Practice. Master\u2019s thesis, Aarhus Universitet, Datalogisk Institut, Denmark (2007)"},{"issue":"1","key":"3_CR15","first-page":"33","volume":"40","author":"MC Pinotti","year":"1991","unstructured":"Pinotti, M.C., Pucci, G.: Parallel priority queues. IPL 40(1), 33\u201340 (1991)","journal-title":"Parallel priority queues. IPL"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Rihani, H., Sanders, P., Dementiev, R.: Multiqueues: Simpler, faster, and better relaxed concurrent priority queues. arXiv preprint arXiv:1411.1209 (2014)","DOI":"10.1145\/2755573.2755616"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jpdc.1998.1429","volume":"49","author":"P Sanders","year":"1998","unstructured":"Sanders, P.: Randomized priority queues for fast parallel access. Journal of Parallel and Distributed Computing 49(1), 86\u201397 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/351827.384249","volume":"5","author":"P Sanders","year":"2000","unstructured":"Sanders, P.: Fast priority queues for cached memory. JEA 5, 7 (2000)","journal-title":"JEA"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-540-74466-5_72","volume-title":"Euro-Par 2007 Parallel Processing","author":"J Singler","year":"2007","unstructured":"Singler, J., Sanders, P., Putze, F.: MCSTL: the multi-core standard template library. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 682\u2013694. Springer, Heidelberg (2007)"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0743-7315(91)90022-2","volume":"12","author":"PJ Varman","year":"1991","unstructured":"Varman, P.J., Scheufler, S.D., Iyer, B.R., Ricard, G.R.: Merging multiple lists on hierarchical-memory multiprocessors. Journal of Parallel and Distributed Computing 12(2), 171\u2013177 (1991)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2\u20133","key":"3_CR21","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"JS Vitter","year":"1994","unstructured":"Vitter, J.S., Shriver, E.A.: Algorithms for parallel memory, i: Two-level memories. Algorithmica 12(2\u20133), 110\u2013147 (1994)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T18:24:44Z","timestamp":1674239084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}