The Cilk++ concurrency platform
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
The availability of multicore processors across a wide range of computing platforms has created a strong demand for software frameworks that can harness these resources. This paper overviews the Cilk++ programming environment, which incorporates a compiler, a runtime system, and a race-detection tool. The Cilk++ runtime system guarantees to load-balance computations effectively. To cope with legacy codes containing global variables, Cilk++ provides a "hyperobject" library which allows races on nonlocal variables to be mitigated without lock contention or substantial code restructuring.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Stroustrup, B. (1985) · Cited by 4,409
Validity of the single processor approach to achieving large scale computing capabilities
Amdahl, G. M. (1967) · Proceedings of the April 18-20, 1967, spring joint computer conference on - AFIPS '67 (Spring) · doi:10.1145/1465482.1465560 · Cited by 4,339
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065034 · Cited by 3,180
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065034 · Cited by 2,310
Introduction to Algorithms, third edition
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009) · Cited by 2,309
Self-citationKernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
Bounds for Certain Multiprocessing Anomalies
Graham, R. L. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb01709.x · Cited by 1,647
Eraser: a dynamic data race detector for multithreaded programs
Savage, S., Burrows, M., Nelson, G., Sobalvarro, P., & Anderson, T. (1997) · ACM Transactions on Computer Systems · doi:10.1145/265924.265927 · Cited by 1,572
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-citationThe C++ programming language (2nd ed.)
Stroustrup, B. (1991) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 859
The Parallel Evaluation of General Arithmetic Expressions
Brent, R. P. (1974) · Journal of the ACM · doi:10.1145/321812.321815 · Cited by 814
Efficient, transparent, and comprehensive runtime code manipulation
Bruening, D. L., & Amarasinghe, S. P. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 439
Speedup versus efficiency in parallel systems
Eager, D. L., Zahorjan, J., & Lazowska, E. D. (1989) · IEEE Transactions on Computers · doi:10.1109/12.21127 · Cited by 437
Eraser: a dynamic data race detector for multi-threaded programs
Savage, S., Burrows, M. T., Nelson, G., Sobalvarro, P. G., & Anderson, T. E. (1997) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/268998.266641 · Cited by 237
On-the-fly detection of data races for programs with nested fork-join parallelism
Mellor-Crummey, J. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125861 · Cited by 229
Detecting access anomalies in programs with critical sections
Dinning, A., & Schonberg, E. (1991) · Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging · doi:10.1145/122759.122767 · Cited by 190
An empirical comparison of monitoring algorithms for access anomaly detection
Dinning, A., & Schonberg, E. (1990) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/99163.99165 · Cited by 165
An empirical comparison of monitoring algorithms for access anomaly detection
Dinning, A., & Schonberg, E. (1990) · ACM SIGPLAN Notices · doi:10.1145/99164.99165 · Cited by 164
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-citationA mechanism for efficient debugging of parallel programs
Miller, B. P., & Choi, J.-D. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54004 · Cited by 138
Efficient 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-citationOnline data-race detection via coherency guarantees
Perkovic, D., & Keleher, P. J. (1996) · Operating Systems Design and Implementation · doi:10.1145/238721.238760 · Cited by 91
A mechanism for efficient debugging of parallel programs
Miller, B. P., & Choi, J.-D. (1988) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/53990.54004 · Cited by 86
Metadata
- Authors
- Leiserson, C. E.
- Venue
- Proceedings of the 46th Annual Design Automation Conference
- Publisher
- ACM
- Published
- 2009-07-26
- Pages
- 522-527
- ISSN
- 0738-100X (ISSN-L)
- OpenAlex
- W2084423328
- Cited by
- 178
- References
- 25
- FWCI
- 13.72
- Type
- conference paper
- Language
- en
- Open access
- closed
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.