Share Email Print

Proceedings Paper

Optimizing collaborative computations for scalable distributed inference in large graphs
Author(s): Georgiy Levchuk; John Colonna-Romano
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 7 June 2018
PDF: 12 pages
Proc. SPIE 10646, Signal Processing, Sensor/Information Fusion, and Target Recognition XXVII, 106460O (7 June 2018); doi: 10.1117/12.2305872
Show Author Affiliations
Georgiy Levchuk, Aptima, Inc. (United States)
John Colonna-Romano, Aptima, Inc. (United States)

Published in SPIE Proceedings Vol. 10646:
Signal Processing, Sensor/Information Fusion, and Target Recognition XXVII
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top