A few words on the content of this article
This article is the result of two semi-independent reflexions on the same topic, federated by Christophe Cerin (the alert reader will recognise three different kinds of writing style in this "heterogeneous" article). I had the privilege of going to Taiwan to present the paper.
Attached to this post, you will find the slides that I used for the presentation.
Citing this publication
This article was published in the proceedings of the GPC 2006 conference, that took place in Taichung, Taiwan, this year.
@InProceedings{cdr06,
author = {Christophe C\'erin and Jean-Christophe Dubacq and Jean-Louis Roch},
title = {Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters},
booktitle = {Advances in Grid and Pervasive Computing},
pages = {175--186},
year = {2006},
editor = {Yeh-Ching Chung and Jos\'{e} E. Moreira},
volume = {3947},
series = {Lecture Notes in Computer Science},
month = may,
publisher = {Springer},
isbn = {3-540-33809-8}
}


(p is the number of processors), independent of the problem size n. Consequently,
there is a small overhead regarding the problem we deal with
but it is inherently limited by the knowing of time complexity of the
portion of code following the partitioning.