The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The Design of OpenMP Tasks
Open accessAbstract
OpenMP has been very successful in exploiting structured parallelism in applications. With increasing application complexity, there is a growing need for addressing irregular parallelism in the presence of complicated control structures. This is evident in various efforts by the industry and research communities to provide a solution to this challenging problem. One of the primary goals of OpenMP 3.0 is to define a standard dialect to express and efficiently exploit unstructured parallelism. This paper presents the design of the OpenMP tasking model by members of the OpenMP 3.0 tasking sub-committee which was formed for this purpose. The paper summarizes the efforts of the sub-committee (spanning over two years) in designing, evaluating and seamlessly integrating the tasking model into the OpenMP specification. In this paper, we present the design goals and key features of the tasking model, including a rich set of examples and an in-depth discussion of the rationale behind various design choices. We compare a prototype implementation of the tasking model with existing models, and evaluate it on a wide range of applications. The comparison shows that the OpenMP tasking model provides expressiveness, flexibility, and huge potential for performance and scalability.
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
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Intel Threading Building Blocks
Kukanov, A. (2015) · Programming Models for Parallel Computing · doi:10.7551/mitpress/9486.003.0016 · Cited by 521
Intel threading building blocks
PheattChuck (2008) · Journal of computing sciences in colleges · doi:10.5555/1352079.1352134 · Cited by 373
The cascade high productivity language
Callahan, D. P., Chamberlain, B. L., & Zima, H. P. (2004) · doi:10.1109/hips.2004.1299190 · Cited by 152
A framework for exploiting task and data parallelism on distributed memory multicomputers
Ramaswamy, S. M., Sapatnekar, S. S., & Banerjee, P. (1997) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.642945 · Cited by 101
Implementing Linear Algebra Routines on Multi-core Processors with Pipelining and a Look Ahead
Jakub Kurzak, A., & Dongarra, J. J. (2007) · Springer eBooks · doi:10.1007/978-3-540-75755-9_18 · Cited by 59
Efficient Procedures for Using Matrix Algorithms
Fischer, P. C., & Probert, R. L. (1974) · Lecture notes in computer science · doi:10.1007/978-3-662-21545-6_31 · Cited by 36
OpenMP parallelization of agent-based models
Massaioli, F., Castiglione, F., & Bernaschi, M. (2005) · Parallel Computing · doi:10.1016/j.parco.2005.03.012 · Cited by 36
Self-citationTlib—a library to support programming with hierarchical multi-processor tasks
Rauber, T., & Rünger, G. (2005) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2004.10.006 · Cited by 35
Metadata
- Authors
- Ayguade, E., Copty, N., Duran, A., Hoeflinger, J., Lin, Y., Massaioli, F., Teruel, X., Unnikrishnan, P., & Zhang, G.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2009-03
- Volume
- 20
- Issue
- 3
- Pages
- 404-418
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2108801243
- Cited by
- 397
- References
- 9
- FWCI
- 50.64
- Type
- journal article
- Language
- en
- Open access
- green
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: The Design of OpenMP Tasks. https://app.cochat.ai/papers/10.1109/tpds.2008.105
- The paper
- Ayguade, E., Copty, N., Duran, A., Hoeflinger, J., Lin, Y., Massaioli, F., Teruel, X., Unnikrishnan, P., & Zhang, G. (2009). The Design of OpenMP Tasks. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2008.105
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.