Abstract
The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model based on current optical technology. Due to the unique features of optical buses, new techniques and methods are needed to exploit these features during algorithm design. In this paper, several fast graph algorithms are proposed on the LARPBS model by exploiting several basic data movement operations previously designed for the LARPBS model. We show all these graph algorithms not only have better time complexities than the best algorithms on other realistic models such as the hypercube and arrays with reconfigurable electronic buses, but also use fewer processors. Scalable and efficient algorithms for some graph problems on the LARPBS model are also discussed.
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
S.G. Akl, 1997. Parallel Computation: Models and Methods, Prentice-Hall, Upper Saddle River, New Jersey
Z. Guo, R. Melhem, R. Hall, D. Chiarulli, and S. Levitan, 1991. Pipelined communication in optically interconnected arrays. J. Parallel and Distributed Comp., Vol. 12, No. 3, pp. 269–282.
M. Hamdi, C. Qiao, Y. Pan, and J. Tong, 1999. Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses. J. Parallel and Distributed Comp., Vol. 57, No. 2, pp. 166–187.
Y. Han, Y. Pan and H. Shen, 1999. Fast Parallel Selection on the Linear Array with Reconfigurable Pipelined Bus System, Proc. of 7th IEEE Symp. on the Frontiers of Massively Parallel Computation, Annapolis, MA, pp. 286–293.
S.J. Horng, 1993. Prefix computation and some related applications on meshconnected computers with hyperbus broadcasting. Proc. of 7th Int’l Conf. on Computing and Information, Ontario, Canada, pp. 366–388.
J. JáJá, 1992. An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, Reading, Massachusetts, USA.
S. Levitan, D. Chiarulli, and R. Melhem, 1990. Coincident pulse techniques for multiprocessor interconnection structures. App. Optics, Vol. 29, No. 14, pp. 2024–2039.
K. Li, 1997. Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system. J. of Supercomputing, Vol. 11, No. 4, pp. 391–403.
K. Li, Y. Pan and M. Hamdi, 1999. Solving graph theory problems using reconfigurable pipelined optical buses. Lecture Notes in Comp. Sci., Vol. 1586, pp. 911–923.
K. Li, Y. Pan and S.Q. Zheng, 1998. Fast and processor efficient parallel matrix multiplication algorithms on a linear array with reconfigurable pipelined bus system. IEEE Trans. on Par. and Dist. Sys., Vol. 9, No. 8, pp. 705–720.
K. Li, Y. Pan and S.Q. Zheng, 1999. Fast and efficient parallel matrix computations on a linear array with a reconfigurable pipelined bus system. J. Parallel and Distributed Comp., Vol. 59, No. 10, pp. 13–30.
K. Li, Y. Pan and S.Q. Zheng, 1998. Scalable parallel matrix multiplication using reconfigurable pipelined optical bus systems, 10th IASTED Int’l Conf. on Par. and Dist. Computing and Systems, pp. 238–243.
K. Li, Y. Pan, and S.Q. Zheng. Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems, J. of Supercomputing, to appear.
Y. Li, Y. Pan and S.Q. Zheng, 1997. Pipelined time-division multiplexing optical bus with conditional delays, Optical Eng., Vol. 36, No. 9, pp. 2417–2424.
T.W. Kao and S.J. Horng, 1994. Computing articulation points and bridges in constant time on a RAP. Tech. Report, Dept. of Elect. Eng., National Taiwan Inst. of Tech.
R. Melhem, D. Chiarulli, and S. Levitan, 1989. Space multiplexing of waveguides in optically interconnected multiprocessor systems. The Computer Journal, Vol. 32, No. 4, pp. 362–369
Y. Pan, 1992. Hough transform on arrays with an optical bus. 5th ISMM Int’l Conf. on Par. and Dist. Comp. and Sys., Pittsburgh, PA, pp. 161–166.
Y. Pan, 1994. Order statistics on optically interconnected multiprocessor systems. The 1st Int’l Workshop on Massively Parallel Processing Using Optical Interconnections, Cancun, Mexico, pp. 162–169.
Y. Pan, M. Hamdi, and K. Li, 1998. Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system. Future Generation Computer Systems, Vol. 13, No. 6, pp. 501–513.
Y. Pan and K. Li, 1998. Linear array with a reconfigurable pipelined bus system-concepts and applications. Information Sciences-An International Journal, Vol. 106, No. 3/4, pp. 237–258.
Y. Pan, 1998. 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.
Y. Pan, K. Li, and S.Q. Zheng, 1998. Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system. Parallel Algorithms and Applications, Vol. 13, pp. 1–25.
S. Pavel and S.G. Akl, 1996. On the power of arrays with optical pipelined buses. Proc. 1996 Int’l Conf. on Parallel and Distributed Processing Techniques and App., pp. 1443–1454, Sunnyvale, California.
S. Pavel, 1996. Computation and communication aspects of arrays with optical pipelined buses. Ph.D. Dissertation, Dept. of Comp. and Information Science, Queen’s University, Canada.
S. Pavel and S.G. Akl, 1996. Matrix operations using arrays with reconfigurable optical buses. Parallel Algorithms and Applications, Vol. 11, pp. 223–242.
S. Pavel and S.G. Akl 1996. Integer sorting and routing in arrays with reconfigurable optical bus. Proc. 1996 Int’l Conf. on Parallel Processing, Vol. III, pp. 90–94.
C. Qiao and R. Melhem, 1993. Time-division optical communications in multiprocessor arrays. IEEE Trans. Comput., Vol. 42, No. 5, pp. 577–590.
S. Rajasekaran and S. Sahni, 1997. Sorting, selection and routing on the arrays with reconfigurable optical buses. IEEE Trans. on Parallel and Distributed Systems, Vol. 8, No. 11, pp. 1123–1132.
J.L. Trahan, A.G. Bourgeois, Y. Pan, and R. Vaidyanathan, 1999. Optimally scaling permutation routing on reconfigurable linear arrays with optical buses, Proc. of 2nd Merged IEEE Symp. IPPS/SPDP’ 99, Puerto Rico.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
Pan, Y., Li, Y. (2002). Graph Algorithms on the Linear Array with a Reconfigurable Optical Bus. In: Pollard, A., Mewhort, D.J.K., Weaver, D.F. (eds) High Performance Computing Systems and Applications. The International Series in Engineering and Computer Science, vol 541. Springer, Boston, MA. https://doi.org/10.1007/0-306-47015-2_18
Download citation
DOI: https://doi.org/10.1007/0-306-47015-2_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7774-0
Online ISBN: 978-0-306-47015-8
eBook Packages: Springer Book Archive