메뉴 건너뛰기




Volumn 44, Issue 1, 1997, Pages 24-34

Random data accesses on a coarse-grained parallel machine II. One-to-many and many-to-one mappings

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0004865129     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1315     Document Type: Article
Times cited : (7)

References (29)
  • 7
    • 0023346637 scopus 로고
    • Deadlock-free message routing in multiprocessor interconnection networks
    • Dally W. J., Seitz C. L. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. 36:May 1987;547-553.
    • (1987) IEEE Trans. Comput. , vol.36 , pp. 547-553
    • Dally, W.J.1    Seitz, C.L.2
  • 10
    • 0000016281 scopus 로고
    • A practical hierarchical model of parallel computation. I. The model
    • Heywood T., Ranka S. A practical hierarchical model of parallel computation. I. The model. J. Parallel Distrib. Comput. 16:Nov. 1992;212-232.
    • (1992) J. Parallel Distrib. Comput. , vol.16 , pp. 212-232
    • Heywood, T.1    Ranka, S.2
  • 11
    • 44049112023 scopus 로고
    • A practical hierarchical model of parallel computation. II. Binary tree and FFT graph algorithms
    • Heywood T., Ranka S. A practical hierarchical model of parallel computation. II. Binary tree and FFT graph algorithms. J. Parallel Distrib. Comput. 16:Nov. 1992;233-249.
    • (1992) J. Parallel Distrib. Comput. , vol.16 , pp. 233-249
    • Heywood, T.1    Ranka, S.2
  • 18
    • 84943681390 scopus 로고
    • A survey of wormhole routing techniques in direct networks
    • Ni L. M., McKinley P. K. A survey of wormhole routing techniques in direct networks. IEEE Comput. 26:Feb. 1993;62-76.
    • (1993) IEEE Comput. , vol.26 , pp. 62-76
    • Ni, L.M.1    McKinley, P.K.2
  • 19
    • 0039490335 scopus 로고
    • Parallel remapping algorithms for adaptive problems
    • C.-W. Ou, S. Ranka, 1995, Parallel remapping algorithms for adaptive problems, Frontiers '95.
    • (1995) Frontiers '95
    • Ou, C.-W.1    Ranka, S.2
  • 20
    • 0028733840 scopus 로고
    • Parallel incremental graph partitioning using linear programming
    • November
    • C.-W. Ou, S. Ranka, November 1994, Parallel incremental graph partitioning using linear programming, Supercomputing '94.
    • (1994) Supercomputing '94
    • Ou, C.-W.1    Ranka, S.2
  • 23
    • 0019530318 scopus 로고
    • Data broadcasting in SIMD computers
    • Nassimi D., Sahni S. Data broadcasting in SIMD computers. IEEE Trans. Comput. C-30:1981;101-107.
    • (1981) IEEE Trans. Comput. , vol.C-30 , pp. 101-107
    • Nassimi, D.1    Sahni, S.2
  • 26
    • 0004899481 scopus 로고    scopus 로고
    • Random data accesses on a coarse-grained parallel machine. I. One-to-one mappings
    • Shankar R. V., Ranka S. Random data accesses on a coarse-grained parallel machine. I. One-to-one mappings. J. Parallel Distrib. Comput. 44:1997.
    • (1997) J. Parallel Distrib. Comput. , vol.44
    • Shankar, R.V.1    Ranka, S.2
  • 28
    • 0025467711 scopus 로고
    • A bridging model for parallel computation
    • Valiant L. G. A bridging model for parallel computation. Comm. ACM. 2:1990;103-111.
    • (1990) Comm. ACM , vol.2 , pp. 103-111
    • Valiant, L.G.1


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