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 …

The support of range, segment and rectangle queries are fundamental problems in
computational geometry, and have extensive applications in many domains. Despite …

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 …

Paging for multi-core processors extends the classical paging problem to a setting in which
several processes simultaneously share the cache. Recently, Hassidim proposed a model …

Parallel algorithms used in Very Large Scale Integration physical design bring significant
challenges for their efficient and effective design and implementation. The rectangle …

We present the parallel buffer tree, a parallel external memory (PEM) data structure for
batched search problems. This data structure is a non-trivial extension of Arge's sequential …

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 …

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 …