ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1902.00846
16
4

A Billion Updates per Second Using 30,000 Hierarchical In-Memory D4M Databases

3 February 2019
J. Kepner
V. Gadepally
Lauren Milechin
S. Samsi
William Arcand
David Bestor
William Bergeron
Chansup Byun
Matthew Hubbell
Michael Houle
Micheal Jones
Anna Klein
Peter Michaleas
J. Mullen
Andrew Prout
Antonio Rosa
Charles Yee
Albert Reuther
ArXiv (abs)PDFHTML
Abstract

Analyzing large scale networks requires high performance streaming updates of graph representations of these data. Associative arrays are mathematical objects combining properties of spreadsheets, databases, matrices, and graphs, and are well-suited for representing and analyzing streaming network data. The Dynamic Distributed Dimensional Data Model (D4M) library implements associative arrays in a variety of languages (Python, Julia, and Matlab/Octave) and provides a lightweight in-memory database. Associative arrays are designed for block updates. Streaming updates to a large associative array requires a hierarchical implementation to optimize the performance of the memory hierarchy. Running 34,000 instances of a hierarchical D4M associative arrays on 1,100 server nodes on the MIT SuperCloud achieved a sustained update rate of 1,900,000,000 updates per second. This capability allows the MIT SuperCloud to analyze extremely large streaming network data sets.

View on arXiv
Comments on this paper