메뉴 건너뛰기




Volumn , Issue , 2005, Pages 21-28

Dynamic circular work-stealing deque

Author keywords

Deque; Load balancing; Lock free; Work stealing

Indexed keywords

ALGORITHMS; MULTIPROGRAMMING; SYNCHRONIZATION;

EID: 32144435090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073974     Document Type: Conference Paper
Times cited : (186)

References (9)
  • 2
    • 0035608253 scopus 로고    scopus 로고
    • Thread scheduling for multiprogrammed multiprocessors
    • ARORA, N. S., BLUMOFE, R. D., AND PLAXTON, C. G. Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems 34, 2 (2001), 115-144.
    • (2001) Theory of Computing Systems , vol.34 , Issue.2 , pp. 115-144
    • Arora, N.S.1    Blumofe, R.D.2    Plaxton, C.G.3
  • 3
    • 0000269759 scopus 로고    scopus 로고
    • Scheduling multithreaded computations by work stealing
    • BLUMOFE, R. D., AND LEISERSON, C. E. Scheduling multithreaded computations by work stealing. Journal of the ACM 46, 5 (1999), 720-748.
    • (1999) Journal of the ACM , vol.46 , Issue.5 , pp. 720-748
    • Blumofe, R.D.1    Leiserson, C.E.2
  • 5
    • 35048872392 scopus 로고    scopus 로고
    • A dynamic-sized nonblocking work stealing deque
    • October Springer-Verlag Heidelberg, An improved version of this paper is in preparation for journal submission; please contact levyossi@cs.brown.edu
    • HENDLER, D., LEV, Y., AND SHAVIT, N. A dynamic-sized nonblocking work stealing deque. In Proceedings of the 18th International Symposium on Distributed Computing (October 2004), vol. 3274, Springer-Verlag Heidelberg, pp. 188-200. An improved version of this paper is in preparation for journal submission; please contact levyossi@cs.brown.edu.
    • (2004) Proceedings of the 18th International Symposium on Distributed Computing , vol.3274 , pp. 188-200
    • Hendler, D.1    Lev, Y.2    Shavit, N.3
  • 7
    • 84947205091 scopus 로고    scopus 로고
    • The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures
    • January Springer-Verlag Heidelberg, An improved version of this paper is in preparation for journal submission; please contact authors
    • HERLIHY, M., LUCHANGCO, V., AND Mom, M. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. In Proceedings of the 16th International Symposium on Distributed Computing (January 2002), vol. 2508, Springer-Verlag Heidelberg, pp. 339-353. An improved version of this paper is in preparation for journal submission; please contact authors.
    • (2002) Proceedings of the 16th International Symposium on Distributed Computing , vol.2508 , pp. 339-353
    • Herlihy, M.1    Luchangco, V.2    Mom, M.3
  • 9
    • 0012525494 scopus 로고    scopus 로고
    • Programming parallel applications in cilk
    • LEISERSON, AND PLAAT. Programming parallel applications in cilk. SINEWS: SIAM News 31 (1998).
    • (1998) SINEWS: SIAM News , vol.31
    • Leiserson1    Plaat2


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