richieartoul

13 ms·

121.
by richieartoul 6y ago
I'm biased because I've become great friends with the bradfield founders (Hi Myles and Oz!) since I took all their classes years ago, and recently guest lectured as part of their databases class, but they're basically targete
122.
From coding bootcamp graduate to building distributed databases(richardartoul.medium.com)
114 points by richieartoul 6y ago|44 comments
123.
Don't day trade with your career(richardartoul.substack.com)
4 points by richieartoul 6y ago|0 comments
124.
by richieartoul 6y ago
Its hard to believe because its dead wrong. See my benchmark above.
125.
by richieartoul 6y ago
He was probably scanning elements that were larger than int32s, even on a 2013 this code would run at Gib/s. The point of my benchmark was that C is nowhere near 50-100x faster than Go and that the user I'm replying to shouldn&#x2
126.
by richieartoul 6y ago
Go is not nearly as slow as you're making it seem to be, I dont know what the authors implementation was doing, but this code runs at a rate of 7GiB/s/core on my laptop func BenchmarkFindMax(b *testing.B) { ints := mak
127.
by richieartoul 6y ago
This is actually a really cool idea. I think the people who are saying they don’t want to inject a 3rd party in the middle of their business are missing the point or are working on projects large enough that this doesn’t make sense. A 5-7%
128.
by richieartoul 7y ago
Yeah thats a good point. The use-case I wrote this for involved decoding a protobuf message that has only 3 fields, but where the total size is several MiB. For my workload this optimization is meaningless, the most important thing is to av
129.
by richieartoul 7y ago
Performance is a spectrum and Go hits a sweet spot between ease of development and "good enough" performance by default with enough escape hatches to get "competitive with C/C++" performance in critical paths when n
130.
Show HN: Molecule – Streaming, zero-allocation protobuf decoding in Go(github.com)
70 points by richieartoul 7y ago|18 comments
131.
by richieartoul 7y ago
Chronosphere, a startup founded by two of the early M3 engineers, just raised 11 million dollars to build a monitoring platform based around M3DB: https://techcrunch.com/2019/11/05/chronosphere-launches-with..
132.
by richieartoul 7y ago
This is cool. I built something similar awhile back for a side project. I had a folder that I would dump files into and each file would have a title, description, and SQL statement. When I visited a specific page on my site (password protec
133.
by richieartoul 7y ago
I think you'd be very hard pressed to scale an Elasticsearch cluster to 10s of millions of writes/s without breaking the bank (and even if you had a pile of money to light on fire I don't think an Elasticsearch cluster with t
134.
Time Series and FoundationDB: Millions of writes/s in under 2k lines of Go(github.com)
11 points by richieartoul 7y ago|0 comments
135.
by richieartoul 8y ago
Yep that works too although I didn't benchmark the difference in performance. The nice thing about the worker pool though is that it auto-tunes the stack size based on the workload.
136.
by richieartoul 8y ago
We don't! We only briefly forked the compiler to prove our RCA, but we resolved the issue with a custom worker pool (linked in the blog post). We compile all our code using the same compiler as everyone else :)
137.
by richieartoul 8y ago
We use this https://github.com/m3db/m3/blob/master/src/x/sync/pooled_wor... all over our code base so its definitely stable enough to use in your own projects if you have a need, although
138.
by richieartoul 8y ago
Yeah I think this issue would not have cropped up with the early segmented stack implementation, but segmented stacks had their own issues (which is why the Go team migrated away from them)