Performance implications of virtualisation of massively parallel algorithm implementation

Abstract

In this paper we investigate the accuracy of performance prediction for virtualised implementations of parallel algorithms on massively parallel SIMD architectures. The main contributions of this paper are the adaption and practical evaluation of the best known algorithms for merging and sorting.<>