Nathan Cournia
ABSTRACT
In this paper we present an algorithm to compute the minimum dominating number of a chessboard graph given any chess piece. We use the CPU to compute possible minimally dominating sets, which we then send to programmable graphics hardware to determine the set's domination. We find that the GPU accelerated algorithm performs better than a comparable CPU based algorithm for board sizes greater than 9. To our knowledge, this paper presents the first algorithm to determine the minimum domination number of a chessboard graph using the GPU.
- J. Bolz, I. Farmer, E. Grinspun, and P. Schröder. Sparse matrix solvers on the gpu: conjugate gradients and multigrid. ACM Trans. Graph., 22(3):917--924, 2003. Google Scholar
Digital Library
- A. P. Buger and C. M. Mynhardt. An upper bound for the minimum number of queens covering the n x n chessboard. Discrete Appl. Math., 121:51--60, 2002. Google ScholarDigital Library
- I. Bugk, T. Foley, D. Horn, J. Sugerman, K. Fatahalian, M. Houston, and P. Hanrahan. Brook for gpus: stream computing on graphics hardware. ACM Trans. Graph., 23(3):777--786, 2004. Google ScholarDigital Library
- A. P. Burger, E. J. Cockayne, and C. M. Mynhardt. Domination numbers for the queen's graph. Bull. Inst. Combin. Appl., 10:73--82, 1994.Google Scholar
- A. P. Burger, E. J. Cockayne, and C. M. Mynhardt. Domination and irredundance in the queen's graph. Discrete Math., 163:47--66, 1997. Google ScholarDigital Library
- A. P. Burger and C. M. Mynhardt. Properties of dominating sets of the queens graph Q4k+3.Utilitas Math., 57:237-253, 2000.Google Scholar
- A. P. Burger and C. M. Mynhardt. Symmetry and domination in queens graphs. Bull. Inst. Combin. Appl., 29:11--14, 2000.Google Scholar
- A. P. Burger and C. M. Mynhardt. An improved upper bound for queens domination numbers. Discrete Math., 266(1--3):119--131, 2003. Google ScholarDigital Library
- E. J. Cockayne. Chessboard domination problems. Discrete Math., 86:13--20, 1990. Google ScholarDigital Library
- C. F. A. de Jaenisch. Traité des Applications de l'Analyse Mathématique au Jeu des Échecs. St. Pétersbourg, 1862.Google Scholar
- P. B. Gibbons and J. A. Webb. Some new results for the queens domination problem. Australas. J. Combin., 15:145--160, 1997.Google Scholar
- M. J. Harris, W. V. Baxter, T. Scheuermann, and A. Lastra. Simulation of cloud dynamics on graphics hardware. In Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, pages 92--101. Eurographics Association, 2003. Google ScholarDigital Library
- T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Funamentals of Domination in Graphs. Marcel-Dekker, New York, 1998.Google Scholar
- S. T. Hedetniemi and R. C. Laskar. Introduction. Discrete Math., 86:3--9, 1990.Google ScholarCross Ref
- M. D. Kearse and P. B. Gibbons. Computational methods and new results for chessboard problems. Australas. J. Combin., 23:253--284, 2001.Google Scholar
- B. Khailany, W. J. Dally, S. Rixner, U. J. Kapasi, J. D. Owens, and B. Towles. Exploring the vlsi scalability of stream processors. In Proceedings of the Ninth Symposium on High Performance Computer Architecture, February 2003. Google ScholarDigital Library
- J. Krüger and R. Westermann. Linear algebra operators for gpu implementation of numerical algorithms. ACM Trans. Graph., 22(3):908--916, 2003. Google ScholarDigital Library
- P. R. J. Östergård and W. D. Weakley. Values of domination numbers of the queen's graph. The Electronic Journal of Combinatorics, 8(1), 2001.Google ScholarCross Ref
- T. J. Purcell, I. Buck, W. R. Mark, and P. Hanrahan. Ray tracing on programmable graphics hardware. ACM Trans. Graph., 21(3):703--712, 2002. Google ScholarDigital Library
- Semiconductor Industry Association. International technology roadmap for semiconductors. http://public.itrs.net/, December 2002.Google Scholar
- R. A. Wagner and R. M. Geist. The crippled queen placement problem. The Science of Computer Programming, 4:221--248, 1984. Google ScholarDigital Library
- W. D. Weakley. Domination in the queen's graph. In Y. Alavi and A. J. Schwenk, editors, Graph Theory, Combinatorics, and Algorithms, volume 2, pages 1223--1232, New York, 1995. Wiley-Interscience.Google Scholar
- W. D. Weakley. A lower bound for domination numbers of the queen's graph. The Electronic Journal of Combinatorics, 8(1), 2001.Google Scholar
- W. D. Weakley. Upper bounds for domination numbers of the queen's graph. Discrete Math., 242:229--243, 2002. Google ScholarDigital Library
Index Terms
- Chessboard domination on programmable graphics hardware
Recommendations
Multi-grain parallel processing of data-clustering on programmable graphics hardware
ISPA'04: Proceedings of the Second international conference on Parallel and Distributed Processing and ApplicationsThis paper presents an effective scheme for clustering a huge data set using a commodity programmable graphics processing unit(GPU). Due to GPU's application-specific architecture, one of the current research issues is how to bind the rendering pipeline ...
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
Let G=(V,E) be a graph. A set S@__ __V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V-S is adjacent to a vertex in V-S. A set S@__ __V is a restrained dominating set if every vertex in V-S is ...
Comments