activity
20152021
most citedOptimize Unsynchronized Garbage Collection in an SSD Array

2 citations · 2 across the 2 of their papers we have counts for

collaborators

6 papers

cs.IR2021

Dr. Top-k: Delegate-Centric Top-k on GPUs

Anil Gaihre, Da Zheng, Scott Weitze +5

Recent top- computation efforts explore the possibility of revising various sorting algorithms to answer top- queries on GPUs. These endeavors, unfortunately, perform signifi…

cs.DC2019

Graphyti: A Semi-External Memory Graph Library for FlashGraph

Disa Mhembere, Da Zheng, Carey E. Priebe +2

Graph datasets exceed the in-memory capacity of most standalone machines. Traditionally, graph frameworks have overcome memory limitations through scale-out, distributing computing…

cs.DC2019

clusterNOR: A NUMA-Optimized Clustering Framework

Disa Mhembere, Da Zheng, Carey E. Priebe +2

Clustering algorithms are iterative and have complex data access patterns that result in many small random memory accesses. The performance of parallel implementations suffer from…

cs.DC2018

Challenges Towards Deploying Data Intensive Scientific Applications on Extreme Heterogeneity Supercomputers

Hang Liu, Yufei Ding, Da Zheng +2

Shrinking transistors, which powered the advancement of computing in the past half century, has stalled due to power wall; now extreme heterogeneity is promised to be the next driv…

cs.DC2016

An SSD-based eigensolver for spectral analysis on billion-node graphs

Da Zheng, Randal Burns, Joshua Vogelstein +2

Many eigensolvers such as ARPACK and Anasazi have been developed to compute eigenvalues of a large sparse matrix. These eigensolvers are limited by the capacity of RAM. They run in…

cs.OS20152 cited

Optimize Unsynchronized Garbage Collection in an SSD Array

Da Zheng, Randal Burns, Alexander S. Szalay

Solid state disks (SSDs) have advanced to outperform traditional hard drives significantly in both random reads and writes. However, heavy random writes trigger fre- quent garbage…