Visualizing distributed memory computations with hive plots

  • Authors:
  • Sophie Engle;Sean Whalen

  • Affiliations:
  • University of San Francisco, San Francisco, CA;Columbia University, New York, NY

  • Venue:
  • Proceedings of the Ninth International Symposium on Visualization for Cyber Security
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

A hive plot is a network layout algorithm that uses a parallel coordinate plot in which axes are radially arranged and node position is based on structural properties of that node [8]. We apply hive plots to message-passing communication networks formed by different high performance computing applications at Lawrence Berkeley National Laboratory. Hive plots have advantages over common network visualization methods, abandoning the popular "hairballs" of force-directed network layouts and opting instead for a tunable, repeatable, and interpretable view of network-theoretic properties. Small multiples of these hive plots, called hive panels, are analyzed to suggest which properties contribute to accurate classification of application behavior for anomaly detection in high performance computing environments.