论文信息 - A Note on Graham's Bound

A Note on Graham's Bound

Abstract In [2], Graham establishes an upper bound for the makespan of a set of tasks whose executions are governed by given precedence constraints. In this paper we provide a similar upper bound for the makespan of such parallel processing systems when the interprocessor communication delays are taken into account. Our result is a slight generalization of that of Graham's.

Zhen Liu | Z. Liu

[1] J. Labetoulle,et al. A heuristic method for loading and scheduling flexible manufacturing systems , 1988 .

[2] Victor J. Rayward-Smith,et al. UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[3] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .

[4] Jing-Jang Hwang,et al. Multiprocessor scheduling with interprocessor communication delays , 1988 .

[5] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[6] Jing-Jang Hwang,et al. Deterministic scheduling in systems with interprocessor communication times , 1987 .

[7] Zhen Liu,et al. On the Optimal Stochastic Scheduling of Out-Forests , 1992, Oper. Res..