This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiprocessor Join Scheduling
April 1993 (vol. 5 no. 2)
pp. 322-338

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. L. Adam, K. M. Chandy, and J. R. Dickson, "A comparison of list schedules for parallel processing systems,"Commun. ACM, vol. 17, no. 12, pp. 685-690, Dec. 1974.
[2] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[3] D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computations. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[4] M. W. Blasgen and K. P. Eswaran, "On the evaluation of queries in a relational data base system," Tech. Rep. RJ18 745 (25 553), IBM Research, Comput. Sci., San Jose, Apr. 8, 1976.
[5] E. B. Fernandez and B. Bussell, "Bounds on the number of processors and time for multiprocessor optimal schedules,"IEEE Trans. Comput., vol. C-22, pp. 745-751, 1973.
[6] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[7] P. Goyal H. F. Li, E. Regener, and F. Sadri. "Scheduling of page fetches in join operations using Bc-trees," inProc. 4th Int. Conf. on Data Engineering, Los Angeles, CA, 1988.
[8] W. H. Kohler, "A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems,"IEEE Trans. Comput., pp. 1235-1238, Dec. 1975.
[9] A. M. Law and W. David Kelton,"Simulation Modeling and Analysis. New York: McGraw-Hill, 1982.
[10] E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing,"IEEE Trans. Comput., vol. C-36, no. 1, pp. 24-35, Jan. 1987.
[11] T. Merrett, Y. Kambayashi, and H. Yasuura, "Scheduling of page-fetches in join operations," inProc. 7th Int. Conf. on Very Large Data Bases, Cannes, France, 1981.
[12] M. C. Murphy and D. Rotem, "Effective resource utilization for multiprocessor join execution," inVery Large Data Bases. Amsterdam, The Netherlands: 1989.
[13] M. C. Murphy and D. Rotem, "Processor scheduling for multiprocessor joins," presented at Fifth Int. Conf. on Data Engineering, Los Angeles, CA, 1989.
[14] S. K. Park and K. W. Miller, "Random number generators: Good ones are hard to find,"Commun. ACM, vol. 31, pp. 1192-1201, Oct. 1988.
[15] C. V. Ramamoorthy, K. M. Chandy, and M. J. Gonzalez, "Optimal scheduling strategies in a multiprocessor system,"IEEE Trans. Comput., vol. C-21, pp. 137-146, 1972.
[16] Sequent Computer and Codd&Date Associates, "Combining the benefits of relational database technology and parallel computing," presented at Technical Seminar, San Francisco, CA, Sept. 28, 1988.
[17] Sequent Computer Systems, "Symmetry technical summary," Product Documentation 1003-4447 Rev. A, 1987.
[18] C. Y. T. Tam, "Object oriented simulation of multiprocessor join scheduling algorithms," M.S. thesis, Francisco State Univ., June 1990.
[19] P. Valduriez, "Join indices,"ACM Trans. Database Syst., vol. 12, pp. 218-246, June 1987.

Index Terms:
multiprocessor join scheduling; practical join processing strategy; I/O subsystem; join processing subsystems; minimum execution time; processor utilization; analytic lower bound; buffer requirements; practical heuristic; limited buffer environments; corroborative simulation results; multiprocessing systems; scheduling
Citation:
M.C. Murphy, D. Rotem, "Multiprocessor Join Scheduling," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 2, pp. 322-338, April 1993, doi:10.1109/69.219739
Usage of this product signifies your acceptance of the Terms of Use.