By Topic

Task assignment heuristics for distributed CFD applications

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)
Lopez-Benitez, N. ; Dept. of Comput. Sci., Texas Tech. Univ., Lubbock, TX, USA ; Djomehri, M.J. ; Biswas, R.

This paper proposes a task graph (TG) model to represent a single discrete step of a computational fluid dynamics (CFD) application. The TG model is then used to predict the performance of a set of task assignment heuristics developed based on the constraints inherent in the CFD problem. Two primitive assignments, the Largest Task First and the Minimum Task First, are systematically enhanced by the integration of the status of the processing units and communication costs. Evaluation is performed on a synthetic TG with tasks defined in terms of the number of gridpoints in predetermined grid zones. A realistic problem with eight million gridpoints is also used as a test case

Published in:

Parallel Processing Workshops, 2001. International Conference on

Date of Conference: