Graph contraction for physical optimization methods
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 paper, first we motivate the case for grap...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | conferenceObject |
| Published: |
1993
|
| Online Access: | http://hdl.handle.net/10725/7931 http://dx.doi.org/10.1145/165939.165942 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://dl.acm.org/citation.cfm?id=165942 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!