|
You are here |
savvinov.com | ||
| | | | |
membarrier.wordpress.com
|
|
| | | | | In the previous post we saw how the memory management unit (MMU) uses page tables to translate virtual addresses into physical ones. We will now consider the various features that such a translation enables in an operating system. In the discussion below, it is important to remember that the granularity of translation is a single... | |
| | | | |
kstefanj.github.io
|
|
| | | | | I've recently spent a lot of time in memory reservation code of the JVM. It started out because we got an external contribution to enable use of multiple large page sizes for Linux. To do this in a good way some other things had to be refactored first. While taking this trip down memory lane I realized that doing a short summary of how large pages are used by the JVM might be an interesting read. | |
| | | | |
thetechsolo.wordpress.com
|
|
| | | | | Knot is a network server as well as Haboob. The difference is the concurrency model: Knot is thread-based, instead Haboob is event-based [9]. Clearly, from the benchmark results, the poll()/epoll() mechanism is a serious bottleneck as soon as the number of active concurrent clients become relevant (in the specific case, at 16384 clients the trashing... | |
| | | | |
cocomelonc.github.io
|
|
| | | |||