Static scheduling of synchronous data flow programs for digital signal processing
IEEE Transactions on Computers
ACM Transactions on Database Systems (TODS)
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Random number generators: good ones are hard to find
Communications of the ACM
Effective resource utilization for multiprocessor join execution
VLDB '89 Proceedings of the 15th international conference on Very large data bases
A comparison of list schedules for parallel processing systems
Communications of the ACM
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Scheduling of Page Fetches in Join Operations Using Bc-Trees
Proceedings of the Fourth International Conference on Data Engineering
Processor Scheduling for Multiprocessor Joins
Proceedings of the Fifth International Conference on Data Engineering
Querying very large multi-dimensional datasets in ADR
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Query Processing in Tertiary Memory Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Reordering Query Execution in Tertiary Memory Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Transactions on large-scale data- and knowledge-centered systems II
Transactions on large-scale data- and knowledge-centered systems II
| Hi-index | 0.00 |
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.