|title:||Edit Distance on GPU clusters using MPI|
|keywords:||GPU Clusters, MPI, GPU programming|
|topics:||Algorithms and Data Structures|
In this paper, we describe a verified implementation of the Levenshtein distance problem on a GPU cluster using MPI and OpenCL. The implementation is based on an existing verified single GPU implementation. The speed of the implementation is higher on a cluster, but the efficiency is affected by the overhead, which is caused by the extra communication between nodes.