The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
SPLASH: Stanford parallel applications for shared-memory
Open accessAbstract
We present the Stanford Parallel Applications for Shared-Memory (SPLASH), a set of parallel applications for use in the design and evaluation of shared-memory multiprocessing systems. Our goal is to provide a suite of realistic applications that will serve as a well-documented and consistent basis for evaluation studies. We describe the applications currently in the suite in detail, discuss some of their important characteristics, and explore their behavior by running them on a real multiprocessor as well as on a simulator of an idealized parallel architecture. We expect the current set of applications to act as a nucleus for a suite that will grow with time.
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
A fast algorithm for particle simulations
Greengard, L., & Rokhlin, V (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90140-9 · Cited by 4,868
Numerical Initial Value Problems in Ordinary Differential Equations
I., E., & Gear, C. W. (1973) · Mathematics of Computation · doi:10.2307/2005674 · Cited by 3,926
A hierarchical O(N log N) force-calculation algorithm
Barnes, J., & Hut, P. (1986) · Nature · doi:10.1038/324446a0 · Cited by 3,698
Computer Solution of Large Sparse Positive Definite Systems.
Pasciak, J. E., George, A., & Liu, J. W. (1982) · Mathematics of Computation · doi:10.2307/2007640 · Cited by 1,874
Dongarra, J. J., Moler, C. B., Bunch, J. R., & Stewart, G. W. (1979) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971811 · Cited by 1,738
CI study of the water dimer potential surface
Matsuoka, O., Clementi, E., & Yoshimine, M. (1976) · The Journal of Chemical Physics · doi:10.1063/1.432402 · Cited by 1,157
Duff, I. S., Grimes, R. G., & Lewis, J. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/62038.62043 · Cited by 650
Computer Solution of Large Sparse Positive Definite
George, A. D., & Liu, J. W. (1981) · Cited by 348
Lie, G. C., & Clementi, E. (1986) · Physical Review A · doi:10.1103/physreva.33.2679 · Cited by 229
Scaling parallel programs for multiprocessors: methodology and examples
Singh, J. P., Hennessy, J. L., & Gupta, A. (1993) · Computer · doi:10.1109/mc.1993.274941 · Cited by 143
Self-citation
Cited by
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.223990 · Cited by 3,624
Self-citation(2006) · Cited by 1,979
Compiler transformations for high-performance computing
Bacon, D. F., Graham, S. L., & Sharp, O. J. (1994) · ACM Computing Surveys · doi:10.1145/197405.197406 · Cited by 818
Design and evaluation of a compiler algorithm for prefetching
Mowry, T. C., Lam, M. S., & Gupta, A. (1992) · Proceedings of the fifth international conference on Architectural support for programming languages and operating systems · doi:10.1145/143365.143488 · Cited by 767
Self-citationComplete computer system simulation: the SimOS approach
Rosenblum, M., Herrod, S. A., Witchel, E., & Gupta, A. (1995) · IEEE Parallel & Distributed Technology: Systems & Applications · doi:10.1109/88.473612 · Cited by 498
Self-citation
Metadata
- Authors
- Singh, J. P., Weber, W.-D., & Gupta, A.
- Venue
- ACM SIGARCH Computer Architecture News
- Published
- 1992-03
- Volume
- 20
- Issue
- 1
- Pages
- 5-44
- ISSN
- 0163-5964 (ISSN-L)
- OpenAlex
- W1966285605
- Cited by
- 925
- References
- 11
- FWCI
- 115.22
- 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: SPLASH: Stanford parallel applications for shared-memory. https://app.cochat.ai/papers/10.1145/130823.130824
- The paper
- Singh, J. P., Weber, W.-D., & Gupta, A. (1992). SPLASH: Stanford parallel applications for shared-memory. ACM SIGARCH Computer Architecture News. https://doi.org/10.1145/130823.130824
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.