It seems to me that
- All/any algorithm(s) evolve based on what's feasible on a machine. This is captured within its instruction set.
- By Analogy data structures are closely associated with physical layout of memory hierarchy on a machine including addressing schemes
Is there a non-formal(with/without math) description of the above dependencies in the form of a set of programming experiments with different instruction sets, memory hierarchies and how they impact design of data structures and algorithms that follow?
Few links that I got :
- a paper on "Data Structures in Classical and Quantum Computing"
- Elements of computing systems: Building a modern computer from first principles
(PS: Not thinking of expanding the scope to distributed and/or parallel processing systems)