Matches in SemOpenAlex for { <https://semopenalex.org/work/W2104055861> ?p ?o ?g. }
- W2104055861 endingPage "286" @default.
- W2104055861 startingPage "269" @default.
- W2104055861 abstract "We study the problem of running full binary tree based algorithms on a hypercube with faulty nodes. The key to this problem is to devise a method for embedding a full binary tree into the faulty hypercube. Based on a novel embedding strategy, we present two results for embedding an (n-1) tree fa full binary tree with 2/sup n-1/ nodes) into an n-cube (a hypercube with 2/sup n/ nodes) with unit dilation and load. For the problem where the root of the tree must be mapped to a specified hypercube node (specified root embedding problem), we show that up to n-2 (node or edge) faults can be tolerated. This result is optimal in the following sense: 1) it is time-optimal, 2) (n-1)-tree is the largest fall binary tree that can be embedded in an n-cube, and 3) n-2 faults Is the maximum number of worst-case faults that can be tolerated in the specified root problem. Furthermore, we also show that any algorithm for this problem cannot be totally recursive in nature. For the problem where the root can be mapped to any nonfaulty hypercube node (variable root embedding problem), we show that up to 2n-3-[log n] faults can be tolerated. Thus we have improved upon the previous result of n-1-[log n]. In addition, we show that the algorithm for the variable root embedding problem is optimal within a class of algorithms called recursive embedding algorithms as far as the number of tolerable faults is concerned. Finally, we show that when an O(1spl radic/n) fraction of nodes in the hypercube are faulty, it is not always possible to have an O(1)-load variable root embedding no matter how large the dilation is.< <ETX xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>></ETX>" @default.
- W2104055861 created "2016-06-24" @default.
- W2104055861 creator A5036513568 @default.
- W2104055861 creator A5042998724 @default.
- W2104055861 creator A5046915379 @default.
- W2104055861 date "1995-03-01" @default.
- W2104055861 modified "2023-09-27" @default.
- W2104055861 title "Optimal simulation of full binary trees on faulty hypercubes" @default.
- W2104055861 cites W1560383649 @default.
- W2104055861 cites W1604225953 @default.
- W2104055861 cites W1977477009 @default.
- W2104055861 cites W1995467644 @default.
- W2104055861 cites W2005280076 @default.
- W2104055861 cites W2014238476 @default.
- W2104055861 cites W2033562398 @default.
- W2104055861 cites W2034226101 @default.
- W2104055861 cites W2039299463 @default.
- W2104055861 cites W2043555689 @default.
- W2104055861 cites W2053280233 @default.
- W2104055861 cites W2075549926 @default.
- W2104055861 cites W2078760000 @default.
- W2104055861 cites W2083202979 @default.
- W2104055861 cites W2114428064 @default.
- W2104055861 cites W2119454286 @default.
- W2104055861 cites W2121605619 @default.
- W2104055861 cites W2124147496 @default.
- W2104055861 cites W2153573559 @default.
- W2104055861 cites W2155315903 @default.
- W2104055861 cites W2171057724 @default.
- W2104055861 doi "https://doi.org/10.1109/71.372776" @default.
- W2104055861 hasPublicationYear "1995" @default.
- W2104055861 type Work @default.
- W2104055861 sameAs 2104055861 @default.
- W2104055861 citedByCount "12" @default.
- W2104055861 crossrefType "journal-article" @default.
- W2104055861 hasAuthorship W2104055861A5036513568 @default.
- W2104055861 hasAuthorship W2104055861A5042998724 @default.
- W2104055861 hasAuthorship W2104055861A5046915379 @default.
- W2104055861 hasBestOaLocation W21040558612 @default.
- W2104055861 hasConcept C100560664 @default.
- W2104055861 hasConcept C113174947 @default.
- W2104055861 hasConcept C11413529 @default.
- W2104055861 hasConcept C114614502 @default.
- W2104055861 hasConcept C118615104 @default.
- W2104055861 hasConcept C127413603 @default.
- W2104055861 hasConcept C154945302 @default.
- W2104055861 hasConcept C163797641 @default.
- W2104055861 hasConcept C173608175 @default.
- W2104055861 hasConcept C197855036 @default.
- W2104055861 hasConcept C27628562 @default.
- W2104055861 hasConcept C311688 @default.
- W2104055861 hasConcept C33923547 @default.
- W2104055861 hasConcept C41008148 @default.
- W2104055861 hasConcept C41608201 @default.
- W2104055861 hasConcept C48372109 @default.
- W2104055861 hasConcept C50820777 @default.
- W2104055861 hasConcept C62611344 @default.
- W2104055861 hasConcept C63553672 @default.
- W2104055861 hasConcept C66938386 @default.
- W2104055861 hasConcept C84927040 @default.
- W2104055861 hasConcept C94375191 @default.
- W2104055861 hasConceptScore W2104055861C100560664 @default.
- W2104055861 hasConceptScore W2104055861C113174947 @default.
- W2104055861 hasConceptScore W2104055861C11413529 @default.
- W2104055861 hasConceptScore W2104055861C114614502 @default.
- W2104055861 hasConceptScore W2104055861C118615104 @default.
- W2104055861 hasConceptScore W2104055861C127413603 @default.
- W2104055861 hasConceptScore W2104055861C154945302 @default.
- W2104055861 hasConceptScore W2104055861C163797641 @default.
- W2104055861 hasConceptScore W2104055861C173608175 @default.
- W2104055861 hasConceptScore W2104055861C197855036 @default.
- W2104055861 hasConceptScore W2104055861C27628562 @default.
- W2104055861 hasConceptScore W2104055861C311688 @default.
- W2104055861 hasConceptScore W2104055861C33923547 @default.
- W2104055861 hasConceptScore W2104055861C41008148 @default.
- W2104055861 hasConceptScore W2104055861C41608201 @default.
- W2104055861 hasConceptScore W2104055861C48372109 @default.
- W2104055861 hasConceptScore W2104055861C50820777 @default.
- W2104055861 hasConceptScore W2104055861C62611344 @default.
- W2104055861 hasConceptScore W2104055861C63553672 @default.
- W2104055861 hasConceptScore W2104055861C66938386 @default.
- W2104055861 hasConceptScore W2104055861C84927040 @default.
- W2104055861 hasConceptScore W2104055861C94375191 @default.
- W2104055861 hasIssue "3" @default.
- W2104055861 hasLocation W21040558611 @default.
- W2104055861 hasLocation W21040558612 @default.
- W2104055861 hasOpenAccess W2104055861 @default.
- W2104055861 hasPrimaryLocation W21040558611 @default.
- W2104055861 hasRelatedWork W2104055861 @default.
- W2104055861 hasRelatedWork W2113320216 @default.
- W2104055861 hasRelatedWork W2371680642 @default.
- W2104055861 hasRelatedWork W2390988250 @default.
- W2104055861 hasRelatedWork W2391990459 @default.
- W2104055861 hasRelatedWork W2486717996 @default.
- W2104055861 hasRelatedWork W2795921908 @default.
- W2104055861 hasRelatedWork W2951678044 @default.
- W2104055861 hasRelatedWork W4300450359 @default.
- W2104055861 hasRelatedWork W2189401016 @default.