|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Fourth International Conference on Computer Communications and Networks (ICCCN '95)
The maximum dimensional fault-free subcube allocatable in faulty hypercube
Las Vegas, Nevada, USA
September 20-September 23
ISBN: 0-8186-7180-7
| ASCII Text | x | ||
| H. Masuyama, T. Sasama, H. Hashimoto, "The maximum dimensional fault-free subcube allocatable in faulty hypercube," Computer Communications and Networks, International Conference on, pp. 0220, Fourth International Conference on Computer Communications and Networks (ICCCN '95), 1995. | |||
| BibTex | x | ||
| @article{ 10.1109/ICCCN.1995.540122, author = {H. Masuyama and T. Sasama and H. Hashimoto}, title = {The maximum dimensional fault-free subcube allocatable in faulty hypercube}, journal ={Computer Communications and Networks, International Conference on}, volume = {0}, year = {1995}, isbn = {0-8186-7180-7}, pages = {0220}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICCCN.1995.540122}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer Communications and Networks, International Conference on TI - The maximum dimensional fault-free subcube allocatable in faulty hypercube SN - 0-8186-7180-7 SP EP A1 - H. Masuyama, A1 - T. Sasama, A1 - H. Hashimoto, PY - 1995 KW - hypercube networks; maximum dimensional fault-free subcube; faulty hypercube; parallel algorithms; reconfiguration problem; degradation; n-cube; fault-free (n-2)-subcube VL - 0 JA - Computer Communications and Networks, International Conference on ER - | |||
Abstract: The maximum dimensional subcube located in faulty hypercubes is studied in this paper. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm. The reconfiguration problem in a hypercube reduces to finding the maximum dimensional fault-free subcube in the hypercube, that is, helps in achieving graceful and the most effective degradation of the system. The paper presents the maximum number of faults on an n-cube on which there always exists at least one fault-free (n-2)-subcube.
Index Terms:
hypercube networks; maximum dimensional fault-free subcube; faulty hypercube; parallel algorithms; reconfiguration problem; degradation; n-cube; fault-free (n-2)-subcube
Citation:
H. Masuyama, T. Sasama, H. Hashimoto, "The maximum dimensional fault-free subcube allocatable in faulty hypercube," icccn, pp.0220, Fourth International Conference on Computer Communications and Networks (ICCCN '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.