The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
StarPU: a unified platform for task scheduling on heterogeneous multicore architectures
Open accessAbstract
In the field of HPC, the current hardware trend is to design multiprocessor architectures featuring heterogeneous technologies such as specialized coprocessors (e.g. Cell/BE) or data‐parallel accelerators (e.g. GPUs). Approaching the theoretical performance of these architectures is a complex issue. Indeed, substantial efforts have already been devoted to efficiently offload parts of the computations. However, designing an execution model that unifies all computing units and associated embedded memory remains a main challenge. We therefore designed StarPU, an original runtime system providing a high‐level, unified execution model tightly coupled with an expressive data management library. The main goal of StarPU is to provide numerical kernel designers with a convenient way to generate parallel tasks over heterogeneous hardware on the one hand, and easily develop and tune powerful scheduling algorithms on the other hand. We have developed several strategies that can be selected seamlessly at run‐time, and we have analyzed their efficiency on several algorithms running simultaneously over multiple cores and a GPU. In addition to substantial improvements regarding execution times, we have obtained consistent superlinear parallelism by actually exploiting the heterogeneous nature of the machine. We eventually show that our dynamic approach competes with the highly optimized MAGMA library and overcomes the limitations of the corresponding static scheduling in a portable way. Copyright © 2010 John Wiley & Sons, Ltd.
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
Performance-effective and low-complexity task scheduling for heterogeneous computing
Topcuoglu, H., Hariri, S., & Wu, M.-Y. (2002) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.993206 · Cited by 3,475
A Survey of General‐Purpose Computation on Graphics Hardware
Owens, J. D., Luebke, D., Govindaraju, N., Harris, M., Krüger, J., Lefohn, A. E., & Purcell, T. J. (2007) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01012.x · Cited by 2,101
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/509058.509096 · Cited by 854
Benchmarking GPUs to tune dense linear algebra
Volkov, V. M., & Demmel, J. W. (2008) · doi:10.5555/1413370.1413402 · Cited by 701
A class of parallel tiled linear algebra algorithms for multicore architectures
Buttari, A., Langou, J., Kurzak, J., & Dongarra, J. (2009) · Parallel Computing · doi:10.1016/j.parco.2008.10.002 · Cited by 529
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Proceedings of the IEEE/ACM SC98 Conference · doi:10.1109/sc.1998.10004 · Cited by 527
Benchmarking GPUs to tune dense linear algebra
Volkov, V., & Demmel, J. W. (2008) · 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2008.5214359 · Cited by 489
Towards dense linear algebra for hybrid GPU accelerated manycore systems
Tomov, S., Dongarra, J., & Baboulin, M. (2010) · Parallel Computing · doi:10.1016/j.parco.2009.12.005 · Cited by 451
Memory---CellSs: a programming model for the cell BE architecture
Bellens, P., Perez, J. M., Badia, R. M., & Labarta, J. (2006) · Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06 · doi:10.1145/1188455.1188546 · Cited by 267
StarPU: A Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures
Augonnet, C., Thibault, S., Namyst, R., & Wacrenier, P.-A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03869-3_80 · Cited by 243
Self-citation
Cited by
Kokkos: Enabling manycore performance portability through polymorphic memory access patterns
Carter Edwards, H., Trott, C. R., & Sunderland, D. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.07.003 · Cited by 971
A Survey of CPU-GPU Heterogeneous Computing Techniques
Mittal, S., & Vetter, J. S. (2015) · ACM Computing Surveys · doi:10.1145/2788396 · Cited by 568
A Static Task Partitioning Approach for Heterogeneous Systems Using OpenCL
Grewe, D., & O’Boyle, M. F. P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19861-8_16 · Cited by 109
The tradeoffs of fused memory hierarchies in heterogeneous computing architectures
Spafford, K. L., Meredith, J. S., Lee, S., Li, D., Roth, P. C., & Vetter, J. S. (2012) · Proceedings of the 9th conference on Computing Frontiers · doi:10.1145/2212908.2212924 · Cited by 49
Enabling task-level scheduling on heterogeneous platforms
Sun, E., Schaa, D., Bagley, R., Rubin, N., & Kaeli, D. (2012) · Proceedings of the 5th Annual Workshop on General Purpose Processing with Graphics Processing Units · doi:10.1145/2159430.2159440 · Cited by 33
Metadata
- Authors
- Augonnet, C., Thibault, S., Namyst, R., & Wacrenier, P.
- Venue
- Concurrency and Computation: Practice and Experience
- Publisher
- Wiley
- Published
- 2010-11-04
- Volume
- 23
- Issue
- 2
- Pages
- 187-198
- ISSN
- 1532-0626 (ISSN-L)
- 1532-0634
- OpenAlex
- W2121893797
- Cited by
- 1,275
- References
- 17
- FWCI
- 107.59
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: StarPU: a unified platform for task scheduling on heterogeneous multicore architectures. https://app.cochat.ai/papers/10.1002/cpe.1631
- The paper
- Augonnet, C., Thibault, S., Namyst, R., & Wacrenier, P. (2011). StarPU: a unified platform for task scheduling on heterogeneous multicore architectures. Concurrency and Computation: Practice and Experience. https://doi.org/10.1002/cpe.1631
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.