The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Cilk: an efficient multithreaded runtime system
Open accessAbstract
Cilk (pronounced “silk”) is a C-based runtime system for multi-threaded 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 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.
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
Bounds on Multiprocessing Timing Anomalies
Graham, R. L. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117039 · Cited by 2,443
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
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-citationPVM: A framework for parallel distributed computing
Sunderam, V. S. (1990) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330020404 · Cited by 1,170
MULTILISP: 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
Hillis, W. D., & Steele, G. L. (1986) · Communications of the ACM · doi:10.1145/7902.7903 · Cited by 899
The Parallel Evaluation of General Arithmetic Expressions
Brent, R. P. (1974) · Journal of the ACM · doi:10.1145/321812.321815 · Cited by 814
Parallel Algorithms for Shared-Memory Machines
Karp, R. M., & Ramachandran, V. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50022-9 · Cited by 687
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365747 · Cited by 593
Proceedings of the 1999 International Conference on Parallel Processing
(1999) · doi:10.1109/icpp.1999 · Cited by 441
Cited by
Cyber Physical Systems: Design Challenges
Lee, E. A. (2008) · 2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC) · doi:10.1109/isorc.2008.25 · Cited by 3,525
System architecture directions for networked sensors
Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D., & Pister, K. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.356998 · Cited by 3,084
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 · doi:10.1145/1272996.1273005 · Cited by 2,432
FFTW: an adaptive software architecture for the FFT
Frigo, M., & Johnson, S. G. (2002) · Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181) · doi:10.1109/icassp.1998.681704 · Cited by 1,801
Scaling read aligners to hundreds of threads on general-purpose processors
Langmead, B., Wilks, C., Antonescu, V., & Charles, R. (2019) · Bioinformatics · doi:10.1093/bioinformatics/bty648 · Cited by 942
Yu, Y., Isard, M., Fetterly, D., Budiu, M., Erlingsson, Ú., Gunda, P. K., & Currey, J. (2008) · doi:10.5555/1855741.1855742 · Cited by 689
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1272998.1273005 · Cited by 556
Memory---Sequoia: programming the memory hierarchy
Fatahalian, K., Dally, W. J., Hanrahan, P., Horn, D. R., Knight, T. J., Leem, L., Houston, M., Park, J. Y., Erez, M., Ren, M., et al. (2006) · Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06 · doi:10.1145/1188455.1188543 · Cited by 452
The tao of parallelism in algorithms
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., et al. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993501 · Cited by 312
A catalog of stream processing optimizations
Hirzel, M., Soulé, R., Schneider, S., Gedik, B., & Grimm, R. (2014) · ACM Computing Surveys · doi:10.1145/2528412 · Cited by 299
A type and effect system for deterministic parallel Java
Bocchino, R. L., Adve, V. S., Dig, D., Adve, S. V., Heumann, S., Komuravelli, R., Overbey, J., Simmons, P., Sung, H., & Vakilian, M. (2009) · ACM SIGPLAN Notices · doi:10.1145/1639949.1640097 · Cited by 295
A type and effect system for deterministic parallel Java
Bocchino, R. L., Adve, V. S., Dig, D., Adve, S. V., Heumann, S., Komuravelli, R., Overbey, J., Simmons, P., Sung, H., & Vakilian, M. (2009) · Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications · doi:10.1145/1640089.1640097 · Cited by 265
“Ef.cient detection of determinacy races in Cilk programs.”
MethodInfluentialPiccolo: building fast, distributed programs with partitioned tables
Power, R., & Li, J. (2010) · doi:10.5555/1924943.1924964 · Cited by 252
Phasers: a unified deadlock-free construct for collective and point-to-point synchronization
Shirako, J., Peixotto, D. M., Sarkar, V., & Scherer, W. N. (2008) · Proceedings of the 22nd annual international conference on Supercomputing · doi:10.1145/1375527.1375568 · Cited by 124
Automatic parallelization of divide and conquer algorithms
Rugina, R., & Rinard, M. (1999) · Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/301104.301111 · Cited by 103
“This approach typically generates more than enough concurrency to keep the machine busy [3].”
BackgroundMethodA monad for deterministic parallelism
Marlow, S., Newton, R., & Peyton Jones, S. (2011) · Proceedings of the 4th ACM symposium on Haskell · doi:10.1145/2034675.2034685 · Cited by 98
(2008) · Cited by 47
Automatic Parallelization of Recursive Procedures
Gupta, M., Mukhopadhyay, S., & Sinha, N. (2000) · International Journal of Parallel Programming · doi:10.1023/a:1007560600904 · Cited by 44
“Several other systems, such as Cilk [2] and the Multilisp language [17] provide run-time support to exploit parallelism between recursive calls.”
Background
Metadata
- Authors
- Blumofe, R. D., Joerg, C. F., Kuszmaul, B. C., Leiserson, C. E., Randall, K. H., & Zhou, Y.
- Venue
- Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
- Publisher
- ACM
- Published
- 1995-08
- Pages
- 207-216
- OpenAlex
- W2104861744
- Cited by
- 1,021
- References
- 16
- FWCI
- 21.02
- Type
- conference paper
- 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.