DocumentCode :
282545
Title :
Reducing average access time of a parallel memory in a database environment by data permutation
Author :
Hulina, Paul T. ; Hurson, A.R.
Author_Institution :
Dept. of Electr. & Comput. Eng., Pennsylvania State Univ., University Park, PA, USA
Volume :
i
fYear :
1990
fDate :
2-5 Jan 1990
Firstpage :
65
Abstract :
Optimum use of existing memory bandwidth is needed to reduce the access gap and hence to improve the performance of computer systems in handling I/O-bound applications. For this goal the authors introduce ideas based on data permutation of the tuples in a relational database, which allows parallel access to the database tuples by efficient utilization of the existing memory bandwidth. As a result, several keys can be accessed simultaneously and the validity of several tuples in parallel can be investigated
Keywords :
parallel architectures; parallel machines; relational databases; special purpose computers; storage management; I/O handling; access gap; average access time; computer systems; data permutation; database environment; database tuples; keys; memory bandwidth; parallel access; parallel memory; performance; relational database; simultaneous access; validity; Application software; Bandwidth; Cache memory; Computer applications; Concurrent computing; Data engineering; Degradation; Hardware; Image databases; Relational databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on
Conference_Location :
Kailua-Kona, HI
Type :
conf
DOI :
10.1109/HICSS.1990.205101
Filename :
205101
Link To Document :
بازگشت