A. Dogan,F. Ozguner, "Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing,"In Proc. of the 29 th International Conference on Parallel Processing, pp. 307-314, 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....supported by an NSF grant (EPS 0091900) and a Nebraska University Foundation grant (26 0511 0019) 2. Related work The issue of scheduling on heterogeneous systems has been studied in the literature in recent years. A scheduling scheme, STDP, for heterogeneous systems was developed in [16] In [3,17], reliability cost was incorporated into scheduling algorithms for tasks with precedence constraints. However, these algorithms neither provide fault tolerance nor support real time applications. Previous work has been done to facilitate real time computing in heterogeneous systems. In [7] a ....

A. Dogan,F. Ozguner, "Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing,"In Proc. of the 29 th International Conference on Parallel Processing, pp. 307-314, 2000.

....of this paper. Finally, the appendix contains a simple example to elucidate the proposed algorithm. 2. RELATED WORK The issue of scheduling on heterogeneous systems has been studied in the literature in recent years. A scheduling scheme, STDP, for heterogeneous systems was developed in [25] In [8, 28], reliability cost was incorporated into scheduling algorithms for tasks with precedence constraints. However, these algorithms neither provide fault tolerance nor support real time applications. Previous work has been done to facilitate real time computing in heterogeneous systems. In [13] a ....

A. Dogan,F. Ozguner, "Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing,"In Proc. Of the 29 th International Conference on Parallel Processing, pp. 307-314, 2000.

....has been studied in many papers [25] 21] Ranaweera and Agrawal present a task duplication based scheduling scheme (TDS) to schedule tasks of a directed acyclic graph (DAG) onto a heterogeneous system. A scalable scheduling scheme called STDS for heterogeneous systems is devised in [24] In [5] and [29] reliability cost is incorporated into scheduling algorithms for tasks with precedence constraints. However, these algorithms either do not support fault tolerance or assume that tasks in the system are not real time. Previous work has been done to facilitate real time computing in ....

....as shown in Table 1. 600 0 0 0 15 9a;b c=dAe;fFg;h=h 9a=iIj9i;kAeIf9g;h=h 9a;b c=dAb;lFm;n9o9p 9a=iIj9i;k b;l9mIn9o9p q [ 6 q rts # u .vxw Fig. 5 Reliability costs of FTRCD and FTAEAP. The C range for Btree and for Random Graph is [5,50] and [5,120] y z y y z 5 z F; F;9; F= 9; F;9; F; F;9; x= F= 9; F;9; x= 6 z y x Fig. 6 Reliability costs of FTRCD and FTAEAP. Task graph is lattice 14 FTRCD N=30 FTAEAP N=30 FTRCD N=20 FTAEAP N=20 Detecting Time ....

[Article contains additional citation context not shown here]

A. Dogan,F. Ozguner, "Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing,"In Proc. Of the 29 th International Conference on Parallel Processing, pp. 307-314, 2000.

....which first derives symbolic linear clusters and then assigns task clusters to processors. The scheduling algorithms for DAGs in these two papers, however, are also devised for homogeneous systems. The issue of scheduling on heterogeneous systems has been studied in many papers [9] 19] 26] 20][5][24] It is suggested that minimizing task s completion time leads to a minimal start time of the task [14] 26] The performance of the low cost static list scheduling algorithm FCF and dynamic list scheduling algorithm FLB is investigated in [10] Two low complexity efficient heuristics, the ....

.... A scalable scheduling scheme called STDS for heterogeneous systems is developed in [20] A dynamic matching and scheduling algorithm for heterogeneous system is investigated in [14] whereas, static job scheduling schemes that distribute workload in a heterogeneous system are proposed in [27] In [5], two cost functions that can be incorporated into a matching and scheduling algorithm for tasks with precedence constraints are introduced to consider the reliability of different resources in the system while making decisions. Unfortunately, all these scheduling algorithms assume that tasks in ....

[Article contains additional citation context not shown here]

A. Dogan,F. Ozguner, "Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing,"In Proc. of the 29th International Conference on Parallel Processing, 2000, pp. 307-314.

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