2 citations · 10 across the 21 of their papers we have counts for
4 papers · 1 filter
Demystifying Graph Sparsification Algorithms in Graph Properties Preservation
Yuhan Chen, Haojie Ye, Sanketh Vedula +4
Graph sparsification is a technique that approximates a given graph by a sparse graph with a subset of vertices and/or edges. The goal of an effective sparsification algorithm is t…
Everest: GPU-Accelerated System For Mining Temporal Motifs
Yichao Yuan, Haojie Ye, Sanketh Vedula +2
Temporal motif mining is the task of finding the occurrences of subgraph patterns within a large input temporal graph that obey the specified structural and temporal constraints. D…
Vector-Processing for Mobile Devices: Benchmark and Analysis
Alireza Khadem, Daichi Fujiki, Nishil Talati +2
Vector processing has become commonplace in today's CPU microarchitectures. Vector instructions improve performance and energy which is crucial for resource-constraint mobile devic…
Accelerating Graph Analytics on a Reconfigurable Architecture with a Data-Indirect Prefetcher
Yichen Yang, Jingtao Li, Nishil Talati +5
The irregular nature of memory accesses of graph workloads makes their performance poor on modern computing platforms. On manycore reconfigurable architectures (MRAs), in particula…