Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Efficient (stack) algorithms for analysis of write-back and sector memories
Thompson J., Smith A. (ed) ACM Transactions on Computer Systems7 (1):78-117,1989.Type:Article
Date Reviewed: Oct 1 1989

Thompson and Smith describe stack algorithms for the analysis of cache memories. They adopt the view that cache memories occupy one level in a hierarchy of memory types. The authors use trace-driven simulation to extend the stack analysis technique to the write-back and to sector or subblock caches, and they observe that “the ability to collect transfer ratios, considering both reads and writes, for all memory sizes in a single pass reduces simulation time by as much as 90% compared to running 8–10 individual simulations, making this metric much more reasonable to collect.”

This well-illustrated paper excels by virtue of its clarity and completeness. The authors have taken a theoretical approach, and they address an audience of professionals. This subject is of major interest to computer systems designers, especially those working on multiprocessor caches and network file systems.

Reviewer:  D. Grigoras Review #: CR113295
Bookmark and Share
  Featured Reviewer  
 
Design Styles (B.3.2 )
 
 
Memory Control And Access (B.6.1 ... )
 
 
Simulation (B.3.3 ... )
 
 
Performance (D.4.8 )
 
Would you recommend this review?
yes
no
Other reviews under "Design Styles": Date
Microprocessors/microcomputers: architecture, software, and systems (2nd ed.)
Khambata A., John Wiley & Sons, Inc., New York, NY, 1986. Type: Book (9789780471800392)
Dec 1 1988
Design for a multiprocessing heap with on-board reference counting
Wise D. (ed)  Functional programming languages and computer architecture (, Nancy, France,3041985. Type: Proceedings
Aug 1 1986
The science of computing
Denning P. (ed) American Scientist 77(4): 333-335, 1989. Type: Article
Feb 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy