The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
The tao of parallelism in algorithms
Abstract
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in "regular" algorithms that use dense arrays, such as finite-differences and FFTs. In this paper, we argue that the dependence graph is not a suitable abstraction for algorithms in new application areas like machine learning and network analysis in which the key data structures are "irregular" data structures like graphs, trees, and sets. To address the need for better abstractions, we introduce a data-centric formulation of algorithms called the operator formulation in which an algorithm is expressed in terms of its action on data structures. This formulation is the basis for a structural analysis of algorithms that we call tao-analysis . Tao-analysis can be viewed as an abstraction of algorithms that distills out algorithmic properties important for parallelization. It reveals that a generalized form of data-parallelism called amorphous data-parallelism is ubiquitous in algorithms, and that, depending on the tao-structure of the algorithm, this parallelism may be exploited by compile-time, inspector-executor or optimistic parallelization, thereby unifying these seemingly unrelated parallelization techniques. Regular algorithms emerge as a special case of irregular algorithms, and many application-specific optimization techniques can be generalized to a broader context. These results suggest that the operator formulation and tao-analysis of algorithms can be the foundation of a systematic approach to parallel programming.
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
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
An Introduction to Data Mining
Stephens, C. R., & Sukumar, R. (2006) · The Handbook of Marketing Research · doi:10.4135/9781412973380.n22 · Cited by 4,562
A hierarchical O(N log N) force-calculation algorithm
Barnes, J., & Hut, P. (1986) · Nature · doi:10.1038/324446a0 · Cited by 3,698
Jefferson, D. R. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/3916.3988 · Cited by 2,397
Transactional memory: architectural support for lock-free data structures
Herlihy, M., & Moss, J. E. B. (1993) · Proceedings of the 20th annual international symposium on Computer architecture - ISCA '93 · doi:10.1145/165123.165164 · Cited by 2,141
Introduction to Data Mining, (First Edition)
Tan, P., Steinbach, M. S., & Kumar, V. (2005) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,889
Multilevelk-way Partitioning Scheme for Irregular Graphs
Karypis, G., & Kumar, V. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1404 · Cited by 1,675
An introduction to parallel algorithms
JáJá, J. F. (1992) · Cited by 1,600
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Luby, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215074 · Cited by 1,147
Cilk: an efficient multithreaded runtime system
Blumofe, R. D., Joerg, C. F., Kuszmaul, B. C., Leiserson, C. E., Randall, K. H., & Zhou, Y. (1995) · Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/209936.209958 · Cited by 1,021
Optimizing Compilers for Modern Architectures: A Dependence-based Approach
Kennedy, K., & Allen, J. R. (2001) · Cited by 1,002
Distributed discrete-event simulation
Misra, J. (1986) · ACM Computing Surveys · doi:10.1145/6462.6485 · Cited by 998
Algorithms+Data Structures = Programs
(2024) · Data Structures and Algorithms in Java · doi:10.1017/9781009260350.002 · Cited by 953
Program Analysis and Specialization for the C Programming Language
Andersen, L. O., & Lee, P. (2005) · Cited by 899
(2018) · Optimization Models · doi:10.1017/cbo9781107279667.013 · Cited by 818
(2004) · Cited by 742
InformationTheory, Inference, and Learning Algorithms
Mackay, D. J. C. (2003) · Cited by 648
Language support for lightweight transactions
Harris, T., & Fraser, K. A. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641654 · Cited by 630
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
Gordon, M. I., Thies, W., & Amarasinghe, S. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168877 · Cited by 512
Randomized incremental construction of Delaunay and Voronoi diagrams
Guibas, L. J., Knuth, D. E., & Sharir, M. (1992) · Algorithmica · doi:10.1007/bf01758770 · Cited by 479
Guaranteed-quality mesh generation for curved surfaces
Chew, L. P. (1993) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/160985.161150 · Cited by 443
Optimistic parallelism requires abstractions
Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., & Chew, L. P. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250759 · Cited by 441
Self-citationExecuting a program on the MIT tagged-token dataflow architecture
Arvind, & Nikhil, R. S. (1990) · IEEE Transactions on Computers · doi:10.1109/12.48862 · Cited by 401
A scalable approach to thread-level speculation
Steffan, J. G., Colohan, C. B., Zhai, A., & Mowry, T. C. (2000) · Proceedings of the 27th annual international symposium on Computer architecture - ISCA '00 · doi:10.1145/339647.339650 · Cited by 392
Transactional boosting: a methodology for highly-concurrent transactional objects
Herlihy, M., & Koskinen, E. (2008) · Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming · doi:10.1145/1345206.1345237 · Cited by 305
Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C
Ghiya, R., & Hendren, L. J. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237724 · Cited by 287
Dependence analysis for pointer variables
Horwitz, S., Pfeiffer, P., & Reps, T. (1989) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/73141.74821 · Cited by 233
Parallelizing programs with recursive data structures
Hendren, L. J., & Nicolau, A. (1990) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.80123 · Cited by 219
Rendering complex scenes with memory-coherent ray tracing
Pharr, M., Kolb, C., Gershbein, R., & Hanrahan, P. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258791 · Cited by 215
Singh, J. P., Holt, C., Totsuka, T., Gupta, A., & Hennessy, J. (1995) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1995.1077 · Cited by 209
Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)
Brandes, U., & Erlebach, T. (2005) · Springer eBooks · Cited by 184
How much parallelism is there in irregular applications?
Kulkarni, M., Burtscher, M., Inkulu, R., Pingali, K. K., & Caşcaval, C. (2009) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/1504176.1504181 · Cited by 169
Self-citationRinard, M., & Diniz, P. C. (1997) · ACM Transactions on Programming Languages and Systems · doi:10.1145/267959.269969 · Cited by 152
STAPL: An Adaptive, Generic Parallel C++ Library
An, P., Jula, A., Rus, S., Saunders, S., Smith, T. G., Tanase, G., Thomas, N., Amato, N. M., & Rauchwerger, L. (2003) · Lecture notes in computer science · doi:10.1007/3-540-35767-x_13 · Cited by 118
Highly Parallel Sparse Cholesky Factorization
Gilbert, J. R., & Schreiber, R. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913067 · Cited by 76
Parallel inclusion-based points-to analysis
Méndez-Lojo, M., Mathew, A., & Pingali, K. K. (2010) · ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA) · doi:10.1145/1869459.1869495 · Cited by 71
Self-citationLifting sequential graph algorithms for distributed-memory parallel computation
Gregor, D., & Lumsdaine, A. (2005) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1094811.1094844 · Cited by 69
Synthesizing concurrent schedulers for irregular algorithms
Nguyen, D. D., & Pingali, K. K. (2011) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/1950365.1950404 · Cited by 39
Self-citation(1990)
Cited by
Kambatla, K., Kollias, G., Kumar, V., & Grama, A. (2014) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.01.003 · Cited by 819
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
A lightweight infrastructure for graph analytics
Nguyen, D., Lenharth, A., & Pingali, K. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522739 · Cited by 579
Self-citationGunrock: a high-performance graph processing library on the GPU
Wang, Y., Davidson, A., Pan, Y., Wu, Y., Riffel, A., & Owens, J. D. (2016) · Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2851141.2851145 · Cited by 338
McCune, R. R., Weninger, T., & Madey, G. (2015) · ACM Computing Surveys · doi:10.1145/2818185 · Cited by 294
Metadata
- Authors
- Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., Prountzos, D., & Sui, X.
- Venue
- ACM SIGPLAN Notices
- Published
- 2011-06-04
- Volume
- 46
- Issue
- 6
- Pages
- 12-25
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2098903349
- Cited by
- 312
- References
- 45
- FWCI
- 29.60
- 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
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.