The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
The potential of the cell processor for scientific computing
Open accessAbstract
The slowing pace of commodity microprocessor performance improvements combined with ever-increasing chip power demands has become of utmost concern to computational scientists. As a result, the high performance computing community is examining alternative architectures that address the limitations of modern cache-based designs. In this work, we examine the potential of using the forthcoming STI Cell processor as a building block for future high-end computing systems. Our work contains several novel contributions. First, we introduce a performance model for Cell and apply it to several key scientific computing kernels: dense matrix multiply, sparse matrix vector multiply, stencil computations, and 1D/2D FFTs. The difficulty of programming Cell, which requires assembly level intrinsics for the best performance, makes this model useful as an initial step in algorithm design and evaluation. Next, we validate the accuracy of our model by comparing results against published hardware results, as well as our own implementations on the Cell full system simulator. Additionally, we compare Cell performance to benchmarks run on leading superscalar (AMD Opteron), VLIW (Intel Itanium2), and vector (Cray X1E) architectures. Our work also explores several different mappings of the kernels and demonstrates a simple and effective programming model for Cell's unique architecture. Finally, we propose modest microarchitectural modifications that could significantly increase the efficiency of double-precision calculations. Overall results demonstrate the tremendous potential of the Cell architecture for scientific computations in terms of both raw performance and power efficiency.
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
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
Sparsity: Optimization Framework for Sparse Matrix Kernels
Im, E.-J., Yelick, K., & Vuduc, R. (2004) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342004041296 · Cited by 339
Self-citationA streaming processing unit for a CELL processor
Flachs, B., Asano, S., Dhong, S. H., Hofstee, H. P., Gervais, G., Kim, R., Le, T., Liu, P., Leenstra, J., Liberty, J. S., et al. (2005) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc.2005.1493905 · Cited by 126
Impact of modern memory subsystems on cache optimizations for stencil computations
Kamil, S. A., Husbands, P., Oliker, L., Shalf, J. M., & Yelick, K. (2005) · Workshop on Memory System Performance and Correctness · doi:10.1145/1111583.1111589 · Cited by 124
Self-citationThe Vector Floating-Point Unit in a Synergistic Processor Element of a CELL Processor
Mueller, S. M., Jacobi, C., Oh, H.-J., Tran, K. D., Cottier, S. R., Michael, B. W., Nishikawa, H., Totsuka, Y., Namatame, T., Yano, N., et al. (2005) · IEEE Symposium on Computer Arithmetic (ARITH) · doi:10.1109/arith.2005.45 · Cited by 51
Increasing temporal locality with skewing and recursive blocking
Jin, G., Mellor‐Crummey, J., & Fowler, R. J. (2001) · ACM/IEEE Conference on Supercomputing (SC) · doi:10.1145/582034.582077 · Cited by 46
Cited by
Performance Analysis of Cloud Computing Services for Many-Tasks Scientific Computing
Iosup, A., Ostermann, S., Yigitbasi, M. N., Prodan, R., Fahringer, T., & Epema, D. H. J. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.66 · Cited by 867
Stencil computation optimization and auto-tuning on state-of-the-art multicore architectures
Datta, K., Murphy, M., Volkov, V. M., Williams, S., Carter, J. T., Oliker, L., Patterson, D. A., Shalf, J. M., & Yelick, K. (2008) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.5555/1413370.1413375 · Cited by 462
Self-citationStencil computation optimization and auto-tuning on state-of-the-art multicore architectures
Datta, K., Murphy, M., Volkov, V., Williams, S., Carter, J., Oliker, L., Patterson, D., Shalf, J., & Yelick, K. (2008) · 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2008.5222004 · Cited by 281
Self-citationOptimization and Performance Modeling of Stencil Computations on Modern Microprocessors
Datta, K., Kamil, S., Williams, S., Oliker, L., Shalf, J., & Yelick, K. (2009) · SIAM Review · doi:10.1137/070693199 · Cited by 217
Self-citationImplicit and explicit optimizations for stencil computations
Kamil, S., Datta, K., Williams, S., Oliker, L., Shalf, J., & Yelick, K. (2006) · Proceedings of the 2006 workshop on Memory system performance and correctness · doi:10.1145/1178597.1178605 · Cited by 130
Self-citation
Metadata
- Authors
- Williams, S., Shalf, J., Oliker, L., Kamil, S., Husbands, P., & Yelick, K.
- Venue
- Proceedings of the 3rd conference on Computing frontiers
- Publisher
- ACM
- Published
- 2006-05-03
- Pages
- 9-20
- OpenAlex
- W1564601597
- Cited by
- 309
- References
- 6
- FWCI
- 40.31
- Type
- conference paper
- 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
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.