Title :
Multiprocessor join scheduling
Author :
Murphy, Marguerite C. ; Rotem, Doron
Author_Institution :
Lawrence Berkeley Lab., CA, USA
fDate :
4/1/1993 12:00:00 AM
Abstract :
A practical join processing strategy that allows effective utilization of arbitrary degrees of parallelism in both the I/O subsystem and join processing subsystems is presented. Analytic bounds on the minimum execution time, minimum number of processors, and processor utilization are presented along with bounds on the execution time, given a fixed number of processors. These bounds assume that sufficient buffers are available. An analytic lower bound on buffer requirements as well as a practical heuristic for use in limited buffer environments are also presented. A sampling of corroborative simulation results are included
Keywords :
multiprocessing systems; scheduling; I/O subsystem; analytic lower bound; buffer requirements; corroborative simulation results; join processing subsystems; limited buffer environments; minimum execution time; multiprocessor join scheduling; practical heuristic; practical join processing strategy; processor utilization; Bandwidth; Computer science; Concurrent computing; Costs; Laboratories; Parallel processing; Processor scheduling; Query processing; Sampling methods; System performance;
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
