Proposes a parallel randomized algorithm, called PFAST (parallel Fast Assignment using Search Technique), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST a...
详细信息
ISBN:
(纸本)9780818680908
Proposes a parallel randomized algorithm, called PFAST (parallel Fast Assignment using Search Technique), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST algorithm has O(e) time complexity, where e is the number of edges in the DAG. This linear-time algorithm works by first generating an initial solution and then refining it using a parallel random search. Using a prototype computer-aided parallelization and scheduling tool called CASCH (Computer-Aided SCHeduling), the algorithm is found to outperform numerous previous algorithms while taking dramatically smaller execution times. The distinctive feature of this research is that, instead of simulations, our proposed algorithm is evaluated and compared with other algorithms using the CASCH tool with real applications running on an Intel Paragon. The PFAST algorithm is also evaluated with randomly generated DAGs for which optimal schedules are known. The algorithm generated optimal solutions for a majority of the test cases and close-to-optimal solutions for the others. The proposed algorithm is the fastest scheduling algorithm known to us and is an attractive choice for scheduling under running time constraints.
In this paper we present a randomizedparallel maximal matching algorithm that requires only O(n) processors on an. EREW PRAM, where n is the number of vertices in an undirected graph G = (V, E). Our algorithm outputs...
详细信息
In this paper we present a randomizedparallel maximal matching algorithm that requires only O(n) processors on an. EREW PRAM, where n is the number of vertices in an undirected graph G = (V, E). Our algorithm outputs a matching in O( log 2 m) expected time, where m is the number of edges in G. The probability that the output of our algorithm is maximal is at least 1 − e −k , where k is a constant.
暂无评论