ACM Home Page
Please provide us with feedback. Feedback
A virtual memory system for a relational associative processor
Full text PdfPdf (944 KB)
Source AFIPS Joint Computer Conferences archive
Proceedings of the June 7-10, 1976, national computer conference and exposition table of contents
New York, New York
SESSION: Science and technology: computer and data base architecture table of contents
Pages 855-862  
Year of Publication: 1976
Authors
S. A. Schuster  University of Toronto, Toronto, Ontario, Canada
E. A. Ozkarahan  University of Toronto, Toronto, Ontario, Canada
K. C. Smith  University of Toronto, Toronto, Ontario, Canada
Sponsor
AFIPS : American Federation of Information Processing Societies
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 14,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1499799.1499915
What is a DOI?

ABSTRACT

The Relational Associative Processor (RAP) is an experimental "backend" cellular processor for implementing data base management systems. RAP is particularly well suited to supporting Codd's relational model of data. The capacity of a RAP device implemented with current IC and memory technology can be estimated to contain 108 to 109 bits of associatively processable data. Because many data bases are larger, a virtual memory environment for RAP has been proposed and its performance simulated. The environment incorporates conventional memories for bulk storage and a single RAP processor---both controlled by a general purpose front-end computer. The system requires that the entire relational data base be divided into pages of size equal to one RAP cell memory. A buffer memory is added to RAP to permit the overlap of paging with processing. It has been found that user environments containing small relations or queries exhibiting either long processing times relative to paging requirements or some "locality" (defined as the degree to which sequences of queries reference some relations more than others) can efficiently page data between large data bases and data base machines without significant losses in performance.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Ozkarahan, E. A., S. A. Schuster and K. C. Smith, A Data Base Processor, CSRG-43, Computer Systems Research Group, University of Toronto, September 1974.
3
 
4
 
5
Nakano, R., A Simulator for a RAP Data Management System, M.Sc. Thesis, Department of Computer Science, University of Toronto, 1976.
 
6
Ozkarahan, E. A., S. A. Schuster and K. C. Sevcik, Performance Evaluation of a Relational Associative Processor, CSRG-65, Computer Systems Research Group, University of Toronto, January 1976.
7
8
9
10

Collaborative Colleagues:
S. A. Schuster: colleagues
E. A. Ozkarahan: colleagues
K. C. Smith: colleagues