Skip to main content
SpringerLink
Log in

More Efficient Topological Sort Using Reconfigurable Optical Buses

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Topological sort of an acyclic graph has many applications such as job scheduling and network analysis. Due to its importance, it has been tackled on many models. Dekel et al. [3], proposed an algorithm for solving the problem in O(log2 N) time on the hypercube or shuffle-exchange networks with O(N 3) processors. Chaudhuri [2], gave an O(log N) algorithm using O(N 3) processors on a CRCW PRAM model. On the LARPBS (Linear Arrays with a Reconfigurable Pipelined Bus System) model, Li et al. [5] showed that the problem for a weighted directed graph with N vertices can be solved in O(log N) time by using N 3 processors. In this paper, a more efficient topological sort algorithm is proposed on the same LARPBS model. We show that the problem can be solved in O(log N) time by using N 3/log N processors. We show that the algorithm has better time and processor complexities than the best algorithm on the hypercube, and has the same time complexity but better processor complexity than the best algorithm on the CRCW PRAM model.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

  2. P. Chaudhuri. Parallel Algorithms: Design and Analysis. Prentice-Hall of Australia, 1992.

  3. E. Dekel, D. Nassimi, and S. Sahni. Parallel matrix and graph algorithms. SIAM Journal on Computing, 10:857-675, 1981.

    Google Scholar 

  4. Joseph JáJá. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, Reading, Massachusetts, 1992.

    Google Scholar 

  5. K. Li. Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system. Journal of Supercomputing, 11(4):391-403, 1997.

    Google Scholar 

  6. 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, 9(8):705-720, 1998.

    Google Scholar 

  7. K. Li, Y. Pan, and M. Hamdi. Solving graph theory problems using reconfigurable pipelined optical buses. Parallel Computing, 26(6):723-735, 2000.

    Google Scholar 

  8. J. Ma, K. Iwama, T. Takaoka, and Q.-P. Gu. Efficient parallel and distributed topological sort algorithms. In Proc. 2nd Aizu International Symp. on Parallel Algorithms/Architecture Synthesis, pp. 378-383, 1997.

  9. R. Melhem, D. Chiarulli, and S. Levitan. Space multiplexing of waveguides in optically interconnected multiprocessor systems. The Computer Journal, 32(4):362-369, 1989.

    Google Scholar 

  10. Y. Pan and K. Li. Linear array with a reconfigurable pipelinedbus system—concepts and applications. Information Sciences—An International Journal, 106(3/4):237-258, 1998. A preliminary version appeared In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. III, pp. 1431-1442, August 1996.

    Google Scholar 

  11. S. Pavel and S. G. Akl. On the power of arrays with optical pipelined buses. In Proc. 1996 International Conf. on Parallel and Distributed Processing Techniques and Applications, pp. 1443-1454, Sunnyvale, California, Aug. 1996.

  12. S. Pavel and S. G. Akl. Matrix operations using arrays with reconfigurable optical buses. Parallel Algorithms and Applications, 11:223-242, 1996.

    Google Scholar 

  13. S. Pavel and S. G. Akl. Integer sorting androuting in arrays with reconfigurable optical bus. In Proc. 1996 International Conf. on Parallel Processing, Vol. III, pp. 90-94, August 1996.

    Google Scholar 

  14. S. Rajasekaran and S. Sahni. Sorting, selection and routing on the arrays with reconfigurable optical buses. IEEE Transactions on Parallel and Distributed Systems, 8(11):1123-1132, 1997.

    Google Scholar 

  15. 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, 1:500-507, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba Science City, Ibaraki, 305-8573, Japan

    Jie Li

  2. Department of Computer Science, Georgia State University, Atlanta, GA, 30303, USA

    Yi Pan

  3. Graduate School of Information Science, Japan Advanced Institute of Science & Technology, Tatsunokuchi, Ishikawa, 923-1292, Japan

    Hong Shen

Authors
  1. Jie 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. Hong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, J., Pan, Y. & Shen, H. More Efficient Topological Sort Using Reconfigurable Optical Buses. The Journal of Supercomputing 24, 251–258 (2003). https://doi.org/10.1023/A:1022080713267

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022080713267

Search

Navigation