Resource oblivious sorting on multicores

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 226-237

  Cole, Richard ^a   Ramachandran, Vijaya ^b  

^a NEW YORK UNIVERSITY   (United States)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONY; CACHE MISS; CACHE-OBLIVIOUS; COMPUTING ENVIRONMENTS; CRITICAL PATH LENGTHS; MULTI CORE; OBLIVIOUS SORTING; OPTIMAL NUMBER; PARALLEL COMPLEXITY; PARALLEL IMPLEMENTATIONS; SAMPLE SORT; SHARED MEMORIES; SORTING ALGORITHM;

CACHE MEMORY; LINGUISTICS; NANOTECHNOLOGY; PARALLEL ARCHITECTURES; TRANSLATION (LANGUAGES);

ALGORITHMS;

EID: 77955314108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_20     Document Type: Conference Paper

References (16)

1. Acar, U. A., Blelloch, G. E., Blumofe, R. D.: The data locality of work stealing. In: Theory of Computing Systems, vol. 35 (3). Springer, Heidelberg (2002)
2. Aggarwal, A., Vitter, J. S.: The input/output complexity of sorting and related problems. CACM 31, 1116-1127 (1988)
3. Ajtai, M., Komlos, J., Szemeredi, E.: An O (n log n) sorting network. Combinatorica 3, 1-19 (1983)
4. Arge, L., Goodrich, M. T., Nelson, M., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: ACM SPAA, pp. 197-206 (2008)
5. 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-510 (2008)
6. Blelloch, G., Gibbons, P., Simhadri, H.: Brief announcement: Low depth cacheoblivious sorting. In: ACM SPAA. ACM, New York (2009)
7. Blumofe, R., Leiserson, C. E.: Scheduling multithreaded computations by work stealing. JACM, 720-748 (1999)
8. Blumofe, R. D., Leiserson, C. E.: Scheduling multithreaded computations by work stealing. Journal of the ACM 46 (5), 720-748 (1999)
9. Burton, F., Sleep, M. R.: Executing functional programs on a virtual tree of processors. In: ACM FPLCA, pp. 187-194 (1981)
10. Chowdhury, R. A., Silvestri, F., Blakeley, B., Ramachandran, V.: Oblivious algorithms for multicores and network of processors. In: IEEE IPDPS (2010)
11. Cole, R.: Parallel merge sort. SIAM J Comput 17 (4) (1988)
12. Cole, R., Ramachandran, V.: Efficient resource oblivious scheduling of multicore algorithms (2010) (Manuscript)
13. Cole, R., Ramachandran, V.: Resource oblivious sorting on multicores. TR-10-13, Dept of Comp Sci, UT-Austin (2010)
14. Cole, R., Ramachandran, V.: Resource oblivious sorting on multicores. (Submitted, 2010)
15. Frigo, M., Leiserson, C. E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: IEEE FOCS (1999)
16. Valiant, L. G.: A bridging model for multi-core computing. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol. 5193, pp. 13-28. Springer, Heidelberg (2008)