Performance analysis of a parallel sort merge join on cluster architectures

  • Authors:
  • Erich Schikuta

  • Affiliations:
  • Research Lab on Computational Technologies and Applications, Institute of Knowledge and Business Engineering, University of Vienna, Vienna, Austria

  • Venue:
  • ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We developed a concise but comprehensive analytical model for the well-known sort merge Join algorithm on cost effective cluster architectures. We try to concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. We believe that a meaningful model can be built upon only three characteristic parameter sets, describing main memory size, the I/O bandwidth and the disk bandwidth. We justify our approach by a practical implementation and a comparison of the theoretical to real performance values.