By Topic

Task spreading and shrinking on a network of workstations with various edge classes

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)
Jacob, J.C. ; Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA ; Lee, S.Y.

We describe how our computational model can be used for the problems of processor allocation and task mapping on a network of workstations. The intended applications for this model include the dynamic mapping problems of shrinking or spreading an existing mapping when the available pool of workstations changes during execution of the problem. The concept of problem edge class and other features of our model are developed to realistically and efficiently support task partitioning and merging for static and dynamic mapping. Algorithms for shrinking and spreading are presented and execution times on a network of workstations are used to illustrate the utility of our model

Published in:

Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on  (Volume:3 )

Date of Conference:

12-16 Aug 1996