The goal of a parallel algorithm is to solve a single problem using multiple processors working together and to do so in an efficient manner. In this regard, there is a need to categorize strategies in order to solve broad classes of problems with similar structures and requirements. In this dissertation, two parallel algorithm design strategies are considered: linked list ranking and parentheses matching.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc278153 |
| Date | 12 1900 |
| Creators | Halverson, Ranette Hudson |
| Contributors | Das, Sajal K., Jacob, Roy Thomas, Brand, Neal E., Yang, Cui-Qing, 1944- |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | x, 118 leaves, Text |
| Rights | Public, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved., Halverson, Ranette Hudson |
Page generated in 0.0017 seconds