7 June 2018 Optimizing collaborative computations for scalable distributed inference in large graphs
Author Affiliations +
Abstract
In this paper, we study two methods to optimize distributed collaborative computations: (a) data partitioning, which exploits locality to reduce data dependencies between local computations, and (b) computation aggregation, which reduces communication load between local partitions. We analyze the benefits of such optimizations and their utility for message-passing processing model. This is a class of general-purpose graph analytics widely used in a range of domains and applications, including computer vision, activity recognition, social network analysis, knowledge mining, and semi-supervised inference. Described optimization methods will improve performance of implementing relational data analytics in distributed environments, including cloud computing, graphical processing units, collaborative multi-agent systems, or specialized chip-boards.
Conference Presentation
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Georgiy Levchuk, Georgiy Levchuk, John Colonna-Romano, John Colonna-Romano, } "Optimizing collaborative computations for scalable distributed inference in large graphs", Proc. SPIE 10646, Signal Processing, Sensor/Information Fusion, and Target Recognition XXVII, 106460O (7 June 2018); doi: 10.1117/12.2305872; https://doi.org/10.1117/12.2305872
PROCEEDINGS
12 PAGES + PRESENTATION

SHARE
RELATED CONTENT


Back to Top