Parallel Search for Costas Arrays
Costas arrays, special permutation matrices, have been applied to many fields such as signal processing and cryptography. However, so far the basic problem-the counting problem remains unsolved. Enumerating all costas arrays of order n from n! permutation matrices has been of long standing interest. Here an effective parallel search algorithm is discussed. This algorithm adopts the classical master-slave technique. Master processor is in charge of allocating search subspace to slave processors. Every slave processor quests for costas arrays in assigned search subspace. Slave processors do not communicate with each other. And amount of communication between master and slave processors is small. So the speedup of this algorithm approaches total number of used processors.
Costas Arrays Counting Problem Parallel Algorithm and Master-slave Technique, Search
Xinchun Yin Tao Liu
Department of Computer Science and Engineering, Yangzhou University Yangzhou, Jiangsu 225009, China
国际会议
杭州
英文
255-257
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）