Designing fast and efficient parallel algorithms
Thesis/Dissertation
·
OSTI ID:7183894
With the advance of VLSI technology parallel computers with thousands or even millions of processors will be available. Thus, studying the inherent parallelism of computational problems and developing parallel algorithms are currently important research topics. This dissertation develops parallel algorithms for some fundamental computational problems. Algorithms are presented for finding a maximal matching for a linked list of n nodes in time O. Also presented is a parallel algorithm for computing connected components for an undirected graph of e edges and n nodes in time O/sub e/.
- Research Organization:
- Duke Univ., Durham, NC (USA)
- OSTI ID:
- 7183894
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel algorithms on modified SIMD machines
Efficient parallel algorithms for covering binary images
Fast and area-efficient VLSI adders
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:5900889
Efficient parallel algorithms for covering binary images
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5748888
Fast and area-efficient VLSI adders
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6355081