DocumentCode
2330557
Title
A computational model for divide-and-conquer strategies on parallel architectures
Author
Mukund, P.R. ; Gonzalez, R.C.
Author_Institution
Dept. of Electr. & Comput. Eng., Tennessee Univ., Knoxville, TN, USA
fYear
1990
fDate
11-13 Mar 1990
Firstpage
98
Lastpage
102
Abstract
A novel computational model is presented in graph-theoretic terms for the implementation of divide-and-conquer strategies on parallel architectures. Standard applications, such as sorting and segmentation in image analysis, are shown to fit the model. The utilization of this model as part of a mapping strategy would eliminate a major hurdle in the implementation of several new applications in parallel computers
Keywords
graph theory; parallel algorithms; computational model; divide-and-conquer strategies; graph theory; image analysis; mapping strategy; parallel architectures; parallel computers; segmentation; sorting; Algorithm design and analysis; Application software; Computational modeling; Computer architecture; Concurrent computing; Image segmentation; Parallel architectures; Physics computing; Sorting; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
System Theory, 1990., Twenty-Second Southeastern Symposium on
Conference_Location
Cookeville, TN
ISSN
0094-2898
Print_ISBN
0-8186-2038-2
Type
conf
DOI
10.1109/SSST.1990.138120
Filename
138120
Link To Document