The Parallel Hierarchical Memory Model

Modern computer systems usually have a complex memory system consisting of increasingly larger and slower memory. Traditional computer models like the Random Access Machine (RAM) have no concept of memory hierarchy, making it inappropriate for an accurate complexity analysis of algorithms on these types of architectures.

[1]  Alok Aggarwal,et al.  Hierarchical memory with block transfer , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[2]  Andrew Chin.  Complexity models for all-purpose parallel computation , 1993 .

[3]  Ben H. H. Juurlink,et al.  Experiences with a model for parallel computation , 1993, PODC '93.

[4]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[5]  Alan Jay Smith,et al.  Cache Memories , 1982, CSUR.

[6]  H. T. Kung,et al.  I/O complexity: The red-blue pebble game , 1981, STOC '81.

[7]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[8]  Bowen Alpern,et al.  A model for hierarchical memory , 1987, STOC.