This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of a pruned binomial search tree rooted at any arbitrary node of the binary hypercube. The tree spans any arbitrary sequence of n consecutive nodes containing the root, using a fan-out of at most [log₂ 𝑛] and a depth of [log₂ 𝑛] +1. Search trees spanning non-overlapping processor lists are formed using only local information, and can be used concurrently without contention problems. Thus, they can be used for performing broadcast and merge operations simultaneously on sets with non-uniform sizes. Extensions to generalized and faulty hypercubes and applications to image processing algorithms and for m-way search are discussed.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc501197 |
| Date | 08 1900 |
| Creators | John, Ajita |
| Contributors | Das, Sajal K., Parberry, Ian, Jacob, Roy Thomas |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | viii, 58 leaves: ill., Text |
| Rights | Public, John, Ajita, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved. |
Page generated in 0.0024 seconds