Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh

There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them the Reconfigurable Mesh (RM) draws much attention because of its simplicity. This paper presents three constant time algorithms to compute the contour of the maximal elements of N planar points on the RM. The first algorithm employs an RM of size N \ThetaN while the second one uses a 3-D RM of size p N \Theta p N \Theta p N . We further extend the result to k-D RM of size N 1=(k\Gamma1) \Theta N 1=(k\Gamma1) \Theta \Delta \Delta \Delta \Theta N 1=(k\Gamma1) . Keywords: Reconfigurable mesh; Parallel algorithm; Computational geometry 1 Introduction It is well known that interprocessor communications and simultaneous memory accesses often act as bottlenecks in present-day parallel machines [1]. Bus systems have been introduced recently to a number of parallel machines to address this problem. Examples include the Bus Automaton [2], the Reconfigurable ..