Site and query scheduling policies in multicomputer database systems

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on knowledge and data engineering 1994-08, Vol.6 (4), p.609-619
Main Authors: Frieder, O., Baru, C.K.
Format: Article
Language:English
Subjects:
Concurrent computing
Database machines
Database systems
Delay
Dynamic scheduling
Heuristic algorithms
Hypercubes
Parallel algorithms
Parallel processing
Runtime
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations.< >
ISSN:1041-4347
1558-2191
DOI:10.1109/69.298176