The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
The implementation of the Cilk-5 multithreaded language
Open accessAbstract
The fifth release of the multithreaded language Cilk uses a provably good "work-stealing" scheduling algorithm similar to the first system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided by a clear strategy that arose from a theoretical analysis of the scheduling algorithm: concentrate on minimizing overheads that contribute to the work, even at the expense of overheads that contribute to the critical path. Although it may seem counterintuitive to move overheads onto the critical path, this "work-first" principle has led to a portable Cilk-5 implementation in which the typical cost of spawning a parallel thread is only between 2 and 6 times the cost of a C function call on a variety of contemporary machines. Many Cilk programs run on one processor with virtually no degradation compared to equivalent C programs. This paper describes how the work-first principle was exploited in the design of Cilk-5's compiler and its runtime system. In particular, we present Cilk-5's novel "two-clone" compilation strategy and its Dijkstra-like mutual-exclusion protocol for implementing the ready deque in the work-stealing scheduler.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
Lamport (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675439 · Cited by 2,519
Bounds on Multiprocessing Timing Anomalies
Graham, R. L. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117039 · Cited by 2,443
Scheduling multithreaded computations by work stealing
Blumofe, R. D., & Leiserson, C. E. (1999) · Journal of the ACM · doi:10.1145/324133.324234 · Cited by 1,336
Self-citationMULTILISP: a language for concurrent symbolic computation
Halstead, R. H. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/4472.4478 · Cited by 1,073
The Parallel Evaluation of General Arithmetic Expressions
Brent, R. P. (1974) · Journal of the ACM · doi:10.1145/321812.321815 · Cited by 814
Cilk: An Efficient Multithreaded Runtime System
Blumofe, R. D., Joerg, C. F., Kuszmaul, B. C., Leiserson, C. E., Randall, K. H., & Zhou, Y. (1996) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1996.0107 · Cited by 784
Self-citationSolution of a problem in concurrent programming control
Dijkstra, E. (1965) · Communications of the ACM · doi:10.1145/365559.365617 · Cited by 749
Department of electrical engineering and computer science
Sarrafzadeh, M. (1990) · ACM SIGDA Newsletter · doi:10.1145/378886.380416 · Cited by 327
Lazy task creation: a technique for increasing the granularity of parallel programs
Mohr, E., Kranz, D. A., & Halstead, R. H. (1991) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.86103 · Cited by 307
Detecting data races in Cilk programs that use locks
Cheng, G.-I., Feng, M. D., Leiserson, C. E., Randall, K. H., & Stark, A. F. (1998) · ACM Symposium on Parallel Algorithms and Architectures (SPAA) · doi:10.1145/277651.277696 · Cited by 148
Self-citationEfficient detection of determinacy races in Cilk programs
Feng, M. D., & Leiserson, C. E. (1997) · ACM Symposium on Parallel Algorithms and Architectures (SPAA) · doi:10.1145/258492.258493 · Cited by 117
Self-citation
Cited by
(2013) · The Journal of Supercomputing · doi:10.1007/11227.1573-0484 · Cited by 276
PaSh: light-touch data-parallel shell processing
Vasilakis, N., Kallas, K., Mamouras, K., Benetopoulos, A., & Cvetković, L. (2021) · Proceedings of the Sixteenth European Conference on Computer Systems · doi:10.1145/3447786.3456228 · Cited by 17
Metadata
- Authors
- Frigo, M., Leiserson, C. E., & Randall, K. H.
- Venue
- ACM SIGPLAN Notices
- Published
- 1998-05
- Volume
- 33
- Issue
- 5
- Pages
- 212-223
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W4234858060
- Cited by
- 290
- References
- 13
- FWCI
- 2.34
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.