DmitryOlshansky

9 ms·

61.
by DmitryOlshansky 6y ago
Started with sway on FreeBSD recently and I love that combo so far.
62.
by DmitryOlshansky 6y ago
My biggest boosters were: - learning more then a few basic hot keys for zsh (things like ctrl-k, ctrl-r and beyond) - mastering tiling window manager, today I can switch, compose, mix and match windows in a blink of any eye - it used to tak
63.
by DmitryOlshansky 6y ago
Writing libraries is a never ending grind of: 1. trying hard to do one thing and do it well (and failing usually), but ... 2. there are many dependencies that you should allow your user to pass explicitly ... 3. and that’s the problem - you
64.
by DmitryOlshansky 6y ago
There are many AWK implementations, OSX I think have subpar AWK. GAWK was fast, last time checked.
65.
by DmitryOlshansky 6y ago
Was about to write something like this myself, thanks for sharing!
66.
by DmitryOlshansky 6y ago
I hope there was an R 2d2 release at some point...
67.
by DmitryOlshansky 6y ago
Rather reliability of sum is a product of reliabilty of constituents (unless redundancy was applied) where reliability is in [0,1.0] range.
68.
by DmitryOlshansky 6y ago
Yes, a simple consequence of e.g. 3-digit number being: 100x + 10y + z modulo 3 Removing 9y and 99x gives equivalence: x + y + z modulo 3 Now what’s left is induction with proper base (1-digit).
69.
by DmitryOlshansky 6y ago
Why not every hour or even half-hour? Provided that you can run multiple builds in parallel but each of them has somehow limited parallelization.
70.
by DmitryOlshansky 6y ago
It’s a great digest, I wouldn’t watch the talk but now I’m certainly more interested. Added talk to the watch later list.
71.
by DmitryOlshansky 7y ago
Or rather the old adege of: “The luck favors the prepared”
72.
by DmitryOlshansky 7y ago
Even broader look on this is which run-time properties the resulting _typical_ code has. Most languages tend to produce a distinct behavior patterns and properties, such as (in no particular order): - multi-threaded / single-threaded
73.
by DmitryOlshansky 7y ago
Or how to elegantly waste a perfectly fine piece of hardware in a neatly over-engineered way ;)
74.
by DmitryOlshansky 7y ago
The problem with most great projects written by small group of brilliant people in any language: - it introduces its own vocabulary, it looks like gibberish until you build up the context - since the group is small and gifted they have no
75.
by DmitryOlshansky 7y ago
E - extended, meaning from 16 to 32 bits. A - accumulator X - wildcard for both upper and lower 8-bit parts, this becomes redundant b/c of E prefix
76.
by DmitryOlshansky 7y ago
Needs honorable mentions to: - Avro - CBOR - SMILE And BSON anyone? I think not much people besides MongoDB using it though. Yes, compressing JSON with gzip-style compressor usually yields 0.5-1% better results then equally compressed binar
77.
by DmitryOlshansky 7y ago
Have been writing in D that has conservative GC for years. Yes, on 32-bit platform false pointers are a problem esp as you get closer to 1g for instance. On the other hand on 64-bit I’ve never seen it at all. The chance of arbitrary long&#x
78.
by DmitryOlshansky 7y ago
> important distinction is that typically GC iterates over something (incurring a cost of O(N)) During _collection_ and N is size of live set, so divided by allocation the cost is amortized and can safely considered as O(1) much like app
79.
by DmitryOlshansky 7y ago
The point is that tracing GC searches for things to keep and assumes the rest is free. Which I believe is the important distinction, and quite often it doesn’t know or care “which allocations to free” because it does it in bulk. That allows
80.
by DmitryOlshansky 7y ago
GC doesn’t search for chunks that can be freed. Also “iteratively” - what do you mean by this? There is no known algorithm for GC that searches for garbage to delete, the way GCs work is exactly opposite - find all live objects (reachable f
81.
by DmitryOlshansky 7y ago
> Trie structure sucks if you have pretty random words. Classic uncompressed trie sucks pretty much in all cases. Now if we go for half-decent implementation of packed variation, it does get significantly better: https://en.wi
82.
by DmitryOlshansky 7y ago
I actually did that once - splitting one NUMA machine into 2 ES instances each isolated to its own socket (numactl etc). Sadly at the time there was a big perf problem with indexingdocuments with 20kb+ binary blobs (non-indexed field) and s
83.
by DmitryOlshansky 7y ago
Not to worry, I’ve been on the other side of open source - being one of maintainers for some parts of D language. It takes a lot of time and effort. Hope to work with you guys on OpenDistro more closely in the future.
84.
by DmitryOlshansky 7y ago
I stand corrected then. I’d certainly need to check my measurements on this one.
85.
by DmitryOlshansky 7y ago
I’m basing it on my limited experience of rewriting things from optimized but messy C++/D to JVM. Yes, the end result is much simpler but is memory hungry and is ~2x slower (after optimizations and tuning). Sometimes you can fit Java i
86.
by DmitryOlshansky 7y ago
The total number of shards per node, across all indices. As far as number of shards per index goes there are many considerations some good ones are outlined in the article.
87.
by DmitryOlshansky 7y ago
Thanks, I appreciate that. I tried reaching out on forums and was assured they’d get to it. I’m used to things going slow in OpenSource so not too worried at this point. Would be lovely to upstream it though, as I’ve patched 2 versions now
88.
by DmitryOlshansky 7y ago
See my other reply on big iron vs small instances (as in 31g of heap “small”). In short there are many variables at play, but without any context generally I’d recommend trying many small instances first. Now depending on your hardware, sca
89.
by DmitryOlshansky 7y ago
Seen that and starred probably half a year ago. Never had the time to dig around and see what it’s like in perf, operations and scalability.
90.
by DmitryOlshansky 7y ago
(Setting aside the fact that Logstash is JRuby/Java app easily eating said gigabytes of heap) Do JSON logs take gigabytes? If they do for you then yes, gigabytes of disk and memory are pretty much guaranteed. Also things tend to pile u

More ›