The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April (1993 vol.5)
pp: 322-338
ABSTRACT
<p>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.</p>
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, "Multiprocessor Join Scheduling", IEEE Transactions on Knowledge & Data Engineering, vol.5, no. 2, pp. 322-338, April 1993, doi:10.1109/69.219739
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool