메뉴 건너뛰기




Volumn , Issue , 2005, Pages 423-437

Lifting sequential graph algorithms for distributed-memory parallel computation

Author keywords

Distributed computing; Generic programming; Parallel graph algorithms

Indexed keywords

GENERIC PROGRAMMING; PARALLEL GRAPH ALGORITHM;

EID: 31744443088     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (44)

References (36)
  • 2
    • 0003966887 scopus 로고
    • NESL: A nested data-parallel language
    • April
    • Guy E. Blelloch. NESL: A nested data-parallel language. Technical Report CMU-CS-93-129, April 1993.
    • (1993) Technical Report , vol.CMU-CS-93-129
    • Blelloch, G.E.1
  • 5
    • 0022738825 scopus 로고
    • Matrix-free methods for stiff systems of ODE's
    • June
    • Peter N. Brown and Alan C. Hindmarsh. Matrix-free methods for stiff systems of ODE's. SIAM J. Numer. Anal., 23(3):610-638, June 1986.
    • (1986) SIAM J. Numer. Anal. , vol.23 , Issue.3 , pp. 610-638
    • Brown, P.N.1    Hindmarsh, A.C.2
  • 7
    • 31744434031 scopus 로고    scopus 로고
    • CGM graph/CGMlib: Implementing and testing CGM graph algorithms on PC clusters
    • Albert Chan and Frank Dehne. CGM graph/CGMlib: Implementing and testing CGM graph algorithms on PC clusters. In PVM/MPI, pages 117-125, 2003.
    • (2003) PVM/MPI , pp. 117-125
    • Chan, A.1    Dehne, F.2
  • 9
    • 84896773698 scopus 로고    scopus 로고
    • A parallelization of dijkstra's shortest path algorithm
    • Lubos Brim, Jozef Gruska, and Jirí Zlatuska, editors, Mathematical Foundations of Computer Science (MFCS). Springer
    • Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders. A parallelization of dijkstra's shortest path algorithm. In Lubos Brim, Jozef Gruska, and Jirí Zlatuska, editors, Mathematical Foundations of Computer Science (MFCS), volume 1450 of Lecture Notes in Computer Science, pages 722-731. Springer, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1450 , pp. 722-731
    • Crauser, A.1    Mehlhorn, K.2    Meyer, U.3    Sanders, P.4
  • 11
    • 0032313730 scopus 로고    scopus 로고
    • Practical parallel algorithms for minimum spanning trees
    • Frank Dehne and Silvia Götz. Practical parallel algorithms for minimum spanning trees. In Symposium on Reliable Distributed Systems, pages 366-371, 1998.
    • (1998) Symposium on Reliable Distributed Systems , pp. 366-371
    • Dehne, F.1    Götz, S.2
  • 13
    • 10044242265 scopus 로고    scopus 로고
    • Connected components algorithms for mesh connected parallel computers
    • Sandeep N. Bhatt, editor, Parallel Algorithms. American Mathematical Society
    • Steve Goddard, Subodh Kumar, and Jan F. Prins. Connected components algorithms for mesh connected parallel computers. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 43-58. American Mathematical Society, 1997.
    • (1997) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.30 , pp. 43-58
    • Goddard, S.1    Kumar, S.2    Prins, J.F.3
  • 15
    • 0242444399 scopus 로고
    • PETSc: Portable extensible tools for scientific computation
    • Argonne National Laboratory, Argonne, IL
    • W. D. Gropp and B. Smith. PETSc: Portable extensible tools for scientific computation. Technical report, Argonne National Laboratory, Argonne, IL, 1994.
    • (1994) Technical Report
    • Gropp, W.D.1    Smith, B.2
  • 17
    • 84858539310 scopus 로고
    • EPEE: An Eiffel environment to program distributed memory parallel computers
    • J.-M. Jézéquel. EPEE: an Eiffel environment to program distributed memory parallel computers. Journal of Object Oriented Programming, 1993.
    • (1993) Journal of Object Oriented Programming
    • Jézéquel, J.-M.1
  • 18
    • 84955565674 scopus 로고
    • Transparent parallelisation through reuse: Between a compiler and a library approach
    • 0. M. Nierstrasz, editor, Lecture Notes in Computer Science. Springer Verlag, July
    • J.-M. Jézéquel. Transparent parallelisation through reuse: Between a compiler and a library approach. In 0. M. Nierstrasz, editor, ECOOP'93 proceedings, number 707 in Lecture Notes in Computer Science, pages 384-405. Springer Verlag, July 1993.
    • (1993) ECOOP'93 Proceedings , Issue.707 , pp. 384-405
    • Jézéquel, J.-M.1
  • 20
    • 0030689538 scopus 로고    scopus 로고
    • HPC++: Experiments with the parallel standard template library
    • Elizabeth Johnson and Dennis Cannon. HPC++: Experiments with the Parallel Standard Template Library. In International Conference on Super-computing, pages 124-131, 1997.
    • (1997) International Conference on Super-computing , pp. 124-131
    • Johnson, E.1    Cannon, D.2
  • 24
    • 0039386766 scopus 로고
    • ZPL: An array sublanguage
    • U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors
    • Calvin Lin and Lawrence Snyder. ZPL: An array sublanguage. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing, pages 96-114, 1993. ftp://ftp.-cs.washington. edu/pub/orca/papers/1cpc93.ps.
    • (1993) Languages and Compilers for Parallel Computing , pp. 96-114
    • Lin, C.1    Snyder, L.2
  • 25
    • 0027757472 scopus 로고
    • MPI: A Message Passing Interface
    • IEEE Computer Society Press, November
    • Message Passing Interface Forum. MPI: A Message Passing Interface. In Proc. of Supercomputing '93, pages 878-883. IEEE Computer Society Press, November 1993.
    • (1993) Proc. of Supercomputing '93 , pp. 878-883
  • 27
    • 84987217170 scopus 로고
    • Generic programming
    • P. (Patrizia) Gianni, editor, Symbolic and algebraic computation: ISSAC '88, Rome, Italy, July 4-8, 1988: Proceedings, Berlin. Springer Verlag
    • David R. Musser and Alexander A. Stepanov. Generic programming. In P. (Patrizia) Gianni, editor, Symbolic and algebraic computation: ISSAC '88, Rome, Italy, July 4-8, 1988: Proceedings, volume 358 of Lecture Notes in Computer Science, pages 13-25, Berlin, 1989. Springer Verlag.
    • (1989) Lecture Notes in Computer Science , vol.358 , pp. 13-25
    • Musser, D.R.1    Stepanov, A.A.2
  • 28
    • 0036625331 scopus 로고    scopus 로고
    • Lifting sequential functions to parallel skeletons
    • June
    • Thomas Nitsche. Lifting sequential functions to parallel skeletons. Parallel Processing Letters, 12(2):267-284, June 2002.
    • (2002) Parallel Processing Letters , vol.12 , Issue.2 , pp. 267-284
    • Nitsche, T.1
  • 29
    • 0042034061 scopus 로고    scopus 로고
    • Generating network topologies that obey power laws
    • November
    • Christopher R. Palmer and J. Gregory Steffan. Generating network topologies that obey power laws. In Proceedings of GLOBECOM '2000, November 2000.
    • (2000) Proceedings of GLOBECOM '2000
    • Palmer, C.R.1    Steffan, J.G.2
  • 34
    • 0004083623 scopus 로고
    • The standard template library
    • WG21/N0482, ISO Programming Language C++ Project, May
    • Alexander A. Stepanov and Meng Lee. The Standard Template Library. Technical Report X3J16/94-0095, WG21/N0482, ISO Programming Language C++ Project, May 1994.
    • (1994) Technical Report , vol.X3J16-94-0095
    • Stepanov, A.A.1    Lee, M.2
  • 35
    • 0037204890 scopus 로고    scopus 로고
    • Some remarks on distributed depth-first search
    • Y. H. Tsin. Some remarks on distributed depth-first search. Information Processing Letters, 82(4):173-178, 2002.
    • (2002) Information Processing Letters , vol.82 , Issue.4 , pp. 173-178
    • Tsin, Y.H.1
  • 36
    • 0025467711 scopus 로고
    • A bridging model for parallel computation
    • Leslie G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
    • (1990) Communications of the ACM , vol.33 , Issue.8 , pp. 103-111
    • Valiant, L.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.