Many modern programming languages are shifting toward a functional style for collection
interfaces such as sets, maps, and sequences. Functional interfaces offer many advantages …

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for
large-scale graph analytics, including byte-addressability, low idle power, and improved …

Storage devices have evolved to offer increasingly faster read/write access, through flash-
based and other solid-state storage technologies. When compared to classical rotating hard …

Computing strongly connected components (SCC) is among the most fundamental problems
in graph analytics. Given the large size of today's real-world graphs, parallel SCC …

In this paper, we design parallel write-efficient geometric algorithms that perform
asymptotically fewer writes than standard algorithms for the same problem. This is motivated …

Over the past few decades, solid-state drives (SSDs) have been replacing hard disk drives
(HDDs) due to their faster reads and writes, as well as their superior random access …

The literature on cache replacement, while both detailed and extensive, neglects to account
for the flow of data to storage. Motivated by emerging memory technologies and the …

Emerging non-volatile main memory (NVRAM) technologies provide byte-addressability, low
idle power, and improved memory-density, and are likely to be a key component in the future …

We study the writeback-aware caching problem, a variant of classic paging where paging
requests that modify data and requests that leave data intact are treated differently. We give …

Abstract We introduce the Read-Only Semi-External (ROSE) Model for the design and
analysis of algorithms on large graphs. As in the well-studied semi-external model for graph …