메뉴 건너뛰기




Volumn , Issue , 2009, Pages 45-53

Idempotent work stealing

Author keywords

Algorithms; Management; Performance

Indexed keywords

CRITICAL PATHS; GRAPH PROBLEMS; KEY COMPONENT; LOAD-BALANCING; MEMORY ACCESS; MEMORY ORDERING; PARALLELIZATION; PARALLELIZING; PERFORMANCE; RELAXED SEMANTICS;

EID: 67650093463     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1504176.1504186     Document Type: Conference Paper
Times cited : (72)

References (14)
  • 2
    • 23744452484 scopus 로고    scopus 로고
    • A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
    • DOI 10.1016/j.jpdc.2005.03.011, PII S0743731505000882
    • David A. Bader and Guojing Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). Journal of Parallel and Distributed Computing, 65(9):994-1006, September 2005. (Pubitemid 41119012)
    • (2005) Journal of Parallel and Distributed Computing , vol.65 , Issue.9 , pp. 994-1006
    • Bader, D.A.1    Cong, G.2
  • 3
    • 0242421951 scopus 로고    scopus 로고
    • Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs)
    • DOI 10.1006/jpdc.1999.1541, PII S0743731599915411
    • David A. Bader and Joseph J́aJ́a. SIMPLE: a methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs). Journal of Parallel and Distributed Computing, 58(1):92-108, July 1999. (Pubitemid 129595120)
    • (1999) Journal of Parallel and Distributed Computing , vol.58 , Issue.1 , pp. 92-108
    • Bader, D.A.1    Jaja, J.2
  • 6
    • 32144435090 scopus 로고    scopus 로고
    • Dynamic circular work-stealing deque
    • DOI 10.1145/1073970.1073974, SPAA 2005 - Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
    • David Chase and Yossi Lev. Dynamic circular work-stealing deque. In Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pages 21-28, July 2005. (Pubitemid 43206548)
    • (2005) Annual ACM Symposium on Parallelism in Algorithms and Architectures , pp. 21-28
    • Chase, D.1    Lev, Y.2
  • 10
    • 32844466488 scopus 로고    scopus 로고
    • A dynamic-sized nonblocking work stealing deque
    • DOI 10.1007/s00446-005-0144-5
    • Danny Hendler, Yossi Lev, Mark Moir, and Nir Shavit. A dynamicsized nonblocking work stealing deque. Distributed Computing, 18(3):189-207, 2006. (Pubitemid 43254037)
    • (2006) Distributed Computing , vol.18 , Issue.3 , pp. 189-207
    • Hendler, D.1    Lev, Y.2    Moir, M.3    Shavit, N.4


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