Parallel external memory graph algorithms

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010

Volumn , Issue , 2010, Pages

  Arge, Lars ^a   Sitchinava, Nodari ^b   Goodrich, Michael T ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BICONNECTED COMPONENTS; CACHE CHIPS; CONNECTED GRAPH; EAR DECOMPOSITION; EXTERNAL MEMORY; FUNDAMENTAL PROBLEM; GRAPH ALGORITHMS; LOWEST COMMON ANCESTORS; MINIMUM SPANNING TREES; PARALLEL COMPUTATION; PARALLEL I/O; TREE CONTRACTION;

DISTRIBUTED PARAMETER NETWORKS; GRAPH THEORY; NANOTECHNOLOGY;

TREES (MATHEMATICS);

EID: 77954015276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2010.5470440     Document Type: Conference Paper

References (24)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31:1116-1127, 1988.
2. R. Anderson and G. Miller. Deterministic parallel list ranking. In Proc. 3rd Aegean Workshop Computing, volume 319 of Lecture Notes Comput. Sci., pages 81-90. Springer-Verlag, 1988.
3. L. Arge, M. T. Goodrich, M. Nelson, and N. Sitchinava. Fundamental parallel algorithms for private-cache chip multiprocessors. In Proc 20th ACM SPAA '08, pages 197-206, 2008.
4. M. A. Bender, J. T. Fineman, S. Gilbert, and B. C. Kuszmaul. Concurrent cache-oblivious B-trees. In Proc. 17th ACM SPAA, pages 228-237, 2005.
5. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM J. Comput., 22(2):221-242, 1993.
6. G. E. Blelloch, R. A. Chowdhury, P. B. Gibbons, V. Ramachandran, S. Chen, and M. Kozuch. Provably good multicore cache performance for divide-and-conquer algorithms. In Proc. 19th ACM-SIAM Sympos. Discrete Algorithms, 2008.
7. S. Chen, P. B. Gibbons, M. Kozuch, V. Liaskovitis, A. Ailamaki, G. E. Blelloch, B. Falsafi, L. Fix, N. Hardavellas, T. C. Mowry, and C. Wilkerson. Scheduling threads for constructive cache sharing on CMPs. In Proc. 19th ACM SPAA, pages 105-115, 2007.
8. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms,pages 139-149, 1995.
9. R. A. Chowdhury and V. Ramachandran. The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. In Proc. 19th ACM SPAA, pages 71-80, 2007.
10. R. A. Chowdhury and V. Ramachandran. Cache-efficient dynamic programming algorithms for multicores. In Proc. 20th ACMSPAA, pages 207-216, 2008.
11. R. A. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran. Oblivious algorithms for multicores and network of processors. Technical Report TR-09-19, University of Texas at Austin, Department of Computer Science, July 2009.
12. R. A. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran. Oblivious algorithms for multicores and network of processors. In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), 2010. To Appear.
13. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal list ranking. Inform. Control, 1:153-174, 1986.
14. G. Cong and D. A. Bader. Techniques for designing efficient parallel graph algorithms for SMPs and multicore processors. In ISPA, pages 137-147, 2007.
15. F. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. Algorithmica, 36:97-122, 2003.
16. F. Dehne, W. Dittrich, D. Hutchinson, and A. Maheshwari. Bulk-synchronous parallel algorithms for external memory model. Theory of Computing Systems, 35:567-597, 2002.
17. H. Gazit, G. L. Miller, and S.-H. Teng. Optimal tree contraction in an EREW model. In Concurrent Computations: Algorithms, Architecture and Technology, pages 139-156, New York, 1988. Plenum Press.
18. D. Geer. Chip Makers Turn to Multicore Processors. IEEE Computer, 38(5):11-13, 2005.
19. Y. Maon, B. Schieber, and U. Vishkin. Parallel ear decomposition search (EDS) and st-numbering in graphs. Theoret. Comput. Sci., 47:277-298, 1986.
20. G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci., pages 478-489, 1985.
21. J. Rattner. Multi-Core to the Masses. Parallel Architectures and Compilation Techniques, 2005. PACT 2005. 14th International Conference on, pages 3-3, 2005.
22. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. J. Algorithms, 3(1):57-67, 1982.
23. R. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Comput., 14:862-874, 1985.
24. J. C. Wyllie. The complexity of parallel computation, 1979. Ph.D. thesis, Department of Computer Science, Cornell University.