Multi-Level Memory Algorithmics for Large, Sparse Problems
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- University of Notre Dame, IN (United States)
- Georgia Institute of Technology, Atlanta, GA (United States)
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Rensselaer Polytechnic Institute, Troy, NY (United States)
In this report, we abstract eleven papers published during the project and describe preliminary unpublished results that warrant follow-up work. The topic is multi-level memory algorithmics, or how to effectively use multiple layers of main memory. Modern compute nodes all have this feature in some form.
- Research Organization:
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA); USDOE Laboratory Directed Research and Development (LDRD) Program
- DOE Contract Number:
- AC04-94AL85000;
- OSTI ID:
- 1574408
- Report Number(s):
- SAND--2019-13871; 681427
- Country of Publication:
- United States
- Language:
- English
Similar Records
Sparse Matrix-Matrix Multiplication on Multilevel Memory Architectures: Algorithms and Experiments
Database algorithms for multiprocessor and very large memory systems
LDRD final report : a lightweight operating system for multi-core capability class supercomputers.
Technical Report
·
2018
·
OSTI ID:1435688
Database algorithms for multiprocessor and very large memory systems
Conference
·
1986
·
OSTI ID:5627804
LDRD final report : a lightweight operating system for multi-core capability class supercomputers.
Technical Report
·
2010
·
OSTI ID:1007323