Adaptive AT2 Optimal Algorithms on reconfigurable meshes

Abstract

Recently a few self-simulation algorithms have been developed to execute algorithms on a reconfigurable mesh (RM) of size smaller than recommended in those algorithms. Optimal slowdown, in self-simulation, has been achieved with the compromise that the resultant algorithms fail to remain AT2 optimal. In this paper we have introduced, for the first time, the idea of adaptive algorithm which runs on RM of variable sizes without compromising the AT2 optimality. We have supported our idea by developing adaptive algorithms, for sorting items and computing the contour of maximal elements of a set of planar points on RM. We have also conjectured that to obtain an AT2 algorithm to solve a problem of size n with I(n) information content on an RM of size p x q where pq=kI(n), it is sufficient to form buses of length O (k). Show more