(Enter summary)
Abstract: 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... (Update)
Context of citations to this paper: More
...can be improved signi cantly. 4 Random Local Search Algorithm A number of local search algorithms for scheduling have been presented [16, 17]. A random local search algorithm for DAG scheduling, named FAST, was given in [16] see Figure 1) In this algorithm, a node is randomly...
Cited by: More
Pipelining vs. Multiprocessors - Choosing the Right Network.. - Weng, Wolf (2004)
(Correct)
Efficient Local Search for DAG Scheduling - Wu, Shu, Gu
(Correct)
Similar documents (at the sentence level):
24.9%: High-Performance Algorithms for Compile-Time Scheduling of.. - Kwok (1997)
(Correct)
Active bibliography (related documents): More All
0.5: Static Scheduling Algorithms for Allocating Directed Task.. - Kwok, Ahmad (1998)
(Correct)
0.3: Benchmarking and Comparison of the Task Graph Scheduling.. - Kwok, Ahmad (1999)
(Correct)
0.2: Dynamic Critical-Path Scheduling: An Effective Technique for.. - Kwok, Ahmad (1996)
(Correct)
Similar documents based on text: More All
0.3: A Fuzzy Load Balancing Service for Network Computing Based on.. - Cheung, Kwok (2001)
(Correct)
0.2: CASCH: A Software Tool for Automatic Parallelization and.. - Ahmad, Kwok, Wu, Shu (2000)
(Correct)
0.2: Link Contention-Constrained Scheduling and Mapping of Tasks and .. - Kwok, Ahmad (2000)
(Correct)
BibTeX entry: (Update)
Y.K. Kwok and I.Ahmad. FASTEST: A practical low-complexity algorithm for compile-time assignment of parallel programs to multiprocessors. IEEE Trans. Parallel and Distributed System, 10(2):147-159, February 1999. http://citeseer.ist.psu.edu/kwok99fastest.html More
@article{ kwok99fastest,
author = "Y.-K. Kwok and I. Ahmad",
title = "{FASTEST}: {A} Practical Low-Complexity Algorithm for Compile-Time Assignment of Parallel Programs to Multiprocessors",
journal = "IEEE Transactions on Parallel and Distributed Systems",
volume = "10",
number = "2",
pages = "147--??",
year = "1999",
url = "citeseer.ist.psu.edu/kwok99fastest.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
482
Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
247
Partitioning and Scheduling Parallel Programs for Multiproce.. (context) - Sarkar - 1989
93
DSC: Scheduling Parallel Tasks on an Unbounded Number of Pro..
- Yang, Gerasoulis - 1994
81
Hypertool: A Programming Aid for Message-Passing Systems
- Wu, Gajski - 1990
80
A Compile-Time Scheduling Heuristic for InterconnectionConst.. (context) - Sih, Lee - 1993
74
Scheduling Precedence Graphs in Systems with Interprocessor .. (context) - Hwang, Chow et al. - 1989
62
Practical Multiprocessor Scheduling Algorithms for Efficient.. (context) - Kasahara, Narita - 1984
61
Automatic Extraction of Functional Parallelism from Ordinary.. (context) - Girkar, Polychronopoulos - 1992
40
Dynamic Critical-Path Scheduling: An Effective Technique - 2..
- Kwok, Ahmad - 1996
40
Automatic Task Graph Generation Techniques (context) - Cosnard, Loi - 1995
39
Analysis and Evaluation of Heuristic Methods for Static Sche.. (context) - Shirazi, Wang et al. - 1990
35
An Effective Heuristic Procedure For Partitioning Graphs (context) - Kernighan, Lin - 1970
32
Compile-Time Estimation of Communication Costs on Multicompu..
- Gupta, Banerjee - 1992
19
Task Clustering and Scheduling for Distributed Memory Parall.. (context) - Palis, Liou et al. - 1996
15
Compile-Time Estimation of Communication Costs for Data Para.. (context) - Fahringer - 1996
13
Task Scheduling in Multiprocessing Systems (context) - El-Rewini, Ali et al. - 1995
10
Static Performance Estimation in a Parallelizing Compiler (context) - Kennedy, McIntosh et al. - 1991
7
Automatic Parallelization and Scheduling of Programs on Mult.. (context) - Ahmad, Kwok et al. - 1997
7
Program Parallelization with Interprocedural Analysis (context) - Li, Yew - 1988
6
Optimal and Near-Optimal Allocation of PrecedenceConstrained.. (context) - Ahmad, Kwok - 1998
6
A Vertically Layered Allocation Scheme for Data Flow Systems (context) - Lee, Hurson et al. - 1991
4
On Effective Execution of Non-uniform DOACROSS Loops
- Chen, Yew - 1996
1
Proceedings of the 12th International Parallel Processing Sy.. (context) - Benchmarking, Graph - 1998
1
An Efficient Data Dependency Analysis for Parallelizing Comp.. (context) - Li, Yew et al. - 1990
Documents on the same site (http://www.eee.hku.hk/~ykwok/publications.html): More
Design and Evaluation of Data Allocation Algorithms.. - Kwok, Karlapalem.. (1996)
(Correct)
Synergy between Adaptive Channel Coding and Media Access Control .. - Lau, Kwok (1999)
(Correct)
Efficient Scheduling of Arbitrary Task Graphs to.. - Yu-Kwong Kwok And
(Correct)
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