The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Memory---Sequoia: programming the memory hierarchy
Abstract
We present Sequoia, a programming language designed to facilitate the development of memory hierarchy aware parallel programs that remain portable across modern machines featuring different memory hierarchy configurations. Sequoia abstractly exposes hierarchical memory in the programming model and provides language mechanisms to describe communication vertically through the machine and to localize computation to particular memory locations within it. We have implemented a complete programming system, including a compiler and runtime systems for Cell processor-based blade systems and distributed memory clusters, and demonstrate efficient performance running Sequoia programs on both of these platforms.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,453
OpenMP: an industry standard API for shared-memory programming
Dagum, L., & Menon, R. (1998) · IEEE Computational Science and Engineering · doi:10.1109/99.660313 · Cited by 3,343
Automated empirical optimizations of software and the ATLAS project
Clint Whaley, R., Petitet, A., & Dongarra, J. J. (2001) · Parallel Computing · doi:10.1016/s0167-8191(00)00087-9 · Cited by 1,317
X10: an object-oriented approach to non-uniform cluster computing
Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., & Sarkar, V. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094852 · Cited by 1,268
Brook for GPUs: stream computing on graphics hardware
Buck, I., Foley, T., Horn, D., Sugerman, J., Fatahalian, K., Houston, M., & Hanrahan, P. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015800 · Cited by 1,155
Self-citationCilk: 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
Frigo, M., Leiserson, C. E., Prokop, H., & Ramachandran, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814600 · Cited by 803
The design and implementation of a first-generation CELL processor
Pham, D., Asano, S., Bolliger, M., Day, M. N., Hofstee, H. P., Johns, C., Kahle, J., Kameyama, A., Keaty, J., Masubuchi, Y., et al. (2005) · ISSCC. 2005 IEEE International Digest of Technical Papers. Solid-State Circuits Conference, 2005. · doi:10.1109/isscc.2005.1493930 · Cited by 544
I/O complexity: The red-blue pebble game
Hong, J., & Kung, H. T. (1981) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800076.802486 · Cited by 474
Titanium: a high-performance Java dialect
Yelick, K., Semenzato, L., Pike, G., Miyamoto, C., Liblit, B., Krishnamurthy, A., Hilfinger, P., Graham, S., Gay, D., Colella, P., et al. (1998) · Concurrency: Practice and Experience · doi:10.1002/(sici)1096-9128(199809/11)10:11/13<825::aid-cpe383>3.0.co;2-h · Cited by 451
Self-citationA fast Fourier transform compiler
Frigo, M. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301661 · Cited by 438
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
Gustavson, F. G. (1997) · IBM Journal of Research and Development · doi:10.1147/rd.416.0737 · Cited by 229
Cache oblivious stencil computations
Frigo, M., & Strumpen, V. (2005) · Proceedings of the 19th annual international conference on Supercomputing · doi:10.1145/1088149.1088197 · Cited by 184
The cascade high productivity language
Callahan, D. P., Chamberlain, B. L., & Zima, H. P. (2004) · doi:10.1109/hips.2004.1299190 · Cited by 152
Blocking and array contraction across arbitrarily nested loops using affine partitioning
Lim, A. W., Liao, S.-W., & Lam, M. S. (2001) · Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming · doi:10.1145/379539.379586 · Cited by 142
Programming for parallelism and locality with hierarchically tiled arrays
Bikshandi, G., Guo, J., Hoeflinger, D. E., Almási, G., Fraguela, B. B., Garzarán, M. J., Padua, D., & von Praun, C. (2006) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/1122971.1122981 · Cited by 128
GRAPE-6A: A Single-Card GRAPE-6 for Parallel PC-GRAPE Cluster Systems
Fukushige, T., Makino, J., & Kawai, A. (2005) · Publications of the Astronomical Society of Japan · doi:10.1093/pasj/57.6.1009 · Cited by 107
ClawHMMER: A Streaming HMMer-Search Implementatio
Horn, D. R., Houston, M., & Hanrahan, P. (2005) · Proceedings - Supercomputing · doi:10.1109/sc.2005.18 · Cited by 104
Self-citationChores: enhanced run-time support for shared-memory parallel computing
Eager, D. L., & Jahorjan, J. (1993) · ACM Transactions on Computer Systems · doi:10.1145/151250.151251 · Cited by 40
Cited by
Borkar, S., & Chien, A. A. (2011) · Communications of the ACM · doi:10.1145/1941487.1941507 · Cited by 966
(2013) · doi:10.1145/2491956.2462176 · Cited by 885
Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., & Amarasinghe, S. (2013) · ACM SIGPLAN Notices · doi:10.1145/2499370.2462176 · Cited by 513
Legion: expressing locality and independence with logical regions
Bauer, M., Treichler, S., Slaughter, E., & Aiken, A. (2012) · doi:10.5555/2388996.2389086 · Cited by 357
Self-citationAccelerating CUDA graph algorithms at maximum warp
Hong, S., Kim, S. K., Oguntebi, T., & Olukotun, K. (2011) · Proceedings of the 16th ACM symposium on Principles and practice of parallel programming · doi:10.1145/1941553.1941590 · Cited by 339
Metadata
- Authors
- Fatahalian, K., Dally, W. J., Hanrahan, P., Horn, D. R., Knight, T. J., Leem, L., Houston, M., Park, J. Y., Erez, M., Ren, M., & Aiken, A.
- Venue
- Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06
- Publisher
- ACM Press
- Published
- 2006
- Pages
- 83
- OpenAlex
- W2085118703
- Cited by
- 452
- References
- 19
- Type
- conference abstract
- 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.