Skip to main content
SpringerLink
Log in

A new policy to solve routing conflicts in shuffle-exchange networks

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Batch routing is an important approach for solving routing conflicts in SE (shuffle-exchange) networks. However, the complexity of batching and the uncertainty of batch size makes this approach impracticable. Based on sequence division and routing coding concepts, we propose a method for detecting routing conflicts in an SE network, known as dividing detection that is more efficient than the method for window detection. In addition, a new conjecture relating to routing policies in SE networks is proposed. This is proved using a constructive approach when n < 6. Based on the conjecture, a new routing scheme for SE networks is provided. Using this scheme, all the input signals can be transfered without conflicts and within two batches, while the efficiency of the batch routing is noticeably improved.

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. Stone H. Parallel processing with the perfect shuffle. IEEE Trans Comput, 1971, 20: 153–161

    Article  MATH  Google Scholar 

  2. Raghavendra C S. On the rearrangeability conjecture of (2log2 N − 1)-stage shuffle/exchange network. IEEE Comput Soc Tech Committ Comput Architect Newslett, 1994, 95: 10–12

    Google Scholar 

  3. Wu C, Feng T. On a class of multistage interconnection networks. IEEE Trans Comput, 1980, 29: 694–702

    Article  MATH  MathSciNet  Google Scholar 

  4. Wu C, Feng T. The universality of the shuffle/exchange network. IEEE Trans Comput, 1981, 30: 324–332

    Article  MATH  MathSciNet  Google Scholar 

  5. Benes V E. Proving the rearrangeability of connecting networks by group calculations. Bell syst Tech J, 1975, 54: 421–434

    MathSciNet  Google Scholar 

  6. Parker D S. Notes on shuffle/exchange-type switching networks. IEEE Trans Comput, 1980, 29: 213–222

    Article  MATH  MathSciNet  Google Scholar 

  7. Linial N, Tarsi N. Efficient generation of permutations with the shuffle/exchange network. Technical Report, UCLA Computer Science Department, 1982

  8. Sovis F. Uniform theory of the SE type permutation networks. In: Proceeding of the 10th Annual International Symposium Computer Architecture, Stockholm, Sweden, 1983. 185–191

  9. Andresen S. The looping algorithm extended to base rearrangeable switching networks. IEEE Trans Commun, 1977, 25: 1057–1063

    Article  Google Scholar 

  10. Lee K Y. On the rearrangeability of the 2log2 N−1 stage permutation network. IEEE Trans Comput, 1985, 34: 412–442

    Article  MATH  Google Scholar 

  11. Huang S T, Tripathi S K. Finite state model and compatibility theory: new analysis tools for permutation networks. IEEE Trans Comput, 1986, 35: 591–601

    Article  MATH  Google Scholar 

  12. Feng T, Seo S. A new routing algorithm for a class of rearrangeable network. IEEE Trans Comput, 1994, 43: 1270–1280

    Article  MATH  MathSciNet  Google Scholar 

  13. Varma A, Raghavendra C S. Rearrangeability of multistage shuffle/exchange network for N = 8. IEEE Trans Commun, 1988, 36: 1138–1149

    Article  MATH  Google Scholar 

  14. Sovis F. On rearrangeable networks of the shuffle-exchange network. In: Proceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation, College Park, USA, 1990. 304–314

  15. Abdennadher A, Feng T. On rearrangeability of Omega networks. In: Proceedings of 1992 International Conference on Parallel Processing, An Arbor, USA, 1992. 159–165

  16. Hasan C. Rearrangeability of (2n − 1)-stage shuffle-exchange networks. SIAM comput, 2003, 32: 557–585

    Article  MATH  Google Scholar 

  17. Kim M, Yook H, Maeny S. On the correctness of inside-out routing algorithm. IEEE Trans Comput, 1997, 46: 820–823

    Article  Google Scholar 

  18. Dai H, Shen X J. Rearrageability of the 7-stage 16×16 shuffle-exchange network (in Chinese). Acta Electron Sin, 2007, 35: 1875–1885

    Google Scholar 

  19. Raghavendra C S, Varma A. Rearrangeability of the five-stage shuffle/exchange network for N = 8. In: Proceedings of 1986 International Conference on Parallel Processing, Chicago, USA, 1987. 119–122

Download references

Author information

Authors and Affiliations

  1. College of Command Automation PLA University of Science and Technology, Nanjing, 210007, China

    FangBin Ge, Min Zhao & Tao Zhang

  2. Institute of China Electronic System Engineering, Beijing, 100039, China

    JianXin Wang

Authors
  1. FangBin Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Min Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. JianXin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to FangBin Ge.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ge, F., Zhao, M., Zhang, T. et al. A new policy to solve routing conflicts in shuffle-exchange networks. Sci. China Inf. Sci. 54, 1512–1523 (2011). https://doi.org/10.1007/s11432-011-4256-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4256-1

Keywords

Search

Navigation