Space multiplexing of waveguides in optically interconnected multiprocessor systems
The Computer Journal - Special issue on object-oriented programming
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
Optically interconnected processor arrays with switching capability
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Optimally scaling permutation routing on reconfigurable linear arrays with optical buses
Journal of Parallel and Distributed Computing
Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus
IEEE Transactions on Computers
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Models and Algorithms for Optical and Optoelectronic Parallel Computers
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
(C) Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2
Linear array with a reconfigurable pipelined bus system - Concepts and applications
Information Sciences: an International Journal
Repetitions detection on a linear array with reconfigurable pipelined bus system
International Journal of Parallel, Emergent and Distributed Systems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Many algorithms have been designed on models using pipelined optical buses by several research groups. Linear array with a reconfigurable pipelined bus system (LARPBS) is one such model. The results in the literature show that most of the basic operations can be executed in O(1) bus cycles on the LARPBS model. However, since a bus cycle time is proportional to the number of processors attached to it, a bus cycle is not really a constant time when the number of processors is large. In this paper, a more realistic model called restricted-LARPBS (RLARPBS) model is proposed, where a bus cycle can only accommodate a limited number of messages. We use a parameter to characterize this feature. Under the new model, we propose several basic data movement operations. Their time complexities are also analyzed.