Skip to main content
SpringerLink
Log in

Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems

  • Published:
Sadhana Aims and scope Submit manuscript

Abstract

A bus system whose configuration can be dynamically changed is called reconfigurable bus system. In this paper, parallel algorithms for generating combinations, subsets, and binary trees on linear processor array with reconfigurable bus systems (PARBS) are presented.

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

  • Akl S G, Gries D, Stojmenovic I 1989/90 An optimal parallel algorithm for generating combinations.Inf. Process. Lett. 33: 135–139

    Article  MATH  MathSciNet  Google Scholar 

  • Er M C 1989 A new algorithm for generationg binary trees using rotations.Comput. J. 32: 470–473

    Article  MATH  MathSciNet  Google Scholar 

  • Makinen E 1991 Efficient generation of rotational-admissible codewords for binary trees.Comput. J. 34: 379

    Article  MathSciNet  Google Scholar 

  • Pallo J, Racca R 1985 A note on generating binary trees in A-order and B-order.Int. J. Comput. Math. 18: 27–39

    Article  MATH  Google Scholar 

  • Schuster A 1991Dynamic reconfiguring networks for parallel computers: algorithms and complexity bounds. PhD thesis, Hebrew University, Jerusalem

    Google Scholar 

  • Stojmenovic I, Miyakawa M 1983 Applications of subset generating algorithm to base enumeration, knapsack and minimal covering problems.Comput. J. 1: 65–70

    Google Scholar 

  • Tsay J C, Lee W P 1994 A cost-optimal systolic algorithm for generating subsets.Int. J. Comput. Math. 50: 1–10

    Article  Google Scholar 

  • Wang B F 1991Configurational computation: a new algorithm design strategy on processor arrays with reconfigurable bus systems. PhD thesis, National Taiwan University, Taipei

    Google Scholar 

  • Zerling D 1985 Generating binary trees using rotations.J. Assoc. Comput. Mach. 32: 694–701

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Madras, 600 005, Chepauk, Madras, India

    P Thangavel

Authors
  1. P Thangavel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P Thangavel.

Additional information

Preliminary version of this paper has been presented at the 6th National Seminar on Theoretical Computer Science, held at Bhanasthali Vidyapith, Aug. 8–12, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thangavel, P. Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems. Sadhana 22, 629–636 (1997). https://doi.org/10.1007/BF02802550

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation