By Topic

Computational Graph Analytics for Massive Streaming Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

In this chapter the author presents a new, extensible and flexible data structure for massive graphs called STINGER (Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation). Two studies are discussed: the first study, computing a widely used network analysis metric called clustering coefficients, and the second study, the approach for tracking connected components given a stream of edge insertions and removals. The chapter describes the massively multithreaded Cray XMT as well as the more common platform built on Intel's Nehalem architecture. It presents experimental results on the Cray XMT, with a comparison to the Intel Nehalem platform for the clustering coefficient problem. Regarding clustering coefficients, a similar rate of 200,000 updates per second can be maintained on the Cray XMT.