Graph Contraction for Mapping Data on Parallel Computers: A Quality–Cost Tradeoff
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1994-01-01
|
| Series: | Scientific Programming |
| Online Access: | http://dx.doi.org/10.1155/1994/715918 |