HenryR

9 ms·

1.
by HenryR 4y ago
You might not be aware that this is one of, if not the , seminal paper in distributed systems. Lamport clocks, described briefly in the review, are an answer to the general problem of establishing an order between events that happen on dif
2.
Distributed systems theory for the distributed systems engineer (2014)(the-paper-trail.org)
2 points by HenryR 4y ago|0 comments
3.
by HenryR 5y ago
This might be useful: https://web.stanford.edu/class/ee384m/Handouts/HowtoReadPape... If you find there is just too much unfamiliar technical language, it’s a good idea to pause and look up a definition. You
4.
by HenryR 5y ago
Companies usually provide the space and will sponsor pizza and drinks, at least in SF. That’s about all the costs beyond the time of the organizers which is offered for free.
5.
by HenryR 6y ago
Where Wizards Stay Up Late ( https://www.amazon.com/Where-Wizards-Stay-Up-Late/dp/0684832... )
6.
Network Load Balancing with Google's Maglev(the-paper-trail.org)
2 points by HenryR 6y ago|0 comments
7.
My notes on AWS’ Physalia database(the-paper-trail.org)
1 points by HenryR 6y ago|0 comments
8.
Failure detection, mitigation and ‘Gray Failures’(the-paper-trail.org)
1 points by HenryR 6y ago|0 comments
9.
Fix Boyer-Moore searcher with the Rytter correction(github.com)
193 points by HenryR 6y ago|53 comments
10.
Good resources for distributed systems design: a Twitter thread(twitter.com)
2 points by HenryR 8y ago|0 comments
11.
by HenryR 8y ago
Authors try to compare their work against hash tables because, usually, HT represent an upper bound on the performance of point-lookups; we don't know how to do much better in general. So if your data structure supports range queries _
12.
Beating hash tables with trees? The ART-ful radix trie(the-paper-trail.org)
152 points by HenryR 8y ago|40 comments
13.
Better than hash tables: in-memory key-value storage with MICA(the-paper-trail.org)
2 points by HenryR 8y ago|0 comments
14.
by HenryR 8y ago
Should be fixed now! (But I've been wrong with css before)
15.
by HenryR 8y ago
Oh yeah that's no good. I'll fix that when I'm back at my computer. Thanks for pointing that out!
16.
by HenryR 8y ago
Yeah, Masstree has settled into the standard set of comparator systems for most research since it was published - and not as a strawman "this system was crap, so let's pretend we've done good work by beating it!" but as
17.
by HenryR 8y ago
I could either figure out how Judy works, or review another three papers :)
18.
by HenryR 8y ago
I don't know of one, but it's such a natural idea that I'd guess it's been studied. There are standard implementations of LRU caches that use e.g. a hash map and a linked list to get both fast lookup and ordering, but fo
19.
by HenryR 8y ago
Author here - if you like this you might also like another paper summary of mine in the same vein: https://news.ycombinator.com/item?id=18132730
20.
by HenryR 8y ago
Here's a recent comparison of Masstree to ART: https://twitter.com/andy_pavlo/status/986647389820747776?s=2... ART looks to be better in most cases. It's on my list of K-V stores to review: https:/
21.
Masstree: A cache-friendly mashup of tries and B-trees(the-paper-trail.org)
165 points by HenryR 8y ago|21 comments
22.
by HenryR 8y ago
I am surprised that anyone is trying to differentiate on storage at this time, precisely when that's the part of the stack that's being cannibalized by the cloud vendors (look at the rate of innovation in HDFS over time; the effor
23.
Outperforming in-memory hash-tables with MICA(the-paper-trail.org)
2 points by HenryR 8y ago|0 comments
24.
Paper notes: Masstree – cache craftiness for fast multicore key-value storage(the-paper-trail.org)
5 points by HenryR 8y ago|0 comments
25.
by HenryR 8y ago
Unfortunately not (my blog is http://the-paper-trail.org but tends to be more theoretical than practical). That would make a good post though!
26.
by HenryR 8y ago
That’s totally a fair point. I could have given a more concrete talk about how I’ve done these things in real systems (and the original version of this talk, presented internally to my company, had more real details and spoke very candidly
27.
How to scale a distributed system [pdf](cdn.oreillystatic.com)
214 points by HenryR 8y ago|10 comments
28.
Distributed Systems Theory for the Distributed Systems Engineer(the-paper-trail.org)
3 points by HenryR 8y ago|0 comments
29.
by HenryR 9y ago
What does the columnar format look like? Particularly, is the group by column compressed with RLE? That’s kind of a pre-computed group-by + count that would make this kind of query very very fast :)
30.
Exactly-once or not, atomic broadcast is still impossible in Kafka(the-paper-trail.org)
3 points by HenryR 9y ago|0 comments

More ›