DMCA
Abstract Cilk: An Efficient Multithreaded Runtime System
BibTeX
@MISC{Blumofe_abstractcilk:,
author = {Robert D. Blumofe and Christopher F. Joerg and Bradley C. Kuszmaul and Charles E. Leiserson and Keith H. Randall and Yuli Zhou},
title = {Abstract Cilk: An Efficient Multithreaded Runtime System},
year = {}
}
Share
 |
 |
 |
 |
||
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. 1
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
