Emerging memory technologies have a significant gap between the cost, both in time and in
energy, of writing to memory versus reading from memory. In this paper we present models …

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 …

A challenge in computer architecture is that processors often cannot be fed data from DRAM
as fast as CPUs can consume it. Therefore, many applications are memory-bandwidth …

In recent work we quantified the anticipated performance boost when a sorting algorithm is
modified to leverage user-addressable" near-memory," which we call scratchpad. This …

Relational Aggregation is one of the major means to analyze large data sets since the
creation of the first database systems. Available hardware performance continues to grow at …

New non-volatile memory (NVM) technologies are projected to become the dominant type of
main memory in the near future. They promise byteaddressability, good read latencies, and …

The goal of parallel algorithm design is to develop parallel computational methods that run
very fast with as few processors as possible, and there is an extensive literature of such …

Continued advances in VLSI scaling combined with unsustainable power consumption of
frequency scaling resulted in parallel processors having become mainstream as …

We analyze the caching overhead incurred by a class of multithreaded algorithms when
scheduled by an arbitrary scheduler. We obtain bounds that match or improve upon the well …

Over the past decade,\many-core" architectures have become a crucial resources for solving
com-putationally challenging problems. These systems rely on hundreds or thousands of …