Communication efficient parallel algorithms for nonnumerical computations
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The broad goal of this research is to develop a set of paradigms for mapping data-dependent symbolic computations on realistic models of parallel architectures. Within this goal, the thesis represents the initial effort to achieve efficient parallel solutions for a number of non-numerical problems on networks of processors. The specific contributions of the thesis are new parallel algorithms, exhibiting linear speedup on architectures consisting of fixed numbers of processors (i.e., bounded models). The following problems have been considered in the thesis: (1) Determine the minimum spanning tree (MST), and identify the bridges and articulation points (APs) of an undirected weighted graph represented by an
Description
Advisor
Degree
Type
Keywords
Citation
Doshi, Kshitij Arun. "Communication efficient parallel algorithms for nonnumerical computations." (1988) Diss., Rice University. https://hdl.handle.net/1911/16230.