Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Z. Guo, R. Melhem, R. Hall, D. Chiarulli, and S. Levitan. Pipelined communication in optically interconnected arrays. Journal of Parallel and Distributed Computing, Vol. 12, No. 3, 269–282(1991).
Z. Guo. Optically interconnected processor arrays with switching capacity. Journal of Parallel and Distributed Computing, Vol. 23, pp. 314–329(1994).
Y. Han, Y. Pan and H. Shen, “Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus,” IEEE Transactions on Computers, Vol. 51, No. 6, pp. 702–707, June 2002.
S. Levitan, D. Chiarulli, and R. Melhem. Coincident pulse techniques for multiprocessor interconnection structures. Applied Optics, Vol. 29, No. 14, 2024–2039(1990).
K. Li, Y. Pan and S. Q. Zheng. Fast and processor efficient parallel matrix multiplication algorithms on a linear array with reconfigurable pipelined bus system. IEEE Transactions on Parallel and Distributed Systems, Vol. 9, No. 8, August 1998, pp. 705–720.
K. Li, Y. Pan, and S. Q. Zheng. Parallel matrix computations using a reconfigurable pipelined optical bus. Journal of Parallel and Distributed Computing, vol. 59, no. 1, pp. 13–30, October 1999.
K. Li, Y. Pan, and S.-Q. Zheng. Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems. The Journal of Supercomputing, vol. 15, no. 2, pp. 163–181, February 2000.
Y. Li, Y. Pan and S.Q. Zheng, “Pipelined time-division multiplexing optical bus with conditional delays,” Optical Engineering, Vol. 36, No. 9, pp. 2417–2424, September 1997.
R. Melhem, D. Chiarulli, and S. Levitan. Space multiplexing of waveguides in optically interconnected multiprocessor systems. The Computer Journal, Vol. 32, No. 4, 362–369(1989)
Y. Pan and M. Hamdi. Quicksort on a linear array with a reconfigurable pipelined bus system. Proc. of IEEE International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 313–319, June 12–14, 1996.
Y. Pan and K. Li. Linear array with a reconfigurable pipelined bus system-concepts and applications, Information Sciences, Vol. 106, No. 3/4, May 1998, pp. 237–258.
Y. Pan. “Basic data movement operations on the LARPBS model,” in Parallel Computing Using Optical Interconnections, K. Li, Y. Pan, and S. Q. Zheng, eds., Kluwer Academic Publishers, Boston, USA, 1998.
S. Pavel and S. G. Akl. Matrix operations using arrays with reconfigurable optical buses. Parallel Algorithms and Applications, Vol. 11, pp. 223–242, 1996.
S. Pavel and S. G. Akl. Integer sorting and routing in arrays with reconfigurable optical bus. Proc. 1996 International Conf. on Parallel Processing, Vol. III, pp. 90–94, August 1996.
C. Qiao, R. Melhem, D. Chiarulli, and S. Levitan. Optical multicasting in linear arrays. International Journal of Optical Computing, Vol. 2, No. 1, 31–48(1991).
S. Sahni. Models and algorithms for optical and optoelectronic parallel computers. Proceedings of the Fourth IEEE International Symposium on Parallel Architectures, Algorithms, and Networks, June 23–25, 1999, Fremantle, Australia, pp. 2–7.
J. L. Trahan, A. G. Bourgeois, Y. Pan, and R. Vaidyanathan. An Optimal and Scalable Algorithm for Permutation Routing on Reconfigurable Linear Arrays with Optically Pipelined Buses. Journal of Parallel and Distributed Computing, Vol. 60, No. 9, Sept. 2000, pp. 1125–1136.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pan, Y. (2003). Computing on the Restricted LARPBS Model. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-37619-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40523-8
Online ISBN: 978-3-540-37619-4
eBook Packages: Springer Book Archive