Skip to main content
SpringerLink
Log in

Solving some combinatorial problems on arrays with one-way dataflow

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we present algorithms for solving some combinatorial problems on one-dimensional processor arrays in which data flows in only one direction through the array. The problems we consider are: ranking the elements in a chain of sizen, rooting a spanning tree withn vertices, and computing biconnected components of a connected graph withn vertices. We show that each of these problems can be solved using arrays of sizen in which the data enters at the first cell and flows through the array in only one direction until it leaves the last cell as output. We also show how the biconnectivity algorithm for the array yields a new sequential algorithm for computing biconnected components which uses onlyO(n) locations of random access memory.

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. Ashtaputre, Data structures for solving graph problems on a one-dimensional array, Master's Thesis, Computer Studies, North Carolina State University, Raleigh, NC, 1983.

    Google Scholar 

  2. M. J. Atallah and S. E. Hambrusch, Solving tree problems on a mesh-connected processor array,Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science, pp. 222–231, October 1985.

  3. M. J. Atallah and S. R. Kosaraju, Graph problems on a mesh-connected processor array,J. Assoc. Comput. Mach., Vol. 31, No. 3, pp. 649–667, July 1984.

    MATH  MathSciNet  Google Scholar 

  4. S. Ashtaputre and C. Savage, Data structures for solving graph problems on a one-dimensional array, extended abstract,Proc. Conf. on Information Sciences and Systems, Princeton University, 1982.

  5. S. Ashtaputre and C. Savage, Systolic arrays with embedded tree structures for connectivity problems,IEEE Trans. Comput., Vol. C-34, No. 5, pp. 483–484, May 1985.

    Article  Google Scholar 

  6. B. Bollobas and I. Simon, On the expected behavior of disjoint set union algorithms,Proc. 17th Ann. ACM Symp. on Theory of Computing, pp. 224–231, April 1985.

  7. K. A. Doshi and P. J. Varman, Optimal graph algorithms on a fixed-size linear array,IEEE Trans. Comput., Vol. C-36, pp. 460–470, 1987.

    Article  Google Scholar 

  8. S. E. Hambrusch, Parallel algorithms for bridge and bi-connectivity on minimum area meshes,Proc. 1985 NCC, AFIPS Press, pp. 319–327.

  9. S. R. Kosaraju and M. J. Atallah, Optimal simulations between mesh-connected arrays of processors,Proc. 18th Ann. ACM Symp. on Theory of Computing, pp. 264–272, May 1986.

  10. B. Krishnaprasad and C. Pandu Rangan, Inverted spanning tree paradigm on systolic arrays,Proc. Int. Workshop on Systolic Arrays, University of Oxford, pp. L1.2–L1.10, July 1986. (Also: Technical Report, Department of Computer Science and Engineering, Indian Institute of Technology, Madras.)

  11. D. E. Knuth and A. Schönhage, The expected linearity of a simple equivalence algorithm,Theoret. Comput. Sci, Vol. 6, pp. 281–315, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  12. C. Savage, Maximum matchings and trees,Inform. Process. Lett., Vol. 10, pp. 202–205, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  13. C. D. Savage, M. F. M. Stallmann, and A. Z. Kotob, Simulation of two-way computations on arrays with one-way dataflow. Technical Report CCSP-TR-87/6, Center for Communications and Signal Processing, North Carolina State University, Raleigh, NC, 1987.

    Google Scholar 

  14. R. E. Tarjan, Depth-first search and linear time graph algorithms,SIAM J. Comput., Vol. 1, No. 2, pp. 146–160, June 1972.

    Article  MATH  MathSciNet  Google Scholar 

  15. R. E. Tarjan, On the efficiency of a good but not linear set merging algorithm,J. Assoc. Comput. Mach., Vol. 22, No. 2, pp. 215–225, 1975.

    MATH  MathSciNet  Google Scholar 

  16. M. Tchuente and L. Melkemi, Reseaux systoliques pour le calcul des composantes connexes et la triangularisation des matrices bandes, Research Report No. 366, Laboratoire d'Informatique et de Mathematiques Appliquees de Grenoble, March 1983.

  17. R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm,SIAM J. Comput., Vol. 14, No. 4, pp. 862–874, November 1985.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, North Carolina State University, 27695-8206, Raleigh, NC, USA

    Carla D. Savage, Matthias Stallmann & Jo Ellen Perry

Authors
  1. Carla D. Savage
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Stallmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jo Ellen Perry
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. K. Wong.

These results were originally reported in extended abstract form in theProceedings of the 24th Annual Allerton Conference on Communication, Control, and Computing, October, 1986, pp. 797–806. This research was supported in part by the Center for Communications and Signal Processing, North Carolina State University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Savage, C.D., Stallmann, M. & Perry, J.E. Solving some combinatorial problems on arrays with one-way dataflow. Algorithmica 5, 179–199 (1990). https://doi.org/10.1007/BF01840384

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation