In the previous article we looked at how the kernel gives every process its own private view of memory. But memory is only half of what a process needs to actually run. The other half is the CPU itself — and there are only so many CPUs in a machine, while there are usually hundreds or thousands of things that want to run on them. So somebody has to decide, constantly, who gets a CPU and for how long. That somebody is the scheduler. Every few milliseconds, on every core, the kernel asks itself the same question — of everything that wants to run right now, who runs next? — and the answer has to be fast, fair, and good enough that your text editor stays responsive even while a compile is pegging every core.
I promised players of my word game they’d never have to guess. It turned out to rest on a seventy-year-old open problem in information theory: Shannon, confusability graphs, and the number nobody knows.
Free online GIS viewer and converter with no download and no upload required. View Shapefile, GeoJSON, KML, GPX, DXF, GeoParquet and more directly in your browser.
A program that (terribly) attempts to do the same thing that Golfoyle did by fooling people to believe that they were talking to him while it was actually an AI. This one uses the Gemini Flash 2.0 ...