ACM Home Page
Please provide us with feedback. Feedback
Processor allocation strategies for multiprocessor database machines
Full text PdfPdf (1.75 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 6 ,  Issue 2  (June 1981) table of contents
Pages: 227 - 254  
Year of Publication: 1981
ISSN:0362-5915
Authors
Haran Boral  Univ. of Wisconsin-Madison, Madison
David J. DeWitt  Univ. of Wisconsin-Madison, Madison
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   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/319566.319570
What is a DOI?

ABSTRACT

In this paper four alternative strategies for assigning processors to queries in multiprocessor database machines are described and evaluated. The results demonstrate that SIMD database machines are indeed a poor design when their performance is compared with that of the three MIMD strategies presented. Also introduced is the application of data-flow machine techniques to the processing of relational algebra queries. A strategy that employs data-flow techniques is shown to be superior to the other strategies described by several experiments. Furthermore, if the data-flow query processing strategy is employed, the results indicate that a two-level storage hierarchy (in which relations are paged between a shared data cache and mass storage) does not have a significant impact on 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
ARVlND, AND GOSTELOW, K.P. A computer capable of exchanging processors for time. Information Processing 77: Proc. IFIP Congr. 77, B. Gilchrist, Ed. North-Holland, New York, Aug. 1977, pp. 849-853.
2
 
3
BANEI~JEE, J., HSIAO, D.K., AND KANNAN, K. DBC--A database computer for very large databases. IEEE Trans. Comput. C-28, 6 (June 1979), 414-429.
 
4
BLASGEN, M.W., AND ESWARAN, K.P. Storage and access in relational data bases. IBM Syst. J. 16, 4 (1977), 363-378.
5
 
6
C~ESSON, G. Personal communication.
7
8
9
 
10
DEWITT, D.J. DIRECT--A multiprocessor organization for supporting relational database management systems. IEEE Trans. Comput. C-28, 6 (June 1979), 395-406.
11
 
12
DIGITAL EQUIPMENT CORPORATION, Maynard, Mass., Microcomputer Handbook, 1977.
 
13
HAWTHORN, P.B., AND DEWITT, D.J. Performance analysis of alternative database machine architectures. Comput. Sci. Tech. Rep. 383, Univ. Wisconsin, March 1980; submitted to IEEE Trans. Softw. Eng.
14
15
 
16
LORIE, R.A. Personal communication.
 
17
OZKA~aHAN, E.A., SCHISSTEa, S.A., AND SMITH, K.C. RAP--Associative processor for database management. AFIPS Conf. Proc., vol. 44, AFIPS Press, Arlington, Va., I975, pp. 379-388.
18
 
19
RUMBAUGH, J.E. A data flow multiprocessor. IEEE Trans. Cornput. C-26, 2 (Feb. 1977), 138-146.
 
20
SCHUSTER, S.A., OZKARAHAN, E.A., AND SMITH, K.C. A virtual memory system for a relational associative processor. In Proc. 1976 Nat. Computer Conf., AFIPS Press, Arlington, Va., pp. 855-862.
 
21
SLOTNIK, D.L. Logic per track devices. In Advances in Computers, vol. 10. F. Alt, Ed. Academic Press, New York, 1970, pp. 291-296.
22
 
23
STONEBRAKER, M. Personal communication.
24
 
25
Su, S.Y.W., AND LIPOVSKI, G.J. CASSM: A cellular system for very large databases. In Proc. Conf. Very Large Databases, 1975, pp. 456-472.
26


Collaborative Colleagues:
Haran Boral: colleagues
David J. DeWitt: colleagues