Skip to main content
SpringerLink
Log in

Solving graph theory problems using reconfigurable pipelined optical buses

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1586))

Included in the following conference series:

Abstract

We solve a number of important and interesting problems from graph theory on a linear array with a reconfigurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value finding algorithms, and are currently the fastest algorithms. We also distinguish the two cases where weights have bounded/unbounded magnitude and precision.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Upper Saddle River, New Jersey, 1997.

    Google Scholar 

  2. D. Chiarulli, R. Melhem, and S. Levitan, “Using coincident optical pulses for parallel memory addressing”, IEEE Computer, vol. 30, pp. 48–57, 1987.

    Google Scholar 

  3. E. Dekel, D. Nassimi, and S. Sahni, “Parallel matrix and graph algorithms”, SIAM Journal on Computing, vol. 10, pp. 657–673, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Hamdi, C. Qiao, Y. Pan, and J. Tong, “Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses,” to appear in Journal of Parallel and Distributed Computing.

    Google Scholar 

  5. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, 1992.

    Google Scholar 

  6. S. Levitan, D. Chiarulli, and R. Melhem, “Coincident pulse techniques for multiprocessor interconnection structures”, Applied Optics, vol. 29, pp. 2024–2039, 1990.

    Article  Google Scholar 

  7. K. Li, “Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system”, Journal of Supercomputing, vol. 11, no. 4, pp. 391–403, 1997.

    Article  Google Scholar 

  8. K. Li and V.Y. Pan, “Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system,” Proceedings of IPPS/SPDP ’99, San Juan, Puerto Rico, April 12–16, 1999.

    Google Scholar 

  9. K. Li, Y. Pan, and S.-Q. Zheng, eds., Parallel Computing Using Optical Interconnections, Kluwer Academic Publishers, Boston, Massachusetts, 1998.

    MATH  Google Scholar 

  10. K. Li, Y. Pan, and S.-Q. Zheng, “Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system”, IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 8, pp. 705–720, August 1998.

    Article  Google Scholar 

  11. K. Li, Y. Pan, and S.-Q. Zheng, “Fast and efficient parallel matrix computations on a linear array with a reconfigurable pipelined optical bus system”, in High Performance Computing Systems and Applications, J. Schaeffer ed., pp. 363–380, Kluwer Academic Publishers, Boston, Massachusetts, 1998.

    Google Scholar 

  12. K. Li, Y. Pan, and S.-Q. Zheng, “Efficient deterministic and probabilistic simulations of PRAMs on a linear array with a reconfigurable pipelined bus system,” to appear in Journal of Supercomputing.

    Google Scholar 

  13. B.M. Maggs and S.A. Plotkin, “Minimum-cost spanning tree as a path-finding problem”, Information Processing Letters, vol. 26, pp. 291–293, 1988.

    Article  MathSciNet  Google Scholar 

  14. Y. Pan and M. Hamdi, “Efficient computation of singular value decomposition on arrays with pipelined optical buses”, Journal of Network and Computer Applications, vol. 19, pp. 235–248, July 1996.

    Article  Google Scholar 

  15. Y. Pan, M. Hamdi, and K. Li, “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, June 1998.

    Article  Google Scholar 

  16. Y. Pan and K. Li, “Linear array with a reconfigurable pipelined bus system—concepts and applications”, Journal of Information Sciences, vol. 106, no. 3-4, pp. 237–258, May 1998.

    Article  Google Scholar 

  17. Y. Pan, K. Li, and S.-Q. Zheng, “Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system”, Journal of Parallel Algorithms and Applications, vol. 13, pp. 1–25, 1998.

    MATH  MathSciNet  Google Scholar 

  18. H. Park, H.J. Kim, and V.K. Prasanna, “An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh”, Information Processing Letters, vol. 47, pp.109–113, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  19. S. Rajasekaran and S. Sen, “Random sampling techniques and parallel algorithm design”, in Synthesis of Parallel Algorithms, J.H. Reif, ed., pp. 411–451, Morgan Kaufmann, 1993.

    Google Scholar 

  20. B.-F. Wang, and G.-H. Chen, “Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems”, IEEE Transactions on Parallel and Distributed Systems, vol 1, pp.500–507, 1990.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Math & Computer Sci., State Univ. of New York, 12561, New Paltz, NY

    Keqin Li

  2. Dept. of Computer Science, University of Dayton, 45469, Dayton, OH

    Yi Pan

  3. Dept. of Computer Sci., Hong Kong Univ. of Sci. & Tech., Kowloon, Hong Kong

    Mounir Hamdi

Authors
  1. Keqin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mounir Hamdi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Li, K., Pan, Y., Hamdi, M. (1999). Solving graph theory problems using reconfigurable pipelined optical buses. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097976

Download citation

  • DOI: https://doi.org/10.1007/BFb0097976

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation