| A virtual memory system for a relational associative processor |
| Full text |
Pdf
(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
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 14, Citation Count: 4
|
|
|
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
|
E. A. Ozkarahan , S. A. Schuster , K. C. Smith, RAP: an associative processor for data base management, Proceedings of the May 19-22, 1975, national computer conference and exposition, May 19-22, 1975, Anaheim, California
[doi> 10.1145/1499949.1500024]
|
| |
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
|
|
CITED BY 4
|
|
|
|
|
Stanley Y. W. Su , Hsu Chang , George Copeland , Paul Fisher , Eugene Lowenthal , Stewart Schuster, Database machines and some issues on DBMS standards, Proceedings of the May 19-22, 1980, national computer conference, May 19-22, 1980, Anaheim, California
|
|
|
|
|
|
Sadayuki Hikita , Haruaki Yamazaki , Kiyoshi Hasegawa , Yutaka Matsushita, Optimization of the file access method in content-addressable database access machine (CADAM), Proceedings of the May 4-7, 1981, national computer conference, May 04-07, 1981, Chicago, Illinois
|
|