메뉴 건너뛰기




Volumn 28, Issue 14, 1998, Pages 1493-1517

Strategies and protocols for highly parallel linda servers

Author keywords

Linda; Locality; Massively parallel architectures; Multiple tuple spaces; Scalability

Indexed keywords

CONSTRAINT THEORY; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; TRANSPUTERS;

EID: 0032290464     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-024X(19981210)28:14<1493::AID-SPE211>3.0.CO;2-5     Document Type: Article
Times cited : (9)

References (8)
  • 2
    • 0025559241 scopus 로고
    • Architecture-independent parallel computation
    • D. B. Skillicom, 'Architecture-independent parallel computation', IEEE Computer, 23(12), 38-50 (1990).
    • (1990) IEEE Computer , vol.23 , Issue.12 , pp. 38-50
    • Skillicom, D.B.1
  • 3
    • 0026204689 scopus 로고
    • Distributed shared memory: A survey of issues and algorithms
    • B. Nitzberg and V. Lo, 'Distributed shared memory: A survey of issues and algorithms', IEEE Computer, 24(8), 52-60 (1991).
    • (1991) IEEE Computer , vol.24 , Issue.8 , pp. 52-60
    • Nitzberg, B.1    Lo, V.2
  • 5
    • 84976215953 scopus 로고
    • Coordination languages and their significance
    • D. Gelernter and N. Carriero, 'Coordination languages and their significance', Communications of the ACM, 35(2), 96-107 (1992).
    • (1992) Communications of the ACM , vol.35 , Issue.2 , pp. 96-107
    • Gelernter, D.1    Carriero, N.2
  • 6
    • 0028383543 scopus 로고
    • The efficiency of Linda for general purpose scientific programming
    • T. G. Mattson, 'The efficiency of Linda for general purpose scientific programming', Scientific Programming, 3(1), 61-71 (1994).
    • (1994) Scientific Programming , vol.3 , Issue.1 , pp. 61-71
    • Mattson, T.G.1


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