Issue No. 04 - July-August (1997 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.617058
<p><b>Abstract</b>—Recently, a number of hybrid systems have been proposed to combine the advantages of shared nothing and shared everything concepts for computing relational join operations. Most of these proposed systems, however, presented a few analytical results and have produced limited or no implementations on actual multiprocessors. In this paper, we present a parallel join algorithm with load-balancing for a hybrid system that combines both shared-nothing and shared-everything architectures. We derive an analytical model for the join algorithm on this architecture and validate it using both hardware/software simulations and actual experimentations. We study the performance of the join on the hybrid system for a wide range of system parameter values. We conclude that the hybrid system outperforms both shared-nothing and shared-everything architectures.</p>
Relational join, parallel processing, shared-nothing architecture, shared-everything architecture, load-balancing.
S. Pramanik and W. R. Tout, "The NUMA with Clusters of Processors for Parallel Join," in IEEE Transactions on Knowledge & Data Engineering, vol. 9, no. , pp. 653-660, 1997.