Computing the Diameter of 17-Pancake Graph Using a PC Cluster
An n-pancake graph is a graph whose vertices are the permutations of n symbols and each pair of vertices are connected with an edge if and only if the corresponding permutations can be transitive by a prefix reversal. Since the n-pancake graph has n! vertices, it is known to be a hard problem to compute its diameter by using an algorithm with the polynomial order of the number of vertices. Fundamental approaches of the diameter computation have been proposed. However, the computation of the diameter of 15-pancake graph has been the limit in practice. In order to compute the diameters of the larger pancake graphs, it is indispensable to establish a sustainable parallel system with enough scalability. Therefore, in this study, we have proposed an improved algorithm to compute the diameter and have developed a sustainable parallel system with the Condor/MW framework, and computed the diameters of 16- and 17-pancake graphs by using PC clusters.
KeywordsDistance Computation Child Problem Operation Sequence Previous Implementation Parallel Computing System
Unable to display preview. Download preview PDF.
- 5.Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjaming/Cummings (1994)Google Scholar
- 6.Quinn, M.J.: Parallel Computing: Theory and Practice, 2nd edn. McGraw-Hill, New York (1994)Google Scholar
- 7.Kounoike, Y., Kaneko, K., Shinano, Y.: Computing the diameters of 14- and 15-pancake graphs. In: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, pp. 490–495 (2005)Google Scholar
- 9.AT&T: On-Line Encyclopedia of Integer Sequences http://www.research.att.com/~njas/sequences/
- 10.MW project: MW Homepage, http://www.cs.wisc.edu/condor/mw/
- 11.Condor Team: Condor Project Homepage, http://www.cs.wisc.edu/condor/