메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages

A compiler and runtime infrastructure for automatic program distribution

Author keywords

[No Author keywords available]

Indexed keywords

CPU; PROGRAM DISTRIBUTION; PROGRAM PARTITIONING; RESOURCE MODELING;

EID: 33746320261     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.7     Document Type: Conference Paper
Times cited : (22)

References (22)
  • 2
    • 33746274725 scopus 로고    scopus 로고
    • Automatic distribution of java byte-code based on dependence analysis
    • School of Information and Computer Science, University of California, Irvine, October
    • R. E. Diaconescu, L. Wang, and M. Franz. Automatic distribution of java byte-code based on dependence analysis. Technical Report Technical Report No. 03-18, School of Information and Computer Science, University of California, Irvine, October 2003.
    • (2003) Technical Report Technical Report No. 03-18 , vol.3 , Issue.18
    • Diaconescu, R.E.1    Wang, L.2    Franz, M.3
  • 4
    • 84948464271 scopus 로고    scopus 로고
    • Efficient global object space support for distributed jvm on cluster
    • Vancouver, Canada, August
    • W. Fang, C.-L. Wang, and F. Lau. Efficient global object space support for distributed jvm on cluster. In International Conference on Parallel Processing, Vancouver, Canada, August 2002.
    • (2002) International Conference on Parallel Processing
    • Fang, W.1    Wang, C.-L.2    Lau, F.3
  • 8
    • 84976813879 scopus 로고
    • Compiling Fortran D for MIMD distributed-memory machines
    • S. Hiranandani, K. Kennedy, and C.-W. Tseng. Compiling Fortran D for MIMD distributed-memory machines. Communications of the ACM, 35(8):66-80, 1992.
    • (1992) Communications of the ACM , vol.35 , Issue.8 , pp. 66-80
    • Hiranandani, S.1    Kennedy, K.2    Tseng, C.-W.3
  • 12
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • February
    • B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291-307, February 1970.
    • (1970) The Bell System Technical Journal , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 13
    • 0026231040 scopus 로고
    • Compiling global name-space parallel loops for distributed execution
    • October
    • C. Koelbel and P. Mehrotra. Compiling global name-space parallel loops for distributed execution. IEEE Transactions on Parallel and Distributed Systems, 2(4):440-451, October 1991.
    • (1991) IEEE Transactions on Parallel and Distributed Systems , vol.2 , Issue.4 , pp. 440-451
    • Koelbel, C.1    Mehrotra, P.2
  • 16
    • 0029345191 scopus 로고
    • ANTLR: A predicated-LL(k) parser generator
    • T. J. Parr and R. W. Quong. ANTLR: A predicated-LL(k) parser generator. Software Practice and Experience, 25(7):789-810, 1995.
    • (1995) Software Practice and Experience , vol.25 , Issue.7 , pp. 789-810
    • Parr, T.J.1    Quong, R.W.2
  • 21
    • 84944050946 scopus 로고    scopus 로고
    • J-orchestra: Automatic Java application partitioning
    • ECOOP 2002 - Object-Oriented Programming: 16th European Conference Malaga, Spain. Springer-Verlag, June
    • E. Tilevich and Y. Smaragdakis. J-orchestra: Automatic Java application partitioning. In ECOOP 2002 - Object-Oriented Programming: 16th European Conference Malaga, Spain, volume 2374/2002 of Lecture Notes in Computer Science, pages 178-204. Springer-Verlag, June 2002.
    • (2002) Lecture Notes in Computer Science , vol.2374 , Issue.2002 , pp. 178-204
    • Tilevich, E.1    Smaragdakis, Y.2


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