The main contribution of this dissertation proposes a new paradigm, called the parentheses matching paradigm. It claims that this paradigm is well suited for designing efficient parallel algorithms for a broad class of nonnumeric problems. To demonstrate its applicability, we present three cost-optimal parallel algorithms for breadth-first traversal of general trees, sorting a special class of integers, and coloring an interval graph with the minimum number of colors.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc332626 |
| Date | 12 1900 |
| Creators | Chen, Calvin Ching-Yuen |
| Contributors | Das, Sajal K., Fisher, Paul, Yang, C. C., Jacob, Roy T., Brand, Neal E. |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | x, 124 leaves : ill., Text |
| Rights | Public, Chen, Calvin Ching-Yuen, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved. |
Page generated in 0.0014 seconds