skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: ASC L2 Milestone - Evaluation of Opportunities for Multi-Level Memory.


Abstract not provided.

; ; ;
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: Proposed for presentation at the ASC L2 Milestone held August 17, 2016 in Albuquerque, New Mexico, United States of America.
Country of Publication:
United States

Citation Formats

Voskuilen, Gwendolyn Renae, Rodrigues, Arun F., Frank, Michael P, and Hammond, Simon David. ASC L2 Milestone - Evaluation of Opportunities for Multi-Level Memory.. United States: N. p., 2016. Web.
Voskuilen, Gwendolyn Renae, Rodrigues, Arun F., Frank, Michael P, & Hammond, Simon David. ASC L2 Milestone - Evaluation of Opportunities for Multi-Level Memory.. United States.
Voskuilen, Gwendolyn Renae, Rodrigues, Arun F., Frank, Michael P, and Hammond, Simon David. 2016. "ASC L2 Milestone - Evaluation of Opportunities for Multi-Level Memory.". United States. doi:.
title = {ASC L2 Milestone - Evaluation of Opportunities for Multi-Level Memory.},
author = {Voskuilen, Gwendolyn Renae and Rodrigues, Arun F. and Frank, Michael P and Hammond, Simon David},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2016,
month = 9

Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • In this paper, we present two schemes for concurrency control and recovery in distributed main-memory databases. In the client-server scheme, clients ship log records to the server, which applies the updates to its database copy. In the shared disk scheme, each site broadcasts its updates to other sites. The above enable our schemes to support concurrent updates to the same page at different sites. Both schemes support an explicit multi-level recovery abstraction for high concurrency, reduced disk I/O by writing only redo log records to disk during normal processing, and use of per-transaction redo and undo logs to reduce contention.more » Further, we use a fuzzy checkpointing scheme that writes only dirty pages to disk, yet minimally interferes with normal processing, not requiring updaters to even acquire a latch before updating a page.« less
  • Due to their low access latency, high read speed, and power-efficient operation, flash memory storage devices are rapidly emerging as an attractive alternative to traditional magnetic storage devices. However, tests show that the most efficient indexing methods are not able to take advantage of the flash memory storage devices. In this paper, we present a set of multi-level bitmap indexes that can effectively take advantage of flash storage devices. These indexing methods use coarsely binned indexes to answer queries approximately, and then use finely binned indexes to refine the answers. Our new methods read significantly lower volumes of data atmore » the expense of an increased disk access count, thus taking full advantage of the improved read speed and low access latency of flash devices. To demonstrate the advantage of these new indexes, we measure their performance on a number of storage systems using a standard data warehousing benchmark called the Set Query Benchmark. We observe that multi-level strategies on flash drives are up to 3 times faster than traditional indexing strategies on magnetic disk drives.« less
  • Modern architectures are characterized by deeper levels of memory hierarchy, often explicitly addressable. Optimizing applications for such architectures requires careful management of the data movement across all these levels. In this paper, we focus on the problem of mapping tensor contractions to memory hierarchies with more than two levels, specifically addressing placement of memory allocation and data movement statements, choice of loop fusions, and tile size selection. Existing algorithms to find an integrated solution to this problem even for two-level memory hierarchies has been shown to be expensive. We improve upon this work by focusing on the first-order cost components,more » simplifying the analysis required and reducing the number of candidates to be evaluated. We have evaluated our framework on a cluster of GPUs. Using five tensor contraction expressions, we show that fusion at multiple levels improves performance, and our framework is effective in determining protable transformations.« less
  • Abstract not provided.
  • Abstract not provided.