Mapping realistic data sets on parallel computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the execution time of the application if the size of the problem is large. The authors propose reducing the problem size by a...
محفوظ في:
| المؤلف الرئيسي: | Mansour, N. (author) |
|---|---|
| مؤلفون آخرون: | Ponnusamy, R. (author), Choudhary, A. (author), Fox, G.C. (author) |
| التنسيق: | conferenceObject |
| منشور في: |
1993
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/7936 http://dx.doi.org/10.1109/IPPS.1993.262867 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/262867/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Graph Contraction for Mapping Data on Parallel Computers
حسب: Mansour, N.
منشور في: (1994) -
A comparison of data mapping algorithms for parallel iterative PDE solvers
حسب: Mansour, Nashat
منشور في: (1995) -
An evolutionary approach to load balancing parallel computations
حسب: Mansour, Nashat
منشور في: (1991) -
Parallel physical optimization algorithms for allocating data to multicomputer nodes
حسب: Mansour, Nashat
منشور في: (1994) -
A comparison of optimization heuristics for the data mapping problem
حسب: Mansour, Nashat
منشور في: (1997)