Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing
Download PDF

Abstract

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
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles