| Summary: | 碩士 === 國立臺灣師範大學 === 資訊教育研究所 === 88 === ABSTRACT
The Designs and Analyses of Parallel Algorithms for Some
Problems on Permutation and Interval Graphs
A processor array with reconfigurable bus system (abbreviated to PARBS) is a parallel computation model that consists of processor array and a reconfigurable bus system. In this model, we can dynamically setup the configurations of all processors in order to form different sub-buses in the processor array. In a sub-bus, the data can be broadcasted in fixed units of time. There are a lot of researchers that develop parallel algorithms on this computation model in order to solve many complicated problems.
In this thesis, we propose algorithms for computing prefix maxima, suffix minima and prefix sum in O(n/p+log p) time on a 1D PARBS with O(p) processors. We also design an algorithm to filter out duplicate data in a nondecreasing sequence in O(n/p) time on a 1D PARBS with O(p) processors.
In addition, we develop algorithms for finding all connected components, articulation points, and a spanning tree of a permutation graph. We also develop algorithms for finding all connected components, articulation points, bridges, and a spanning tree of an interval graph. These algorithms take O(n/p + log p) time on a 1D PARBS with O(p) processors. If p = O(n/log n), they all become cost optimal.
Keyword: PARBS (Processor Arrays with Reconfigurable Bus Systems), cost optimal algorithm, prefix maxima, suffix minima, prefix sum, filter out duplicate data, permutation graph, interval graph, connectivity test problem, connected component problem, articulation point problem, bridge problem, spanning tree problem.
|
|---|
