Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
801 storage: architecture and programming
Chang A., Mergen M. ACM Transactions on Computer Systems6 (1):28-50,1988.Type:Article
Date Reviewed: Oct 1 1988

The paper describes a low-level storage manager that is based on a prototype reduced instruction set computer. The aim is to simplify storage programming by means of a large virtual address space or a one-level-store, a database storage, hardware support for a transaction mechanism (similar to the use of hardware page faults), and a high-level programming language interface to all storage. The storage architecture provides segment registers to expand the virtual address space and an inverted page table for address translation.

Some performance data indicate that “the cost of database storage is not obviously too high” and that “the implementation cost is modest for hardware and software.” Surely, more experience is necessary to exploit the concept properly.

The paper is written very well and it gives much attention to implementation issues. I highly recommend the paper for all people interested in storage architectures, operating systems, or database systems.

Reviewer:  F. Stetter Review #: CR112684
Bookmark and Share
 
Virtual Memory (B.3.2 ... )
 
 
Risc (C.1.1 ... )
 
 
File Systems Management (D.4.3 )
 
 
Language Constructs and Features (D.3.3 )
 
 
Organization And Design (D.4.7 )
 
 
Storage Management (D.4.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Virtual Memory": Date
A survey of microprocessor architectures for memory management
Furht B., Milutinovic V. (ed) Computer 20(3): 48-67, 1987. Type: Article
Jun 1 1988
Uniprocessor Virtual Memory without TLBs
Jacob B., Mudge T. IEEE Transactions on Computers 50(5): 482-499, 2001. Type: Article
Aug 1 2001

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