Processor Allocation Strategies for Multiprocessor Database Machines.

@article{DBLP:journals/tods/BoralD81,
  author    = {Haran Boral and
               David J. DeWitt},
  title     = {Processor Allocation Strategies for Multiprocessor Database Machines},
  journal   = {ACM Trans. Database Syst.},
  volume    = {6},
  number    = {2},
  year      = {1981},
  pages     = {227-254},
  ee        = {http://doi.acm.org/10.1145/319566.319570, db/journals/tods/BoralD81.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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 decribed 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.

Copyright © 1981 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-1 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

...

[2]

Edward Babb: Implementing a Relational Database by Means of Specialized Hardware. ACM Trans. Database Syst. 4(1): 1-29(1979) BibTeX

[3]

Jayanta Banerjee, David K. Hsiao, Krishnamurthi Kannan: DBC - A Database Computer for Very Large Databases. IEEE Trans. Computers 28(6): 414-429(1979) BibTeX

[4]

Mike W. Blasgen, Kapali P. Eswaran: Storage and Access in Relational Data Bases. IBM Systems Journal 16(4): 362-377(1977) BibTeX

[5]

Haran Boral, David J. DeWitt: Design Considerations for Data-flow Database Machines. SIGMOD Conference 1980: 94-104 BibTeX

[6]

...

[7]

A. L. Davis: The Architecure and System Method of DDM1: A Recursively Structured Data Driven Machine. ISCA 1978: 210-215 BibTeX

[8]

Jack B. Dennis, David Misunas: A Preliminary Architecture for a Basic Data Flow Processor. ISCA 1974: 126-132 BibTeX

[9]

David J. DeWitt: DIRECT - A Multiprocessor Organization for Supporting Relational Data Base Management Systems. ISCA 1978: 182-189 BibTeX

[10]

David J. DeWitt: DIRECT - A Multiprocessor Organization for Supporting Relational Database Management Systems. IEEE Trans. Computers 28(6): 395-406(1979) BibTeX

[11]

David J. DeWitt: Query Execution in DIRECT. SIGMOD Conference 1979: 13-22 BibTeX

[12]

...

[13]

Paula B. Hawthorn, David J. DeWitt: Performance Analysis of Alternative Database Machine Architectures. IEEE Trans. Software Eng. 8(1): 61-75(1982) BibTeX

[14]

Paula B. Hawthorn, Michael Stonebraker: Performance Analysis of a Relational Data Base Management System. SIGMOD Conference 1979: 1-12 BibTeX

[15]

C. A. R. Hoare: Monitors: An Operating System Structuring Concept. Commun. ACM 17(10): 549-557(1974) BibTeX

[16]

...

[17]

...

[18]

Esen A. Ozkarahan, Stewart A. Schuster, Kenneth C. Sevcik: Performance Evaluation of a Relational Associative Processor. ACM Trans. Database Syst. 2(2): 175-195(1977) BibTeX

[19]

James E. Rumbaugh: A Data Flow Multiprocessor. IEEE Trans. Computers 26(2): 138-146(1977) BibTeX

[20]

...

[21]

D. L. Slotnick: Logic per Track Devices. Advances in Computers 10: 291-296(1970) BibTeX

[22]

John Miles Smith, Philip Yen-Tang Chang: Optimizing the Performance of a Relational Algebra Database Interface. Commun. ACM 18(10): 568-579(1975) BibTeX

[23]

...

[24]

Michael Stonebraker, Eugene Wong, Peter Kreps, Gerald Held: The Design and Implementation of INGRES. ACM Trans. Database Syst. 1(3): 189-222(1976) BibTeX

[25]

Stanley Y. W. Su, G. Jack Lipovski: CASSM: A Cellular System for Very Large Data Bases. VLDB 1975: 456-472 BibTeX

[26]

S. Bing Yao: Optimization of Query Evaluation Algorithms. ACM Trans. Database Syst. 4(2): 133-155(1979) BibTeX

Referenced by

1. John L. Pfaltz, Russell F. Haddleton, James C. French: Scalable, Parallel, Scientific Databases. SSDBM 1998: 4-11
2. Margaret H. Eich, David L. Wells: Database Concurrency Control Using Data Flow Graphs. ACM Trans. Database Syst. 13(2): 197-227(1988)
3. Hidetoshi Monoi, Yukihiro Morita, Hidenori Itoh, Hiroshi Sakai, Shigeki Shibayama: Parallel Control Technique and Performance of an MPPM Knowledge-Base Machine. ICDE 1988: 210-217
4. Rakesh Agrawal, David J. DeWitt: Recovery Architectures for Multiprocessor Database Machines. SIGMOD Conference 1985: 131-145
5. Paula B. Hawthorn: The Effect of Target Applications on the Design of Database Machines. SIGMOD Conference 1981: 188-197
6. Haran Boral, David J. DeWitt: Design Considerations for Data-flow Database Machines. SIGMOD Conference 1980: 94-104