Charles McGuffey

PIM-tree: A Skew-resistant Index for Processing-in-Memory

The performance of today's in-memory indexes is bottlenecked by the memory latency/bandwidth wall. Processing-in-memory (PIM) is an emerging approach that potentially mitigates this bottleneck, by...

Spatial Locality and Granularity Change in Caching

Caches exploit temporal and spatial locality to allow a small memory to provide fast access to data stored in large, slow memory. The temporal aspect of locality is extremely well studied and...

The Parallel Persistent Memory Model

We consider a parallel computational model that consists of $P$ processors, each with a fast local ephemeral memory of limited size, and sharing a large persistent memory. The model allows for...

Implicit Decomposition for Write-Efficient Connectivity Algorithms

The future of main memory appears to lie in the direction of new technologies that provide strong capacity-to-performance ratios, but have write operations that are much more expensive than reads...

Implicit Decomposition for Write-Efficient Connectivity Algorithms

PIM-zd-tree: A Fast Space-Partitioning Index Leveraging Processing-in-Memory

Writeback-Aware Caching

The Read-Only Semi-External Model

PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract)

Brief Announcement: Suffix Analysis

Block-Granularity-Aware Caching

PIM-trie: A Skew-resistant Trie for Processing-in-Memory

Brief Announcement: Spatial Locality and Granularity Change in Caching

Writeback-Aware Caching (Brief Announcement)

Brief Announcement: Improved Understanding of Landlord Under Suffix Analysis

Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications

Parallel Algorithms for Asymmetric Read-Write Costs

The Processing-in-Memory Model