Graph Contraction for Mapping Data 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. In this article, first we motivate the case for gr...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
1994
|
| Online Access: | http://hdl.handle.net/10725/2949 http://dx.doi.org/10.1155/1994/715918 http://www.hindawi.com/journals/sp/1994/715918/abs/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!