DATA MOVEMENT TECHNIQUES ON RECONFIGURABLE MESHES, WITH APPLICATIONS
Stephan Olariu, James L. Schwing, Jingyuan Zhang · International Journal of High Speed Computing · 1994
Data movement operations are central to many efficient algorithms for parallel machines constructed as interconnection networks of processors. The purpose of this work is to present a number of basic data movement techniques for reconfigurable meshes. These include computing the prefix maxima of a sequence of real numbers and computing the prefix sums of a binary sequence. The data movement techniques presented in this paper have far-reaching applications. Among them, we present a new sorting algorithm and an efficient algorithm to find all maximal elements of a planar set of points.