Parallel Database Sort and Join Operations Revisited on Grids

Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join and Sort Merge Join algorithm in a Grid Environment. We concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. Based on these results the paper proves that by smart enhancement exploiting the specifics of the Grid the performance of the algorithms can be increased and some results of Bitton et al. for a homogenous multi-processor architecture are to be invalidated and reversed.

• Type: Conference
• Year: 2007
• Where: HPCC
• Authors: Werner Mach, Erich Schikuta
• Keywords: Binary Merge Sort, Bitton Et Al, Distributed And Parallel Computing, HPCC 2007, Sort Merge Join