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...
محفوظ في:
| المؤلف الرئيسي: | Mansour, Nashat (author) |
|---|---|
| التنسيق: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A comparison of data mapping algorithms for parallel iterative PDE solvers
حسب: Mansour, Nashat
منشور في: (1995) -
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
حسب: Mansour, Nashat
منشور في: (1992) -
A Graph Heuristic Approach for the Data Path Allocation Problem
حسب: Makhoul, Racha
منشور في: (2022) -
Properties of simulated annealing and genetic algorithms for mapping data to multicomputers
حسب: Mansour, Nashat
منشور في: (1997) -
General applicability of genetic and simulated annealing algorithms for data mapping
حسب: Mansour, Nashat
منشور في: (1995)