179 citations · 327 across the 16 of their papers we have counts for
20 papers
An In-Depth Study of Continuous Subgraph Matching (Complete Version)
Xibo Sun, Shixuan Sun, Qiong Luo +1
Continuous subgraph matching (CSM) algorithms find the occurrences of a given pattern on a stream of data graphs online. A number of incremental CSM algorithms have been proposed.…
A Simulation Platform for Multi-tenant Machine Learning Services on Thousands of GPUs
Ruofan Liang, Bingsheng He, Shengen Yan +1
Multi-tenant machine learning services have become emerging data-intensive workloads in data centers with heavy usage of GPU resources. Due to the large scale, many tuning paramete…
The Serverless Computing Survey: A Technical Primer for Design Architecture
Zijun Li, Linsong Guo, Jiagan Cheng +3
The development of cloud infrastructures inspires the emergence of cloud-native computing. As the most promising architecture for deploying microservices, serverless computing has…
ThunderRW: An In-Memory Graph Random Walk Engine (Complete Version)
Shixuan Sun, Yuhang Chen, Shengliang Lu +2
As random walk is a powerful tool in many graph processing, mining and learning applications, this paper proposes an efficient in-memory random walk engine named ThunderRW. Compare…
Skew-Oblivious Data Routing for Data-Intensive Applications on FPGAs with HLS
Xinyu Chen, Hongshi Tan, Yao Chen +3
FPGAs have become emerging computing infrastructures for accelerating applications in datacenters. Meanwhile, high-level synthesis (HLS) tools have been proposed to ease the progra…
Cache-Efficient Fork-Processing Patterns on Large Graphs
Shengliang Lu, Shixuan Sun, Johns Paul +2
As large graph processing emerges, we observe a costly fork-processing pattern (FPP) that is common in many graph algorithms. The unique feature of the FPP is that it launches many…