Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
