Site and query scheduling policies in multicomputer database systems

Author

Frieder, Ophir ; Baru, Chaitanya K.

Author_Institution

Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA

Volume

6

Issue

4

fYear

1994

fDate

8/1/1994 12:00:00 AM

Firstpage

609

Lastpage

619

Abstract

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

Keywords

database theory; distributed databases; distributed memory systems; hypercube networks; multiprocessing programs; parallel algorithms; dynamic site allocation; hypercube interconnection; initiation delays; interquery concurrency; multicomputer database systems; operation sequence trees; query completion times; query scheduling policies; query trees; read-only queries; run-time issues; site allocation; Concurrent computing; Database machines; Database systems; Delay; Dynamic scheduling; Heuristic algorithms; Hypercubes; Parallel algorithms; Parallel processing; Runtime;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.298176

Filename

298176