Mesh connected computers have become attractive models of computing be
cause 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 me
sh with reconfigurable buses. Both these models have been the subject
of extensive previous research. The problem of our interest is selecti
on. Selection is a critical comparison problem with numerous applicati
ons. Our algorithms have considerably better time bounds than the best
known algorithms for selection. (C) 1998 Academic Press.