> For all its focus on algorithmic performance I found no mention of pipeline stalls, designing for cache performance, branch prediction, multithreading, etc. which are all very fundamental aspects of good performance on modern hardware
Yes, but pure computer science is not worried about that (maybe about multithreading)
But yeah, for a more practical/specific work there are better options (but it's going to be specific to an area)
He writes in that made up assembly language specifically to consider efficiency and implementation concerns:
"Expressing basic methods like algorithms for sorting and searching in machine language makes it possible to carry out meaningful studies of the effects of cache and RAM size and other hardware characteristics (memory speed, pipelining, multiple issue, lookaside buffers, the size of cache blocks, etc.) when comparing different schemes."
Whether he achieves that is another matter.
If you're interested in modern architecture details, I'd recommend Agner Fog's marvelous reference books (http://www.agner.org/optimize/).