Parallel computations on meshes with static an reconfigurable buses
Thesis/Dissertation
·
OSTI ID:5860453
Mesh computers enhanced with buses have been proposed to alleviate the global communication problem of the mesh connected computer. Early algorithms showed that for problems that require sparse data communication, bus oriented organizations provide significant improvement in time performance over the mesh. Several parallel machines with buses have been built such as the Distributed Array Processor, the Gated Connection Network etc. The authors proposes a variety of bus models for parallel processing including the bus in which single or multiple bus access is allowed and the reconfigurable bus, which provides various interconnection patters between the processors. The main emphasis of this thesis, is to show that the buses can be exploited to provide parallel solutions to a wide class of problems. One of the main contributions of this work is the mesh with reconfigurable bus. He shows how the reconfigurable bus can be used to provide parallel data operations of asymptotic time performance similar to or even faster than the powerful Concurrent Read Concurrent Write Parallel Random Access Machine (CRCW P-RAM) for certain problems. Using these data operations in divide and conquer techniques, he develops optimal or near optimal parallel solutions to graph problems under adjacency matrix input as well as unordered edge input and several image problems. The list of problems includes connected components, minimal spanning forest, biconnectivity, labeling of components in digitized images, distance problems, convexity, geometric properties of components, etc. For graph and image problems, our algorithms on the reconfigurable mesh are significantly faster than the known algorithms on the mesh connected computer, the pyramid computer and the mesh of trees organization.
- Research Organization:
- University of Southern California, Los Angeles, CA (USA)
- OSTI ID:
- 5860453
- Country of Publication:
- United States
- Language:
- English
Similar Records
Techniques for the design of parallel graph algorithms
Incremental graph algorithms for parallel random access machines
Recursive star-tree parallel data structure. Technical report
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5856795
Incremental graph algorithms for parallel random access machines
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6918186
Recursive star-tree parallel data structure. Technical report
Technical Report
·
Wed Feb 28 23:00:00 EST 1990
·
OSTI ID:6088764
Related Subjects
99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER ARCHITECTURE
COMPUTER NETWORKS
COMPUTERS
DATA TRANSMISSION
GRAPHS
IMAGE PROCESSING
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
USES
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER ARCHITECTURE
COMPUTER NETWORKS
COMPUTERS
DATA TRANSMISSION
GRAPHS
IMAGE PROCESSING
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
USES