3 ms·
It looks from the article that this results in bounded-time concurrent reads and writes, even in the worst case, as long as resizes can complete often enough to
by bcoates 12y ago
It looks from the article that this results in bounded-time concurrent reads and writes, even in the worst case, as long as resizes can complete often enough to not be overwhelmed by the writers, is that correct?
This looks huge for smoothing the latency spikes out of software networking on Linux.
- JoshTriplett 12y ago> It looks from the article that this results in bounded-time concurrent reads and writes, even in the worst case, as long as resizes can complete often enough to not be overwhelmed by the writers, is that correct? Mostly so, yes. Writers can still contend with each other, but that's less critical on a read-heavy data structure.