Collaborative Research: OAC Core: Exploiting SmartSSD-based Computational Storage Architectures for Large Scale Similarity and Range Searches
- Institution
- Missouri University of Science and Technology, MO
- Principal investigator
- Satish Puri
- Funding
- $189K
- Duration
- 2025–2027
Moonbase score
Still being scored
Abstract
Modern scientific enterprises generate enormous volumes of data, as many scientific fields have transitioned from being data poor to data rich recently. To make sense of this data, the scientific enterprise relies on new computational methods and computing infrastructure to realize new insights. In other words, the computational methods used for large scale data analysis are now tools of the scientific community as they are central to the knowledge generation process. This project aims to address a major limitation in large scale data analysis by designing and implementing novel methods that employ computational storage devices, which combine the storage inside of a computer with a configurable processor that resides on the storage device itself. This project will yield new insights into the efficient use of these computational storage devices and will demonstrate how they can be used to remedy the challenges faced in several scientific domains. The project will benefit society by training students in the use of cutting edge technologies that are of national importance and which have great potential to bolster the U.S. economy. Computational storage devices are an emerging technology for accelerating large scale data intensive computations because they combine storage with field programmable gate arrays. Relocating computational tasks from the host processor to a computational storage device eliminates data movement between the computational storage device and the central processor unit's main memory over the bandwidth constrained system interconnect, thereby reducing traffic, saving energy, and reducing latency. Using this paradigm can result in unprecedented acceleration of scientific applications that process large datasets, have data dependent performance characteristics, and have non uniform data access patterns. This project will conduct a design space exploration for selected computational tasks in order to identify the kernels and design parameters that provide the best acceleration for a system with multi core CPUs equipped with computational storage devices. The project will design and implement several indexing data structures having a wide range of properties that make them suitable across numerous application scenarios that are optimized for computational storage devices. The project will create and disseminate a user friendly programming framework that provides data parallel primitives for computational storage devices including map, reduce, filter and join, and collective communication functions including scatter, gather, and all to all communication. Furthermore, using our framework and the indexing data structures, we will design and implement range queries, similarity searches, and joins on points and polygon objects which are highly valuable for several scientific fields including astronomy, heliophysics, geoscience, and other geospatial domains. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
LOADING MOONBASE SCORE
Questions for Missouri University of Science and Technology
Answered by the team behind this research.
No questions yet. Sign in to ask the first one
Related grants
Same researchers, same institution, same topic, scored first.
- NSF · Missouri University of Science and Technology58
Collaborative Research: OAC Core: Efficient Indexing and Similarity Searches Exploiting Processing-in-Memory Architectures for Memory-Bound Scientific Workloads
Satish Puri · $303K · 2024–2027
- NSF · Missouri University of Science and Technology45
CRII: CIF: Sequential Decision-Making Algorithms for Efficient Subset Selection in Multi-Armed Bandits and Optimization of Black-Box Functions
Satish Puri · $175K · 2023–2026
- NSF · Marquette University1
Collaborative Research: OAC: Approximate Nearest Neighbor Similarity Search for Large Polygonal and Trajectory Datasets
Satish Puri · $235K · 2023