By Topic

Towards developing universal dynamic mapping algorithms

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

4 Author(s)
Decker, T. ; Dept. of Math. & Comput. Sci., Paderborn Univ., Germany ; Diekmann, R. ; Luling, R. ; Monien, B.

We investigate the problem of mapping dynamically generated tasks onto the processors of an MIMD-system. Our main concern is to construct an algorithm which can be integrated in distributed runtime systems like PVM or MPI. Existing methods are often not adjustable to different architecture- and application-demands. Even if they are, the adjustment has to be done manually via time-consuming experiments. A universally applicable strategy has to adjust its parameters automatically according to hardware- and application-characteristics. We concentrate on bidding-algorithms which check the load of K randomly selected processors before placing a task. The analysis of this method is based on a model which allows predicting the behavior of the scheduler. Especially for a large number n of processes it is possible to show that the scheduling behaviour becomes independent of n. As a result we derive optimal K-values for different classes of application/architecture-characteristics. Furthermore, we investigate values of K which guarantee certain execution-times of the application with a given probability

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995