By Topic

A computational model for divide-and-conquer strategies on parallel architectures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mukund, P.R. ; Dept. of Electr. & Comput. Eng., Tennessee Univ., Knoxville, TN, USA ; Gonzalez, R.C.

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

Published in:

System Theory, 1990., Twenty-Second Southeastern Symposium on

Date of Conference:

11-13 Mar 1990