• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Cilk: An Efficient Multithreaded Runtime System (1995)

Cached

  • Download as a PDF

Download Links

  • [www.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [pages.cs.wisc.edu]
  • [www.ece.cmu.edu]
  • [www.lcs.mit.edu]
  • [publications.csail.mit.edu]
  • [www.lcs.mit.edu]
  • [supertech.csail.mit.edu]
  • [supertech.csail.mit.edu]
  • [www.cag.lcs.mit.edu]
  • [ftp.lcs.mit.edu]
  • [people.cs.umass.edu]
  • [people.cs.umass.edu]
  • [www.cs.utexas.edu]
  • [bradley.csail.mit.edu]
  • [theory.lcs.mit.edu]
  • [people.csail.mit.edu]
  • [supertech.csail.mit.edu]
  • [supertech.csail.mit.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Robert D. Blumofe , Christopher F. Joerg , Bradley C. Kuszmaul , Charles E. Leiserson , Keith H. Randall , Yuli Zhou
Citations:762 - 33 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Blumofe95cilk:an,
    author = {Robert D. Blumofe and Christopher F. Joerg and Bradley C. Kuszmaul and Charles E. Leiserson and Keith H. Randall and Yuli Zhou},
    title = { Cilk: An Efficient Multithreaded Runtime System},
    year = {1995}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Cilk (pronounced “silk”) is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the “work” and “critical path ” of a Cilk computation can be used to accurately model performance. Consequently, a Cilk programmer can focus on reducing the work and critical path of his computation, insulated from load balancing and other rtmtime scheduling issues. We also prove that for the class of “fully strict ” (well-structured) programs, the Cilk scheduler achieves space, time, and communication bounds all within a constant factor of optimal. The Cilk rmrtime system currently runs on the Connection Machine CM5 MPP, the Intel Paragon MPP, the Silicon Graphics Power Challenge SMP, and the MIT Phish network of workstations. Applications written in Cilk include protein folding, graphic rendering, backtrack search, and the *Socrates chess program, which won third prize in the 1994 ACM International Computer Chess Championship.

Keyphrases

abstract cilk    efficient multithreaded runtime system    critical path    cilk work-stealing scheduler    mit phish network    third prize    load balancing    silicon graphic power challenge smp    protein folding    constant factor    multithreaded parallel programming    connection machine cm5 mpp    backtrack search    cilk scheduler achieves space    intel paragon mpp    pronounced silk    socrates chess program    cilk programmer    cilk computation    c-based runtime system    cilk rmrtime system    communication bound    acm international computer chess championship    synthetic application    graphic rendering   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University