Multiprocessor Join Scheduling

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

[1]  T. H. Merrett,et al.  Scheduling of Page-Fetches in Join Operations , 1981, VLDB.

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Hon Fung Li,et al.  Scheduling of page fetches in join operations using B/sub c/-trees , 1988, Proceedings. Fourth International Conference on Data Engineering.

[4]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[5]  Patrick Valduriez,et al.  Join indices , 1987, TODS.

[6]  Doron Rotem,et al.  Effective Resource Utilization for Multiprocessor Join Execution , 1989, VLDB.

[7]  Walter H. Kohler,et al.  A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems , 1975, IEEE Transactions on Computers.

[8]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.

[9]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[10]  D. Rotem,et al.  Processor scheduling for multiprocessor joins , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[11]  K. Mani Chandy,et al.  A comparison of list schedules for parallel processing systems , 1974, Commun. ACM.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Eduardo B. Fernández,et al.  Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules , 1973, IEEE Transactions on Computers.

[14]  C. V. Ramamoorthy,et al.  Optimal Scheduling Strategies in a Multiprocessor System , 1972, IEEE Transactions on Computers.