Pancake problems with restricted prefix reversals and some corresponding Cayley networks

Journal of Parallel and Distributed Computing

Volumn 63, Issue 3, 2003, Pages 327-336

  Bass, Douglas W ^a   Hal Sudborough, I ^b  

^a UNIVERSITY OF ST THOMAS   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

Cayley networks; Diameter; Embeddings; Fixed degree; Pancake network; Pancake problem; Routing; Spanning subnetworks; Symmetric group

Indexed keywords

EID: 0038519309     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-7315(03)00033-9     Document Type: Article

References (22)

1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to n-cube, in: Proceedings of International Conference on Parallel Processing, 1987, pp. 393-400.
2. S.B. Akers, B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans. Comput. 38 (4) (1989) 555-566.
3. D. Bass, I.H. Sudborough, On the shuffle-exchange permutation network, in: Proceedings of the Third International Symposium on Parallel Architectures, Algorithms and Networks, 1997, pp. 165-171.
4. J.A. Bondy, U. Murty, Graph Theory with Applications, Elsevier North-Holland, Amsterdam, 1976.
5. F.R.K. Chung, Diameters of graphs: old problems and new results, Congr. Numer. 60 (1987) 298-319.
6. D.S. Cohen, M. Blum, On the problem of sorting burnt pancakes, Discrete Appl. Math. 61 (1992) 105-120.
7. H. Dweighter, Amer. Math. Monthly 82 (1975) 1010.
8. L. Gardner, Z. Miller, D. Pritikin, I.H. Sudborough, Embedding hypercubes into pancake, cycle prefix and substring reversal networks, in: Proceedings of the 28th Annual Hawaii International Conference on System Sciences, 1995, pp. 537-545.
9. M.R. Garey, D.S. Johnson, S. Lin, Amer. Math. Monthly 84 (1977) 296.
10. W.H. Gates, C.H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Math. 27 (1979) 47-57.
11. M. Heydari, I.H. Sudborough, On the diameter of the pancake network, J. Algorithms 25 (1997) 67-94.
12. M.-C. Heydemann, Cayley graphs and interconnection networks, in: G. Hahn, G. Sabidussi (Eds.), Graph Symmetry, Kluwer Academic Publishers, Dordrecht, 1997, pp. 167-224.
13. D.M. Kwai, B. Parhami, A class of fixed-degree Cayley-graph interconnection networks derived by pruning k-ary n-cubes, in: Proceedings of the 26th International Conference on Parallel Processing, 1997, pp. 92-95.
14. S. Lakshmivarahan, J.-S. Jwo, S.K. Dhall, Symmetry in interconnection networks based on Cayley graphs of permutations groups: a survey, Parallel Comput. 19 (1993) 361-407.
15. S. Latifi, P.K. Srimani, A new fixed degree regular network for parallel processing, in: Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996, pp. 152-159.
16. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers, Los Altos, CA, 1992.
17. G.W. Polites, Introduction to the Theory of Groups, International Textbook Company, 1968.
18. F.P. Preparata, J. Vuillemin, The cube connected cycles: a versatile network for parallel computation, Comm. ACM 24 (5) (1981) 300-309.
19. D.P. Robbins, Communication cited in W.H. Gates and C.H. Papadimitriou, bounds for sorting by prefix reversal, Discrete Math. 27 (1979) 47-57.
20. H. Stone, Parallel processing with the perfect shuffle, IEEE Trans. Comput. C-20 (2) (1971) 153-161.
21. P. Vadapalli, P.K. Srimani, Shortest routing in trivalent Cayley graph network, Inform. Process. Lett. 57 (1996) 183-188.
22. C.-H. Yeh, E. Varvarigos, Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph, in: Proceedings of the 7th Symposium on the Frontiers of Massively Parallel Computation, 1999, pp. 303-309.