loading...
Improving Parallel Execution Time of Sorting on Heterogeneous Clusters
Foz do Igua?u, PR - Brazil October 27-October 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CAHPC.2004.2116th Symposium on Computer Architectu ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Christophe C?rin, Universit? de Picardie Jules Verne, France
Michel Koskas, Universit? de Picardie Jules Verne, France
Hazem Fkaier, ?cole Sup?rieure des Sciences et Techniques de Tunis, Tunisie
Mohamed Jemni, ?cole Sup?rieure des Sciences et Techniques de Tunis, Tunisie
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant factor). We develop a constant time technique for mastering processor load balancing and execution time in an heterogeneous environment. We develop an analytical model for the parallel execution time, sustained by preliminary experimental results in the case of a 2-processors systems. The computation of the solution is independent of the problem size. Consequently, there is no overhead regarding the sorting problem.
Index Terms:
in-core parallel sorting algorithms, heterogeneous computing, complexity of parallel algorithms
Citation:
Christophe C?rin, Michel Koskas, Hazem Fkaier, Mohamed Jemni, "Improving Parallel Execution Time of Sorting on Heterogeneous Clusters," sbac-pad, pp.180-187, 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions