Abstract
A reconfigurable bus system is a bus system whose configuration is dynamically changeable. In this paper, using configurational computation, we show that the problems of sorting and computing convex hulls can be solved in O(1) time on two-dimensional (n * m) × (n*[ n m]) processor arrays with reconfigurable bus systems, where n is the problem size and m is any integer between 1 and n. © 1993.