.png){kind=icon}
Return
Cilk: An efficient multithreaded runtime system
.png){kind=icon}
OA
AI
DOI：10.1006/jpdc.1996.0107.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 length'' of a Cilk computation can be used to model performance accurately. Consequently, a Cilk programmer can focus on reducing the computation's work and critical-path length, insulated from load balancing and other runtime 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 runtime system currently runs on the Connection Machine CM5 MPP, the Intel Paragon MPP, the Sun Sparcstation SMP, and the Cilk-NOW network of workstations. Applications written in Cilk include protein folding, graphic rendering, backtrack search, and the star Socrates chess program, which won second prize in the 1995 ICCA World Computer Chess Championship. (C) 1996 Academic Press, Inc.
Keywords:
PARALLEL ALGORITHMS
LANGUAGE
COMPUTATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
No cited papers available