Author:
Chandy K. M.,Reynolds P. F.
Abstract
The objective of this paper is to relate models of multi-tasking in which task times are known or known to be equal to models in which task times are unknown. We study bounds on completion times and the applicability of optimal deterministic schedules to probabilistic models. Level algorithms are shown to be optimal for forest precedence graphs in which task times are independent and identically distributed exponential or Erlang random variables. A time sharing system simulation shows that multi-tasking could reduce response times and that response time is insensitive to multi-tasking scheduling disciplines.
Publisher
Association for Computing Machinery (ACM)
Reference9 articles.
1. Coffman E.G. and Denning P.J. Operating Systems Theory Prentice-Hall Englewood Cliffs N.J. (1974). Coffman E.G. and Denning P.J. Operating Systems Theory Prentice-Hall Englewood Cliffs N.J. (1974).
2. Parallel Sequencing and Assembly Line Problems
3. Coffman E.G. and Graham R.L. "Optimal scheduling for two-processor systems" Acta Informatica 1.3. (1972) 200-213. Coffman E.G. and Graham R.L. "Optimal scheduling for two-processor systems" Acta Informatica 1.3. (1972) 200-213.
4. Optimal Preemptive Scheduling on Two-Processor Systems
5. A comparison of list schedules for parallel processing systems
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献