메뉴 건너뛰기




Volumn 39, Issue 4, 2004, Pages 442-444

A data locality optimizing algorithm

Author keywords

[No Author keywords available]

Indexed keywords

DATA LOCALITY; OPTIMIZING ALGORITHM; PARALLELIZATION PROBLEM;

EID: 3142679577     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/989393.989437     Document Type: Conference Paper
Times cited : (23)

References (9)
  • 2
    • 0026109335 scopus 로고
    • Dataflow analysis of scalar and array references
    • February
    • P. Feautrier. Dataflow analysis of scalar and array references.Journal of Parallel and Distributed Computing, 20(1):23-53, February 1991.
    • (1991) Journal of Parallel and Distributed Computing , vol.20 , Issue.1 , pp. 23-53
    • Feautrier, P.1
  • 5
    • 0032067773 scopus 로고    scopus 로고
    • Maximizing parallelism and minimizing synchronization with affine partitions
    • May
    • A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing, 24(3-4):445-475, May 1998.
    • (1998) Parallel Computing , vol.24 , Issue.3-4 , pp. 445-475
    • Lim, A.W.1    Lam, M.S.2
  • 9
    • 0026232450 scopus 로고
    • A loop transformation theory and an algorithm to maximize parallelism
    • October
    • M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. Transactions on Parallel and Distributed Systems, 2(4):452-470, October 1991.
    • (1991) Transactions on Parallel and Distributed Systems , vol.2 , Issue.4 , pp. 452-470
    • Wolf, M.E.1    Lam, M.S.2


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