The Performance of Distributed DataStructures Running on InMemory DataGrid

That's very cool stuff, and a nice way of demonstrating how B-trees perform in a system with heterogeneous memory access times. It would be interesting to hear about other data structures and common algorithms, too.

Re: The Performance of Distributed DataStructures Running on InMemory DataGrid

#5

Post by pron » Mon, Aug 20, 2012, 5:38 PM UTC

mjb wrote: post #4

That's very cool stuff, and a nice way of demonstrating how B-trees perform in a system with heterogeneous memory access times. It would be interesting to hear about other data structures and common algorithms, too.

The B-tree property that writes percolate from the leaves upwards, while reads descend from the root is a perfect fit for this architecture.

And you're right. This analysis applies to any NUMA implementation, although it is most pertinent when inter-node communication cost dominates other operations.

I would like to know of any similar analyses out there. I think there's a lot of interesting distributed data-structure research that could be done with Galaxy.

Re: The Performance of Distributed DataStructures Running on InMemory DataGrid

#6

Post by Cloven » Mon, Aug 20, 2012, 10:37 PM UTC

pron wrote: post #2

OP here. Just need to mention we're YC S12.

per their submission history, OP has also attempted to generate buzz here by posting over and over:

How the Galaxy In-Memory Data Grid Handles Networking How the Galaxy In-Memory Data Grid Handles Failures How the Galaxy In-Memory Data Grid Maintains Data Consistency Parallel Universe open sources a novel in-memory data grid

and the highly specious and fallacious

SpaceBase Can Now Be Used as a Spatial Redis