We study, in this work, the load balancing of sort algorithm executed on a two cluster grid. Our solution is based on data partitioning. We use mainly geometrical interpretations to find out the optimal partition that reduces both communication and computing times in an heterogeneous context
Index Terms:
sort algorithm, data partitioning, grid architecture, load balancing
Citation:
D. Bernardi, C. Cerin, H. Fkaier, M. Jemni, M. Koskas, "Geometrical Interpretation for Data partitioning on a Grid Architecture," hpdc, pp.355-356, 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006