Scheduling partially ordered tasks with probabilistic execution times

• DOI: 10.1145/1067629.806534
• Publication Date: 2005-11-07T19:28:32Z
• Authors: K. M. Chandy; P. F. Reynolds
• Keywords: Human multitasking; Response time; Erlang (programming language); Computer multitasking

The objective of this paper is to relate models multi-tasking in which task times are known or be equal unknown. We study bounds on completion and the applicability optimal deterministic schedules probabilistic models. Level algorithms shown for forest precedence graphs independent identically distributed exponential Erlang random variables. A time sharing system simulation shows that could reduce response insensitive scheduling disciplines.