An efficient skew-insensitive algorithm for join processing on grid architectures
Proceedings of the fifth international workshop on High-level parallel programming and applications
| Hi-index | 0.00 |
This paper presents an analytical comparison of parallel join algorithms in a generalized multiprocessor framework and a simplified, heterogenous Grid Environment. We develop a concise but comprehensive analytical model for the well-known Hash Join algorithm and com- pare it to Nested-Loop and Sort-Merge Join algorithms. We concentrate on a limited number of characteristic param- eters to keep the analytical model clear and focused. We justify that a meaningful model can be built upon only three characteristic parameter sets, describing node processing performance, the I/O and the disk bandwidth, which are the parameters for the optimization the Grid workflow by a smart brokerage mechanism. Based on these results the pa- per proves that by a smart enhancement of the algorithms exploiting the specifics of the Grid the known performance results for a homogenous multi-processor architecture are to be revised for a heterogenous Grid environment.