Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Journal of the ACM (JACM)
A comparison of list schedules for parallel processing systems
Communications of the ACM
Operating Systems Theory
Analysis of a level algorithm for preemptive scheduling
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Analytic Model of a Large Scale Interactive System Including the Effects OfFinite Main Memory
Analytic Model of a Large Scale Interactive System Including the Effects OfFinite Main Memory
Efficient distributed simulation
ACM SIGSIM Simulation Digest
Efficient distributed simulation
ANSS '89 Proceedings of the 22nd annual symposium on Simulation
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Scheduling tasks with critical sections
ACM '77 Proceedings of the 1977 annual conference
A stochastic scheduling algorithm for precedence constrained tasks on Grid
Future Generation Computer Systems
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
| Hi-index | 0.01 |
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.