Y.-K. Kwok, High-Performance Algorithms for Compile-Time Scheduling of Parallel - 84 - Processors, PhD. Thesis, HKUST, Hong Kong, 1997.  Home/Search   Document Details and Download   Summary   Related Articles

....approach is to employ randomization. As indicated by Karp [89] Motwani and Raghavan [128] and other researchers, an optimization algorithm which makes random choices can be very fast and simple to implement. However, there has been very little work done in this direction. Recently, Kwok et al. [101], 105] 107] proposed a BNP scheduling algorithm based on a random neighborhood search technique [88] 133] The algorithm is called the Parallel Fast Assignment with Search Technique (PFAST) algorithm which has time complexity of only where e is the number of edges in the DAG [105] The PFAST ....

....communicate periodically to exchange the best solution found thus far. As the number of search steps required is a small constant which is independent of the size of the input DAG, the algorithm effectively takes linear time to determine the final schedule. In their performance study, Kwok et al. [101], 105] have compared the PFAST algorithm with a number of well known efficient scheduling algorithms. The PFAST algorithm has been Oe( 73 shown to be better than the other algorithms in terms of both solution quality and running time. Since the algorithm takes linear time, it is the ....

[Article contains additional citation context not shown here]

Y.-K. Kwok, High-Performance Algorithms for Compile-Time Scheduling of Parallel - 84 - Processors, PhD. Thesis, HKUST, Hong Kong, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC