markpapadakis

24 ms·

1. 151.▲
   by markpapadakis 12y ago

   The fewer the trips to the kernel, the more work you can do in user-space, the fewer the sys-calls, the fewer the context switches, the better the throughput and performance. Even if a request is completely CPU-bound, it’s a good idea to be
2. 152.▲
   by markpapadakis 12y ago

   This is pretty cool. Thanks for sharing.
3. 153.▲
   by markpapadakis 12y ago

   I am familiar with Little's Law. The key concept is optimistic sequential execution. The overwheleming majority of requests do not need to page in cold-data or otherwise stall for too long. Also, in the case where they can stall to e.g
4. 154.▲
   by markpapadakis 12y ago

   This is a C++ implementation. Erlang and other high level languages use Processes(in the case of Erlang) or other such constructs to encapsulate logic and those are indeed scheduled based on either cooperative/preemptive fashion. The m
5. 155.▲
   by markpapadakis 12y ago

   Wired Tiger's storage engine implementation quality is _very_ high. The core developers are experts in the field and really know what they are doing; check the codebase on Github. Integrating that technology in MongoDB will make a big