• DocumentCode
    3487457
  • Title

    Reconfiguration of binary trees in faulty hypercubes

  • Author

    Yang, Pei-Ji ; Raghavendra, C.S.

  • Author_Institution
    Dept. of Electr. Syst., Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    1993
  • fDate
    13-16 Apr 1993
  • Firstpage
    401
  • Lastpage
    405
  • Abstract
    The authors present a distributed scheme for reconfiguration of embedded binary trees in hypercubes. Their scheme can reconfigure around any 3n/2 faulty nodes in O(n) time, in an n-dimensional hypercube. Their technique, which is based on a key concept called degree of occupancy, can be generalized to any task graph
  • Keywords
    fault tolerant computing; hypercube networks; reconfigurable architectures; tree data structures; 3n/2; binary trees reconfiguration; degree of occupancy; distributed scheme; faulty hypercubes; task graph; Binary trees; Computer architecture; Computer networks; Concurrent computing; Fault tolerance; Fault tolerant systems; Hypercubes; Large-scale systems; Multiprocessing systems; Parallel algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1993., Proceedings of Seventh International
  • Conference_Location
    Newport, CA
  • Print_ISBN
    0-8186-3442-1
  • Type

    conf

  • DOI
    10.1109/IPPS.1993.262916
  • Filename
    262916
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3487457