Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Building and scheduling parallel adaptive applications in heterogeneous environments

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

3 Author(s)
Kebbal, D. ; Univ. des Sci. & Technol. de Lille, Villeneuve d''Ascq, France ; Talbi, E.-G. ; Geib, J.M.

In this paper we present a dynamic approach for constructing and scheduling parallel adaptive applications in heterogeneous multi-user environments (networks of workstations). Parallel adaptive applications have the property of varying their parallelism degree following the load fluctuation of the underlying environment. Our tool provides a programming facility that allows the application construction to avoid managing these complex problems and an allocation module responsible for running and scheduling application tasks. The allocation module handles also all problems related to the dynamic character of the application so that the user may not know at any time whether his application executes on one or dozens of workstations. The allocation module is completed by a scheduler which tries to make good mapping decisions and to adjust the mapping when the application reconfigures dynamically. The scheduling approach based on the dependency graphs model tries to minimize the execution time of the application by decreasing the parallelism loss situations in which some nodes allocated to the application are waiting for the work availability which must be generated by some slow nodes. This can be achieved by analysing dynamically the dep-graph structure and using the heterogeneity aspect. Encouraging results were obtained from experiments conducted on a parallel version of the Gaussian elimination application which is not well adapted to our environment

Published in:

Cluster Computing, 1999. Proceedings. 1st IEEE Computer Society International Workshop on

Date of Conference: