A comparison of optimization heuristics for the data mapping problem
In this paper we compare the performance of six heuristics with suboptimal solutions for the data mapping problem of two dimensional meshes that are used for the numerical solution of Partial Differential Equations(PDEs) on multicomputers. The data mapping heuristics are evaluated with respect to se...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | article |
| منشور في: |
1997
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/7830 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://surface.syr.edu/cgi/viewcontent.cgi?article=1059&context=npac |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | In this paper we compare the performance of six heuristics with suboptimal solutions for the data mapping problem of two dimensional meshes that are used for the numerical solution of Partial Differential Equations(PDEs) on multicomputers. The data mapping heuristics are evaluated with respect to seven criteria covering load balancing, interprocessor communication,flexibility and ease of use for a class of single-phase iterative PDE solvers. Our evaluation suggests that the simple and fast block distribution heuristic can be as effective as the other five complex and computationally expensive algorithms. |
|---|