CuSP: A Customizable Streaming Edge Partitioner for Distributed Graph Analytics

Graph analytics systems must analyze graphs with billions of vertices and edges which require several terabytes of storage. Distributed-memory clusters are often used for analyzing such large graphs since the main memory of a single machine is usually restricted to a few hundreds of gigabytes. This...

Full description

Bibliographic Details

Published in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium pp. 439 - 450
Main Authors:	Hoang, Loc, Dathathri, Roshan, Gill, Gurbinder, Pingali, Keshav
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2019
Subjects:	Clustering algorithms distributed-memory computing graph analytics graph partitioning Heuristic algorithms Microsoft Windows Mirrors Parallel processing Partitioning algorithms streaming partitioners Two dimensional displays
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!