메뉴 건너뛰기




Volumn 19, Issue 3, 1990, Pages 225-250

Synchronization barrier and related tools for shared memory parallel programming

Author keywords

binary tree; parallel maximization; Parallel processing; reduction; shared memory

Indexed keywords


EID: 34249954086     PISSN: 08857458     EISSN: 15737640     Source Type: Journal    
DOI: 10.1007/BF01407956     Document Type: Article
Times cited : (13)

References (10)
  • 1
    • 84935091572 scopus 로고    scopus 로고
    • A. Osterhaug, Guide to Parallel Programming on Sequent Computer Systems, Sequent Computer Systems, Inc. (1987).
  • 3
    • 84935059622 scopus 로고    scopus 로고
    • B. D. Lubachevsky, Verification of several parallel coordination programs based on descriptions of their reachability sets. Ultracomputer Note 33, Courant Institute, New York University, (July 1981).
  • 4
    • 84935063154 scopus 로고    scopus 로고
    • L. Rudolph, Software structures for ultraparallel computing, Ph.D. Thesis, New York University (1981).
  • 8
    • 84935127245 scopus 로고    scopus 로고
    • D. Hensgen, R. Finkel, and U. Manber, Two algorithms for barrier synchronization, Int'l. J. Parallel Programming, Vol. 17, No. 1, (1988).


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