Abstract
Based on the current fiber optic technology, a new computational model, called a linear array with a reconfigurable pipelined
bus system (LARPBS), is proposed in this paper. A parallel quicksort algorithm is implemented on the model, and its time
complexity is analyzed. For a set of N numbers, the quicksort algorithm reported in this paper runs in O(log, N) average time
on a linear array with a reconfigurable pipelined bus system of size N. If the number of processors available is reduced to P,
where P < N, the algorithm runs in O((N/ P) log, N) average time and is still scalable. Besides proposing a new algorithm
on the model, some basic data movement operations involved in the algorithm are discussed. We believe that these operations
can be used to design other parallel algorithms on the same model. Future research in this area is also identified in this paper.