Selection on Mesh Connected Computers with

Abstract Mesh connected computers have become attractive models of computing because of their varied special features. In this paper we consider two variations of the mesh model: 1) a mesh with fixed buses, and 2) a mesh with reconfigurable buses. Both these models have been the subject of extensive previous research. The problem of our interest is selection. Selection is a critical comparison problem with numerous applications. Our algorithms have considerably better time bounds than the best known algorithms for selection.