论文信息 - A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints - 字舞流文

A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints

[1] Virginia Mary Lo,et al. Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[2] James B. Sinclair,et al. Efficient Computation of Optimal Assignments for Distributed Tasks , 1987, J. Parallel Distributed Comput..

[3] Jacob A. Abraham,et al. Load Balancing in Distributed Systems , 1982, IEEE Transactions on Software Engineering.

[4] Kemal Efe,et al. Heuristic Models of Task Assignment Scheduling in Distributed Systems , 1982, Computer.

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .