Y.-K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computing Surveys, vol. 31, no. 4, pp. 406--471, Dec. 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Iterative Data Partitioning Scheme of Parallel PDE Solver.. - Ichikawa, Fujimura (2002) (Correct)
....1 ,B 5 ) and (B 3 ,B 4 ) are allocated on the same processor. As variables can be shared freely on the same processor, no additional communication cost is required. This kind of optimization problem is very popular as a task graph scheduling problem, and has been thoroughly researched (see Kwok [11] for recent survey) However, the sole task graph scheduling cannot give a good load balance for our problem when m n holds or when there is much difference in block size. Figure 3 (left) illustrates an unsuitable case, in which m = n =2holds and block size differs much. Block B 2 is too big ....
Y.-K. Kwok and I. Ahmad. Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, Vol. 31, No. 4, pp. 406--471, 1999.
Executing Multiple Pipelined Data Analysis.. - Spencer, Ferreira.. (2002) (2 citations) (Correct)
....per filter cycle, and the frequency of filter cycles, we can compute the input and output rates of a filter. 4. 2 Scheduling Algorithm The scheduling algorithm, referred to as filter copy pipeline (FCP) is similar in some respects to the classic static scheduling technique called list scheduling [23], where the approach is to choose a mapping for each application filter in some order based on a ranking of the filters. For a chain of processing on data, the filters in the chain are ranked such that the first filter is given the highest rank, and the last filter has the lowest rank. The FCP ....
....for scheduling in heterogeneous computing systems [16, 36, 38, 25, 11, 21] Some deal with a single application structured as a DAG, while others apply to globally scheduling many independent tasks. Our approach for scheduling a UOW is loosely based on the list scheduling heuristic approach [23] that DAG scheduling uses, which can result in sub optimal mappings. Several groups have investigated scheduling methods encountered when using network enabled servers in multi client, multi server scenarios [4, 12, 29, 35, 34, 41] While network enabled servers can be composed, typically ....
Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs. ACM Computing Surveys, 31(4):406--471, Dec. 1999.
k-Depth Look-ahead Task Scheduling in Network of Heterogeneous.. - Woo, Yeom (2002) (Correct)
....is to achieve the minimum execution time of all the tasks satisfying the task precedence requirements. One of the approaches on this research area is the task processor mapping with weighted directed acyclic graphs (DAGs) which represent applications, and it has been known as NP Complete [2, 3, 6]. Although many scheduling heuristics have been proposed for a couple of decades, most of them are only devised for a homogeneous system. Recently a heterogeneous computing system is arousing the academic and commercial interests because of the good scalability and low building cost. For the high ....
....is more dicult than in case of a homogeneous system. In this study, we are interested in the static task scheduling for network of heterogeneous processors. Static scheduling is done at compile time with a directed acyclic graph (DAG) and the information of processors and a network architecture [2, 3]. Several heuristics for the heterogeneous environment have been proposed. The Dynamic Level Scheduling (DLS) algorithm is a greedy algorithm in that it selects a match of a task and a processor which gives the earliest start time [7] All of the ready tasks are the candidates for mapping on ....
[Article contains additional citation context not shown here]
Kwok, Y., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, 31(4):406-471, 1999
Scheduling Multiple Data Visualization Query Workloads .. - Andrade, Kurc.. (1 citation) (Correct)
....views (or intermediate results) and data prefetching and caching. The importance of scheduling lies in the fact that by properly ordering the queries in a parallel environment it is possible to better exploit the database server and extract larger benefits from its parallel capabilities [16]. Query scheduling techniques have been extensively used to speed up the execution of queries in the face of limited resources [11] Nevertheless, the study of the problem of scheduling multiple query workloads, specifically for highly data intensive visualization queries, and more generally for ....
Yu-Kwong Kwok and Ishfaq Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406--471, 1999.
A Fault-tolerant Real-time Scheduling Algorithm for.. - Qin, Jiang, Swanson (2001) (Correct)
....a scheduling algorithm is designed to operate in the presence (or absence) of a number of operational conditions, depending on the workload, operational environment, complexity and cost constraints. These operational conditions include (but not limited to) 1) whether the operation is static [13] or dynamic [7] i.e. off line vs. on line) 2) whether the workload has real time constraints [30] 3) whether fault tolerance [9] is considered, 4) whether the underlying system is heterogenous [25] or homogeneous, and (5) whether precedence constraints exist among tasks to be scheduled [3] ....
Y.K. Kwok and I. Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors ACM Computing Surveys Vol.31 , No. 4, 1999, pp.406-471. 16
Security-Driven Heuristics and a Fast Genetic Algorithm for.. - Song, Kwok, Hwang (2005) Self-citation (Kwok) (Correct)
No context found.
Y.-K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computing Surveys, vol. 31, no. 4, pp. 406--471, Dec. 1999.
Pipelining vs. Multiprocessors - Choosing the Right Network.. - Weng, Wolf (2004) (Correct)
No context found.
Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406--471, Dec. 1999.
Min-Cut Program Decomposition for Thread-Level Speculation - Johnson, Eigenmann.. (2004) (Correct)
No context found.
Y.-K. Kwok and I. Ahmad. Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, 31(4):406--471, 1999.
Application Analysis and Resource Mapping for Heterogeneous - Network Processor.. (2004) (Correct)
No context found.
Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406--471, Dec. 1999.
Reducing the Software Project Duration using Global Software.. - Jain (2002) (Correct)
No context found.
Kwok and Ahmad. "Static scheduling algorithms for allocating directed task graphs to multiprocessors". ACM Computing Survey. Vol. 31, No. 4, Dec,1999. pp. 406-471.
Permission to Make Digital Or Hard Copies of All Or Part.. - Personal Or Classroom (Correct)
No context found.
Yu-Kwong Kwok and Ishfaq Ahmad. Static Scheduling Algorithms for Allocating Directed Task Graphs. ACM Computing Surveys, 31(4):406--471, December 1999.
An Efficient Fault-tolerant Scheduling Algorithm for.. - Qin, Jiang, Swanson (2002) (Correct)
No context found.
Y.K. Kwok and I. Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors ACM Computing Surveys Vol. 31, No. 4, 1999, pp.406-471.
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