14 citations · 18 across the 6 of their papers we have counts for
6 papers
TD-Orch: Efficient Task-Data Orchestration for Distributed Systems with Application to Graph Processing
Yiwei Zhao, Qiushi Lin, Hongbo Kang +5
We introduce a task-data orchestration abstraction that supports a range of distributed applications. Given a batch of lambda tasks each requesting a data item, where both tasks an…
PIM-tree: A Skew-resistant Index for Processing-in-Memory
Hongbo Kang, Yiwei Zhao, Guy E. Blelloch +4
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 thi…
Spatial Locality and Granularity Change in Caching
Nathan Beckmann, Phillip B Gibbons, Charles McGuffey
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…
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
Laxman Dhulipala, Charlie McGuffey, Hongbo Kang +4
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 mem…
The Parallel Persistent Memory Model
Guy E. Blelloch, Phillip B. Gibbons, Yan Gu +2
We consider a parallel computational model that consists of processors, each with a fast local ephemeral memory of limited size, and sharing a large persistent memory. The mode…
Implicit Decomposition for Write-Efficient Connectivity Algorithms
Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman +4
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 expen…