Efficient Two-Level Scheduling for Concurrent Graph Processing
Published in arXiv (Cornell University) • Jun 3, 2018
NobleIDNI9P39W77R95S61
Authors:
Jin Zhao
Abstract
With the rapidly growing demand of graph processing in the real scene, they have to efficiently handle massive concurrent jobs. Although existing work enable to efficiently handle single graph processing job, there are plenty of memory access redundancy caused by ignoring the characteristic of data ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!