8 citations found. Retrieving documents...
C. C. Hsu, S. D. Wang, and T. S. Kuo. Minimization of task turnaround time for distributed systems. In Proceedings of the 13th annual international computer software and Applications Conference, 1989.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Scheduling Support Mechanisms for Autonomous, Heterogeneous.. - Chapin (1993)   (Correct)

.... N N MICROS [WV80] Y Y Y N N Y Y N Klappholz and Park [KP84] DRS) Y N Y N N x Y N Reif and Spirakis [RS82] Y N Y N N x N N Ousterhout, et al. OSS80] Y Y N N N x N N Bergmann and Jagadeesh [BJ91] Y N N N N x N N Drexl [Dre90] Y N N Y N x x N Hochbaum and Shmoys [HS88] Y N N Y N x x N Hsu, et al. HWK89] Y N N Y N x x N Stone [Sto77] Y N N Y N x x N Lo [Lo88] Y N N Y N x x N Price and Salama [PS90] Y N N Y N x x N Ramakrishnan et al. RCD91] Y N N Y N x x N Sarkar [Sar89] Y N N Y N x x N Sarkar and Hennessey [SH86b] Y N N Y N x x N 30 Casavant and Kuhl [CK84] describes a distributed task ....

....different processing speeds, called the dual approximation algorithm. The algorithm solves a relaxed form of the binpacking problem to produce a schedule within a parameterized factor, ffl, of optimal. That is, the total run time is bounded by (1 ffl) times the optimal run time. Hsu, et al. HWK89] describes an approximation technique called the critical sink underestimate method. The task force is represented as a directed acyclic graph, 35 with vertices representing tasks and edges representing execution dependencies. If an edge (ff; fi) appears in the graph, then ff must execute ....

C. C. Hsu, S. D. Wang, and T. S. Kuo. Minimization of task turnaround time for distributed systems. In Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989.


Simulation Of Static And Dynamic Task Scheduling On.. - Dimitriou (1994)   (Correct)

.... underestimates algorithm for optimal task assignment in distributed systems, which is tested using many varying model parameters, some of which are similar to parameters used in this work. Another branch and bound task assignment algorithm for distributed systems is presented in [Hsu et al. 1989], which is based on a DU mapping technique, i.e. a Directed to Undirected graph mapping. A comparison between critical path and group scheduling for distributed systems can be found in [Lo and Gligor, 1987] the latter is a technique that schedules communicating tasks on the same processor. The ....

Hsu, C.-C., Wang, S.-D., and Kuo, T.-S. (1989). Minimization of task turnaround time for distributed systems. In IEEE Int'l. Computer Software and Applications Conf., pages 2--7.


Constructing Distributed Schedulers Using - The Messiahs Interface   (Correct)

No context found.

C. C. Hsu, S. D. Wang, and T. S. Kuo. Minimization of task turnaround time for distributed systems. In Proceedings of the 13th annual international computer software and Applications Conference, 1989.


Distributed And Multiprocessor Scheduling - Steve Chapin Kent (1996)   (8 citations)  (Correct)

No context found.

C. C. Hsu, S. D. Wang, and T. S. Kuo. Minimization of Task Turnaround Time for Distributed Systems. In Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989. 28


Distributed and Multiprocessor Scheduling - Chapin (1996)   (8 citations)  (Correct)

No context found.

C. C. Hsu, S. D. Wang, and T. S. Kuo. Minimization of Task Turnaround Time for Distributed Systems. In Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989. 28


Support for Implementing Scheduling Algorithms Using Messiahs - Chapin, Spafford (1994)   (4 citations)  (Correct)

No context found.

C. C. Hsu, S. D. Wang, and T. S. Kuo. Minimization of Task Turnaround Time for Distributed Systems. In Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989.


Constructing Distributed Schedulers Using the - Messiahs Interface Language   (Correct)

No context found.

C. C. Hsu, S. D. Wang, and T. S. Kuo. Minimization of task turnaround time for distributed systems. In Proceedings of the 13th annual international computer software and Applications Conference, 1989.


Constructing Distributed Schedulers Using the - Messiahs Interface   (Correct)

No context found.

C. C. Hsu, S. D. Wang, and T. S. Kuo. Minimization of task turnaround time for distributed systems. In Proceedings of the 13th annual international computer software and Applications Conference, 1989.

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