Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Container Problem in Burnt Pancake Graphs

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2005)

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

Abstract

In this paper, we propose an algorithm that solves the container problem in n-burnt pancake graphs in polynomial order time of n. Its correctness is proved and estimates of time complexity and sum of paths lengths are given. We also report the results of computer experiment conducted to measure the average performance of our algorithm. burnt pancake graphs, container problem, internally disjoint paths, polynomial time algorithm.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Akl, S.G., Qiu, K.: Parallel minimum spanning forest algorithms on the star and pancake interconnection networks. In: Proc. of Joint Conf. Vector and Parallel Processing, pp. 565–570 (1992)

    Google Scholar 

  3. Akl, S.G., Qiu, K.: A novel routing scheme on the star and pancake interconnection networks and its applications. Parallel Computing 19(1), 95–101 (1993)

    Article  MATH  Google Scholar 

  4. Akl, S.G., Qiu, K., Stojmenović, I.: Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. Networks 23(4), 215–226 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Berthomé, P., Ferreira, A., Perennes, S.: Optimal information dissemination in star and pancake networks. IEEE Trans. Parallel and Distributed Systems 7(12), 1292–1300 (1996)

    Article  Google Scholar 

  6. Corbett, P.F.: Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel and Distributed Systems 3(5), 622–626 (1992)

    Article  Google Scholar 

  7. Dietzfelbinger, M., Madhavapeddy, S., Sudborough, I.H.: Three disjoint path paradigms in star networks. In: Proc. IEEE SPDP, pp. 400–406 (1991)

    Google Scholar 

  8. Garfgano, L., Vaccaro, U., Vozella, A.: Fault tolerant routing in the star and pancake interconnection networks. IPL 45(6), 315–320 (1993)

    Article  Google Scholar 

  9. Gardner, L., Miller, Z., Pritikin, D., Sudborough, I.H.: Embedding hypercubes into pancake, cycle prefix and substring reversal networks. In: Proc. 28th Annual Hawaii Int’l Conf. System Sciences, pp. 537–545 (1995)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  11. Gu, Q.-P., Peng, S.: Node-to-set disjoint paths problem in star graphs. IPL 62(4), 201–207 (1997)

    Article  MathSciNet  Google Scholar 

  12. Hamada, Y., Bao, F., Mei, A., Igarashi, Y.: Nonadaptive fault-tolerant file transmission in rotator graphs. IEICE Trans. Fundamentals E79-A(4), 477–782 (1996)

    Google Scholar 

  13. Kaneko, K., Suzuki, Y.: An algorithm for node-to-set disjoint paths problem in rotator graphs. IEICE Trans. Information and Systems  E84-D(9), 1155–1163 (2001)

    Google Scholar 

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

    Google Scholar 

  15. Madhavapeddy, S., Sudborough, I.H.: A topological property of hypercubes — node disjoint paths. In: Proc. IEEE SPDP, pp. 532–539 (1990)

    Google Scholar 

  16. Qiu, K., Meijer, H., Akl, S.G.: Parallel routing and sorting on the pancake network. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol. 497, pp. 360–371. Springer, Heidelberg (1991)

    Google Scholar 

  17. Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. JACM 36(2), 335–348 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  18. Seitz, C.L.: The cosmic cube. CACM 28(7), 22–33 (1985)

    Google Scholar 

  19. Suzuki, Y., Kaneko, K.: An algorithm for node-disjoint paths in pancake graphs. IEICE Trans. Information and Systems E86-D(3), 610–615 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, Tokyo University of Agriculture and Technology, Nakacho 2-24-16, Koganei-shi, Tokyo, 184-8588, Japan

    N. Sawada, Y. Suzuki & K. Kaneko

Authors
  1. N. Sawada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. Kaneko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of CS, Georgia State University, 30302, Atlanta, GA, USA

    Yi Pan

  2. State Key Laboratory for Novel Software Technology, Nanjing University, 210093, Nanjing, Jiangsu, China

    Daoxu Chen

  3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  4. Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China

    Jiannong Cao

  5. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sawada, N., Suzuki, Y., Kaneko, K. (2005). Container Problem in Burnt Pancake Graphs. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_50

Download citation

  • DOI: https://doi.org/10.1007/11576235_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29769-7

  • Online ISBN: 978-3-540-32100-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation