BROADCASTING ON INCOMPLETE HYPERCUBES

Authors
TIEN JY HO CT YANG WP
Citation
Jy. Tien et al., BROADCASTING ON INCOMPLETE HYPERCUBES, I.E.E.E. transactions on computers, 42(11), 1993, pp. 1393-1398
Citations number
17
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Applications & Cybernetics
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
42
Issue
11
Year of publication
1993
Pages
1393 - 1398
Database
ISI
SICI code
0018-9340(1993)42:11<1393:BOIH>2.0.ZU;2-3
Abstract
Incomplete hypercubes make the hypercubes more flexible on task alloca tion in large cubes, cost of manufacturing hardware, and hypercubes wi th faulty nodes. In this correspondence, we devise and analyze a broad casting algorithm based on edge-disjoint spanning trees in an incomple te hypercube of 2n + 2k nodes, where 0 less-than-or-equal-to k less-th an-or-equal-to n. The broadcasting algorithm is strictly optimal.