메뉴 건너뛰기




Volumn 1745 LNCS, Issue , 1999, Pages 125-129

Tiling and processors allocation for three dimensional iteration space

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED MEMORY MACHINES; GRID ARCHITECTURES; ITERATION SPACES; KNAPSACK PROBLEMS; NON-UNIFORM; NUMERICAL EXPERIMENTS; PROCESSORS ALLOCATION;

EID: 84877964470     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46642-0_18     Document Type: Conference Paper
Times cited : (2)

References (10)
  • 3
    • 0026274706 scopus 로고
    • Tiling multidimentional iteration spaces for non shared-memory machines
    • Ramanujam, J., Sadayappan, P.: Tiling Multidimentional Iteration Spaces for Non Shared-Memory Machines. Supercomputing 91.(1991) 111-120
    • (1991) Supercomputing , vol.91 , pp. 111-120
    • Ramanujam, J.1    Sadayappan, P.2
  • 9
    • 70350749986 scopus 로고    scopus 로고
    • Optimal orthogonal tile
    • September
    • Andonov, R., Rajopadhye, S., Yanev, N.: Optimal Orthogonal Tile. in Europar'98, pages 480-490, September 1998.
    • (1998) Europar'98 , pp. 480-490
    • Andonov, R.1    Rajopadhye, S.2    Yanev, N.3
  • 10
    • 0001889296 scopus 로고
    • Methods for the solution of the Multidimensional 0-1 Knapsack problem
    • Weingartner, H.M. Ness, D.N.: Methods for the solution of the Multidimensional 0-1 Knapsack problem." Operations Research. (1967)15(1), 83-103.
    • (1967) Operations Research , vol.15 , Issue.1 , pp. 83-103
    • Weingartner, H.M.1    Ness, D.N.2


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