Matches in SemOpenAlex for { <https://semopenalex.org/work/W2074055257> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W2074055257 abstract "Part I of this thesis studies the relative computational strengths of the shuffle-exchange graph and the butterfly network, the most common representatives of the two main classes of hypercube-derived networks, demonstrating new structural similarities and establishing the computational equivalence of the two networks.The butterfly network can simulate a certain class of structured hypercube algorithms as efficiently as the shuffle-exchange graph can. We show that each network is able to efficiently simulate an arbitrary computation on the other. In terms of what a network with a given number of nodes can compute in a given number of steps, all of these networks are equivalent up to constant factors.The simulation does not involve a direct embedding of either network into the other; it does not lead to the immediate translation of results that deal with the combinatorial structures of the two networks rather than with algorithmic issues. However, many structural results for one of the networks do in fact have analogues for the other. We give an improved lower bound on dilation for embeddings of the X-tree network into the shuffle-exchange graph, bringing it nearer to the optimal result known for the butterfly network. We consider recent results in the VLSI packaging of deBruijn graph networks, and show that a recently developed packaging scheme can be made to yield the same optimal behavior in terms of the number of off-chip connections needed that is easily achievable for the butterfly network.In Part II, we study the problems of dynamic tree embedding and dynamic allocation of distributed memory resources.For either the butterfly network or the hypercube, we give algorithms that achieve small constant dilation and maximum load O(M/N + log N) with high probability. We also give an improved algorithm for the hypercube that achieves constant dilation and maximum load O(M/N + 1) with high probability. Finally, we prove a lower bound of $Omega$($sqrt{log N}$) on dilation for deterministic embedding algorithms.We consider the problem of dynamic allocation of distributed memory resources. We give a fully on-line algorithm for this distributed dynamic allocation problem that guarantees 100% usage of the available space while achieving slowdown O(M/N + 1). (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.) (Abstract shortened with permission of school.)" @default.
- W2074055257 created "2016-06-24" @default.
- W2074055257 creator A5046041321 @default.
- W2074055257 creator A5056928345 @default.
- W2074055257 date "1991-01-01" @default.
- W2074055257 modified "2023-09-27" @default.
- W2074055257 title "Efficient embeddings and simulations for hypercubic networks" @default.
- W2074055257 hasPublicationYear "1991" @default.
- W2074055257 type Work @default.
- W2074055257 sameAs 2074055257 @default.
- W2074055257 citedByCount "5" @default.
- W2074055257 crossrefType "journal-article" @default.
- W2074055257 hasAuthorship W2074055257A5046041321 @default.
- W2074055257 hasAuthorship W2074055257A5056928345 @default.
- W2074055257 hasConcept C11413529 @default.
- W2074055257 hasConcept C114614502 @default.
- W2074055257 hasConcept C118615104 @default.
- W2074055257 hasConcept C154945302 @default.
- W2074055257 hasConcept C173608175 @default.
- W2074055257 hasConcept C184720557 @default.
- W2074055257 hasConcept C2780069185 @default.
- W2074055257 hasConcept C33923547 @default.
- W2074055257 hasConcept C41008148 @default.
- W2074055257 hasConcept C41608201 @default.
- W2074055257 hasConcept C45374587 @default.
- W2074055257 hasConcept C50820777 @default.
- W2074055257 hasConcept C80444323 @default.
- W2074055257 hasConceptScore W2074055257C11413529 @default.
- W2074055257 hasConceptScore W2074055257C114614502 @default.
- W2074055257 hasConceptScore W2074055257C118615104 @default.
- W2074055257 hasConceptScore W2074055257C154945302 @default.
- W2074055257 hasConceptScore W2074055257C173608175 @default.
- W2074055257 hasConceptScore W2074055257C184720557 @default.
- W2074055257 hasConceptScore W2074055257C2780069185 @default.
- W2074055257 hasConceptScore W2074055257C33923547 @default.
- W2074055257 hasConceptScore W2074055257C41008148 @default.
- W2074055257 hasConceptScore W2074055257C41608201 @default.
- W2074055257 hasConceptScore W2074055257C45374587 @default.
- W2074055257 hasConceptScore W2074055257C50820777 @default.
- W2074055257 hasConceptScore W2074055257C80444323 @default.
- W2074055257 hasLocation W20740552571 @default.
- W2074055257 hasOpenAccess W2074055257 @default.
- W2074055257 hasPrimaryLocation W20740552571 @default.
- W2074055257 hasRelatedWork W145303861 @default.
- W2074055257 hasRelatedWork W1520670460 @default.
- W2074055257 hasRelatedWork W173312942 @default.
- W2074055257 hasRelatedWork W1965593674 @default.
- W2074055257 hasRelatedWork W1972508141 @default.
- W2074055257 hasRelatedWork W1996976730 @default.
- W2074055257 hasRelatedWork W2050742873 @default.
- W2074055257 hasRelatedWork W2058128426 @default.
- W2074055257 hasRelatedWork W2118141398 @default.
- W2074055257 hasRelatedWork W2153573559 @default.
- W2074055257 hasRelatedWork W2228985770 @default.
- W2074055257 hasRelatedWork W2289770412 @default.
- W2074055257 hasRelatedWork W2462861834 @default.
- W2074055257 hasRelatedWork W2465347449 @default.
- W2074055257 hasRelatedWork W2469599997 @default.
- W2074055257 hasRelatedWork W2506312657 @default.
- W2074055257 hasRelatedWork W2738110670 @default.
- W2074055257 hasRelatedWork W2786482075 @default.
- W2074055257 hasRelatedWork W2999803611 @default.
- W2074055257 hasRelatedWork W314262289 @default.
- W2074055257 isParatext "false" @default.
- W2074055257 isRetracted "false" @default.
- W2074055257 magId "2074055257" @default.
- W2074055257 workType "article" @default.