Developing Probe Networks with Cube-Connected-Cycles and Parallelism
The hypercube Qn engages in parallel computing,yet it is concerned due to its degree growth.The regular degree-3 cube-connected-cycles,CCCn graphs are derived from Qn.CCCn can be labeled as ((1),x),where 0 ≤ 1 ≤ n-1; and x is the processor node,which accommodates n subnodes formed in a ring,with an n-bit binary string as that of Qn.A processor”s maintenance,e.g.,in the application of floating probes or in detection tasked areas,need to be highly concerned.Hence,scalable Hamiltonian CCCn networks are proposed to integrate real-time,reliable detected information yet with frugal transmission paths available by L(n),the length set of cycles in CCCn,such as:L(n) =”n”U”i| i is even and 8 ≤i≤n+5,and i≠ 10”U”i| n+6≤i≤n2n”if n is odd; L(4)=”4”U”i| i is even and 8≤i≤64”; L(n) =”n”U”i| i is even,and 8≤i≤n2n,and i≠ 10” if n is even and n≥6.
cube-connected-cycles (CCC) probe hypercube parallel computing
HSU Li-Yen
Dept.Aviation Management,China University of Science and Technology,Taiwan
国内会议
沈阳
英文
157-160
2012-11-11（万方平台首次上网日期，不代表论文的发表时间）