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...
Saved in:
| Main Author: | Mansour, N. (author) |
|---|---|
| Other Authors: | Ponnusamy, R. (author), Choudhary, A. (author), Fox, G.C. (author) |
| Format: | conferenceObject |
| Published: |
1993
|
| Online Access: | 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/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Graph Contraction for Mapping Data on Parallel Computers
by: Mansour, N.
Published: (1994) -
A comparison of data mapping algorithms for parallel iterative PDE solvers
by: Mansour, Nashat
Published: (1995) -
An evolutionary approach to load balancing parallel computations
by: Mansour, Nashat
Published: (1991) -
Parallel physical optimization algorithms for allocating data to multicomputer nodes
by: Mansour, Nashat
Published: (1994) -
A comparison of optimization heuristics for the data mapping problem
by: Mansour, Nashat
Published: (1997)