{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:07Z","timestamp":1763467987370},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_20","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"226-237","source":"Crossref","is-referenced-by-count":9,"title":["Resource Oblivious Sorting on Multicores"],"prefix":"10.1007","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Theory of Computing Systems","author":"U.A. Acar","year":"2002","unstructured":"Acar, U.A., Blelloch, G.E., Blumofe, R.D.: The data locality of work stealing. In: Theory of Computing Systems, vol.\u00a035(3). Springer, Heidelberg (2002)"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. CACM\u00a031, 1116\u20131127 (1988)","journal-title":"CACM"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M., Komlos, J., Szemeredi, E.: An O(n log n) sorting network. Combinatorica\u00a03, 1\u201319 (1983)","journal-title":"Combinatorica"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Arge, L., Goodrich, M.T., Nelson, M., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: ACM SPAA, pp. 197\u2013206 (2008)","DOI":"10.1145\/1378533.1378573"},{"key":"20_CR5","unstructured":"Blelloch, G., Chowdhury, R., Gibbons, P., Ramachandran, V., Chen, S., Kozuch, M.: Provably good multicore cache performance for divide-and-conquer algorithms. In: ACM-SIAM SODA, pp. 501\u2013510 (2008)"},{"key":"20_CR6","volume-title":"ACM SPAA","author":"G. Blelloch","year":"2009","unstructured":"Blelloch, G., Gibbons, P., Simhadri, H.: Brief announcement: Low depth cache-oblivious sorting. In: ACM SPAA. ACM, New York (2009)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Blumofe, R., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. JACM, 720\u2013748 (1999)","DOI":"10.1145\/324133.324234"},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"R.D. Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. Journal of the ACM\u00a046(5), 720\u2013748 (1999)","journal-title":"Journal of the ACM"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Burton, F., Sleep, M.R.: Executing functional programs on a virtual tree of processors. In: ACM FPLCA, pp. 187\u2013194 (1981)","DOI":"10.1145\/800223.806778"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Chowdhury, R.A., Silvestri, F., Blakeley, B., Ramachandran, V.: Oblivious algorithms for multicores and network of processors. In: IEEE IPDPS (2010)","DOI":"10.1109\/IPDPS.2010.5470354"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Cole, R.: Parallel merge sort. SIAM J Comput\u00a017(4) (1988)","DOI":"10.1137\/0217049"},{"key":"20_CR12","unstructured":"Cole, R., Ramachandran, V.: Efficient resource oblivious scheduling of multicore algorithms (2010) (Manuscript)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Cole, R., Ramachandran, V.: Resource oblivious sorting on multicores. TR-10-13, Dept of Comp Sci, UT-Austin (2010)","DOI":"10.1007\/978-3-642-14165-2_20"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Cole, R., Ramachandran, V.: Resource oblivious sorting on multicores. (Submitted, 2010)","DOI":"10.1007\/978-3-642-14165-2_20"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: IEEE FOCS (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-87744-8_2","volume-title":"Algorithms - ESA 2008","author":"L.G. Valiant","year":"2008","unstructured":"Valiant, L.G.: A bridging model for multi-core computing. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 13\u201328. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:16Z","timestamp":1606186096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}