A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
FASTEST: a practical low-complexity algorithm for compile-time assignment of parallel programs to multiprocessors
1999
IEEE Transactions on Parallel and Distributed Systems
In the area of parallelizing compilers, considerable research has been carried out on data dependency analysis, parallelism extraction, as well as program and data partitioning. However, designing a practical, low complexity scheduling algorithm without sacrificing performance remains a challenging problem. A variety of heuristics have been proposed to generate efficient solutions but they take prohibitively long execution times for moderate size or large problems. In this paper, we propose an
doi:10.1109/71.752781
fatcat:wgpihdacvrc7hfe4lrsiyko7ci