3 ms·
Closely related but unfamiliar to most software geeks, Bélády's work in the 1960s and later on the theoretical limits of operation throughput when using cache h
by jandrewrogers 10y ago
Closely related but unfamiliar to most software geeks, Bélády's work in the 1960s and later on the theoretical limits of operation throughput when using cache hierarchies is very relevant to high-performance software design. The theory generalizes nicely to any topology where you can control how access latencies are distributed, and carefully designed software can get relatively close to the throughput limits (though it is somewhat incompatible with the way most software engineers design systems these days e.g. multithreaded concurrency is a non-starter).
- infinite8s 10y agoDo you think something like lightweight modular staging (https://scala-lms.github.io/ https://scala-lms.github.io/) would allow fairly high level code to get to the theoretical limit?