The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Lazy task creation: a technique for increasing the granularity of parallel programs
Abstract
When a parallel algorithm is written naturally, the resulting program often produces tasks of a finer grain than an implementation can exploit efficiently. Two solutions to the granularity problem that combine parallel tasks dynamically at runtime are discussed. The simpler load-based inlining method, in which tasks are combined based on dynamic bad level, is rejected in favor of the safer and more robust lazy task creation method, in which tasks are created only retroactively as processing results become available. The strategies grew out of work on Mul-T, an efficient parallel implementation of Scheme, but could be used with other languages as well. Mul-T implementations of lazy task creation are described for two contrasting machines, and performance statistics that show the method's effectiveness are presented. Lazy task creation is shown to allow efficient execution of naturally expressed algorithms of a substantially finer grain than possible with previous parallel Lisp systems.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Self-citationThe Manchester prototype dataflow computer
Gurd, J. R., Kirkham, C. C., & Watson, I. (1985) · Communications of the ACM · doi:10.1145/2465.2468 · Cited by 463
Agarwal, A. K., Lim, B.-H., Kranz, D. A., & Kubiatowicz, J. D. (1990) · ACM SIGARCH Computer Architecture News · doi:10.1145/325096.325119 · Cited by 291
Self-citationArvind, & Culler, D. E. (1986) · Annual Review of Computer Science · doi:10.1146/annurev.cs.01.060186.001301 · Cited by 259
Mul-T: a high-performance parallel Lisp
Kranz, D. A., Halstead, R. H., & Mohr, E. (1989) · Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation · doi:10.1145/73141.74825 · Cited by 159
Self-citationLazy task creation: a technique for increasing the granularity of parallel programs
Mohr, E., Kranz, D. A., & Halstead, R. H. (1990) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/91556.91631 · Cited by 154
Self-citationCompile-time partitioning and scheduling of parallel programs
Sarkar, V., & Hennessy, J. L. (1986) · doi:10.1145/12276.13313 · Cited by 139
Serial combinators: "optimal" grains of parallelism
Hudak, P., & Goldberg, B. (1985) · Lecture notes in computer science · doi:10.1007/3-540-15975-4_49 · Cited by 80
Compile-time partitioning and scheduling of parallel programs
Sarkar, V., & Hennessy, J. L. (1986) · ACM SIGPLAN Notices · doi:10.1145/13310.13313 · Cited by 42
An assessment of multilisp: Lessons from experience
(1986) · doi:10.1007/bf01407410 · Cited by 30
Cited by
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
ClearPath: highly parallel collision avoidance for multi-agent simulation
Guy, S. J., Chhugani, J., Kim, C., Satish, N., Lin, M., Manocha, D., & Dubey, P. (2009) · Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation · doi:10.1145/1599470.1599494 · Cited by 291
Sort vs. Hash revisited: fast join implementation on modern multi-core CPUs
Kim, C., Kaldewey, T., Lee, V. W., Sedlar, E., Nguyen, A. D., Satish, N., Chhugani, J., Di Blas, A., & Dubey, P. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687564 · Cited by 280
Welc, A., Jagannathan, S., & Hosking, A. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094845 · Cited by 181
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
Metadata
- Authors
- Mohr, E., Kranz, D. A., & Halstead, R. H.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 1991-07
- Volume
- 2
- Issue
- 3
- Pages
- 264-280
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2149663533
- Cited by
- 307
- References
- 10
- FWCI
- 15.93
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Lazy task creation: a technique for increasing the granularity of parallel programs. https://app.cochat.ai/papers/10.1109/71.86103
- The paper
- Mohr, E., Kranz, D. A., & Halstead, R. H. (1991). Lazy task creation: a technique for increasing the granularity of parallel programs. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/71.86103
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.