Skip to main content
SpringerLink
Log in

Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs

  • Conference paper
Algorithms and Architectures for Parallel Processing (ICA3PP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6082))

Abstract

This paper proposes a routing algorithm in an n-burnt pancake graph B n , which is a topology for interconnection networks, with at most n − 1 faulty clusters whose diameters are at most 3. For an arbitrary pair of non-faulty nodes, the proposed algorithm constructs a fault-free path of length at most 2n + 10 between them in O(n 2) time complexity.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohen, D.S., Blum, M.: On the problem of sorting burnt pancakes. Discrete Applied Mathematics 61, 105–120 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Iwasaki, T., Kaneko, K.: A fault-tolerant routing algorithm of burnt pancake graphs. In: Proc. 2009 Int’l Conf. Parallel and Distributed Processing Techniques and Applications, pp. 307–313 (2009)

    Google Scholar 

  3. Kaneko, K.: An algorithm for node-to-node disjoint paths problem in burnt pancake graphs. IEICE Trans. Inf. and Systems E90-D(1), 306–313 (2007)

    Google Scholar 

  4. Kaneko, K.: An algorithm for node-to-set disjoint paths problem in burnt pancake graphs. IEICE Trans. Inf. and Systems E86-D(12), 2588–2594 (2003)

    Google Scholar 

  5. Kaneko, K.: Hamiltonian cycles and hamiltonian paths in faulty burnt pancake graphs. IEICE Trans. Inf. and Systems E90-D(4), 716–721 (2007)

    Article  Google Scholar 

  6. Kaneko, K., Sawada, N., Peng, S.: Cluster fault-tolerant routing in pancake graphs. In: Proc. 19th IASTED Conf. Parallel and Distributed Computing and Systems, pp. 423–428 (2007)

    Google Scholar 

  7. Gu, Q.P., Peng, S.: Cluster fault-tolerant routing in star graphs. Networks 35(1), 83–90 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gu, Q.P., Peng, S.: Optimal algorithms for node-to-node fault tolerant routing in hypercubes. The Computer Journal 39(7), 626–629 (1996)

    Article  Google Scholar 

  9. Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Computers 38(4), 555–566 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gates, W.H., Papadimitriou, H.: Bounds for sorting by prefix reversal. Discrete Mathematics 27, 47–57 (1979)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Engineering, Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, Japan

    Nagateru Iwasawa, Tatsuro Watanabe, Tatsuya Iwasaki & Keiichi Kaneko

Authors
  1. Nagateru Iwasawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tatsuro Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tatsuya Iwasaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Keiichi Kaneko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Information Engineering, Chung Hua University, 300, Hsinchu, Taiwan, China

    Ching-Hsien Hsu

  2. Department of Computer Science, St. Francis Xavier University, B2G 2W5, Antigonish, NS, Canada

    Laurence T. Yang

  3. Department of Computer Science ad Engineering, Seoul National University of Technology, 172 Gongreund 2-dong, Nowon-gou, 139-742, Seoul, Korea

    Jong Hyuk Park

  4. Division of Computer Engineering, Mokwon University, 302-729, Daejeon, Korea

    Sang-Soo Yeo

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwasawa, N., Watanabe, T., Iwasaki, T., Kaneko, K. (2010). Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6082. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13136-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13136-3_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13135-6

  • Online ISBN: 978-3-642-13136-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation