Processor Allocation Strategies for Multiprocessor Database Machines,

Abstract

In this paper we describe and evaluate four alternative strategies for assigning processors to queries in multiprocessor database machines. Our results demonstrate that SIMD database machines are indeed a poor design when their performance is compared with that of the three MIMD strategies which we present. We also introduce the application of data-flow machine techniques to the processing of relational algebra queries. This strategy is shown to be superior to the other strategies described by several experiments. Furthermore, if the data-flow query processing strategy is employed, our 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. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1979
Accession Number
ADA105116

Entities

People

  • David J. Dewitt
  • Haran Boral

Organizations

  • University of Wisconsin Madison Department of Computer Science

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Computer Science
  • Computers
  • Computing Devices
  • Data Storage Systems
  • Databases
  • Mass Storage
  • Multiprocessors
  • Plastic Explosives
  • Three Dimensional
  • United States
  • Wisconsin

Fields of Study

  • Computer science
  • Engineering

Readers

  • Computational Linguistics
  • Parallel and Distributed Computing.