Abstract
dc:descriptionThis 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.
Degree
thesis:*- Grantor dc:publisher
- University of North Texas
- Year dc:date
- 1992
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- John, Ajita
- Contributors dc:contributor
-
- Das, Sajal K.
- Parberry, Ian
- Jacob, Roy Thomas
Subjects
dc:subject × 5Rights
dc:rights- Statement dc:rights
-
- Public
- John, Ajita
- Copyright
- Copyright is held by the author, unless otherwise noted. All rights reserved.
- Language dc:language
- English
Identifiers
dc:identifier.*- Identifier
-
local-cont-no: 1002778410-John
call-no: 379 N81 no. 6828
untcat: b1696492
oclc: 28443472
ark: ark:/67531/metadc501197