Automatic Choice of Scheduling Heuristics for Parallel/Distributed Computing
Task mapping and scheduling are two very difficult problems that must be addressed when a sequential program is transformed into a parallel program. Since these problems are NP‐hard, compiler writers have opted to concentrate their efforts on optimizations that produce immediate gains in performance...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1999-01-01
|
| Series: | Scientific Programming |
| Online Access: | http://dx.doi.org/10.1155/1999/898723 |