摘要
本文通过计算机集群并行实现了最小皇后独立支配集问题。主进程通过枚举前三行可能的皇后放置情况,可以把皇后支配集问题分成多个任务,通过动态调度将子任务分配给子进程。主进程和子进程之间的通信采用非阻塞通信,可以使计算和通信重叠,从而提高了计算最小皇后独立支配集的效率。
This paper studies parallel computation and put into solving queens domination numbers problem in computer cluster.The main process is responsible for locating the queens in the first three lines,so that the queens minimum independent domination numbers problem can be distributed into thousands of tasks.Through dynamic scheduling sub tasks will be allocated to the child process by the main process.The non blocking communication between the main process and child process realizes the overlapping between thhe computation and communication.
出处
《内蒙古农业大学学报（自然科学版）》
CAS
北大核心
2012年第Z1期215-218,共4页
Journal of Inner Mongolia Agricultural University(Natural Science Edition)
基金
国家自然科学基金项目(61063004)
内蒙古自然科学基金项目(2010ms0916)
关键词
皇后最小独立支配集
并行计算
计算机集群
Minimum queens independent domination number
parallel computation
computer cluster
