메뉴 건너뛰기




Volumn 44, Issue 10, 2009, Pages 227-241

The design of a task parallel library

Author keywords

Domain specific languages; Parallelism; Work stealing

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

EID: 70350660787     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1639949.1640106     Document Type: Conference Paper
Times cited : (98)

References (34)
  • 7
    • 0000269759 scopus 로고    scopus 로고
    • Scheduling multithreaded computations by work stealing
    • September
    • Robert D. Blumofe and Charles E. Leiserson. Scheduling multithreaded computations by work stealing. Journal of the ACM, 46(5):720-748, September 1999.
    • (1999) Journal of the ACM , vol.46 , Issue.5 , pp. 720-748
    • Blumofe, R.D.1    Leiserson, C.E.2
  • 14
    • 84945709358 scopus 로고
    • Solution of a problem in concurrent programming control.
    • E. W. Dijkstra. Solution of a problem in concurrent programming control. Commun. ACM, 8(9):569, 1965.
    • (1965) Commun. ACM , vol.8 , Issue.9 , pp. 569
    • Dijkstra, E.W.1
  • 16
    • 0029194918 scopus 로고
    • The semantics of future and its use in program optimization
    • Cormac Flanagan and Matthias Felleisen. The semantics of future and its use in program optimization. In Rice University, pages 209-220, 1995.
    • (1995) Rice University , pp. 209-220
    • Flanagan, C.1    Felleisen, M.2
  • 21
    • 0001082611 scopus 로고    scopus 로고
    • Building domain-specific embedded languages.
    • Paul Hudak. Building domain-specific embedded languages. ACM Comput. Surv., page 196, 1996.
    • (1996) ACM Comput. Surv. , pp. 196
    • Hudak, P.1
  • 23
    • 0034593391 scopus 로고    scopus 로고
    • A java fork/join framework
    • Doug Lea. A java fork/join framework. In Java Grande, pages 36-43, 2000.
    • (2000) Java Grande , pp. 36-43
    • Lea, D.1
  • 25
    • 70350653883 scopus 로고    scopus 로고
    • Microsoft., June, URL
    • Microsoft. Parallel extensions to .NET. June 2008. URL http://msdn.microsoft.com/en-us/concurrency.
    • (2008) Parallel Extensions to .NET.
  • 28
    • 12844269813 scopus 로고    scopus 로고
    • Transparent proxies for java futures
    • ISSN 0362-1340
    • Polyvios Pratikakis, Jaime Spacco, and Michael Hicks. Transparent proxies for java futures. SIGPLAN Not., 39 (10):206-223, 2004. ISSN 0362-1340.
    • (2004) SIGPLAN Not. , vol.39 , Issue.10 , pp. 206-223
    • Pratikakis, P.1    Spacco, J.2    Hicks, M.3
  • 29
    • 0013398077 scopus 로고    scopus 로고
    • PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May
    • Keith H. Randall. Cilk: Efficient Multithreaded Computing. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1998.
    • (1998) Cilk: Efficient Multithreaded Computing
    • Randall, K.H.1
  • 30
    • 2742588484 scopus 로고
    • Formal specification of memory models.
    • Xerox Palo Alto Research Center, December
    • Pradeep S. Sindhu, Jean-Marc Frailong, and Michel Cekleov. Formal specification of memory models. Technical Report CSL-91-11, Xerox Palo Alto Research Center, December 1991.
    • (1991) Technical Report CSL-91-11
    • Sindhu, P.S.1    Frailong, J.-M.2    Cekleov, M.3
  • 32
    • 0032681940 scopus 로고    scopus 로고
    • Stackthreads/ mp: Integrating futures into calling standards
    • Kenjiro Taura, Kunio Tabata, and Akinori Yonezawa. Stackthreads/ mp: integrating futures into calling standards. SIGPLAN Not., 34(8):60-71, 1999.
    • (1999) SIGPLAN Not. , vol.34 , Issue.8 , pp. 60-71
    • Taura, K.1    Tabata, K.2    Yonezawa, A.3
  • 33
    • 70350694356 scopus 로고
    • Performance of a class of highlyparallel divide-and-conquer algorithms
    • California Institute of Technology
    • John Thornley. Performance of a class of highlyparallel divide-and-conquer algorithms. Technical Report 1995.cs-tr-95-10, California Institute of Technology, 1995.
    • (1995) Technical Report 1995.cs-tr-95-10
    • Thornley, J.1


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