Eager scheduling with lazy retry for dynamic task scheduling
Task scheduling policies can be generally classified as eager scheduling and lazy scheduling. The former attempts to schedule the tasks whenever there are free processors available, while the latter delays the scheduling of some tasks so as to accommodate more appropriate tasks. In this paper we propose a hybrid policy, called eager scheduling with lazy retry (ESLR). This policy tries to schedule a task eagerly upon its arrival. If the scheduling fails, then the task is rescheduled after a delay period. This later mechanism is referred to as lazy retry. Simulation results show that the ESLR policy can reduce system fragmentation and enhance scheduling efficiency.
Unable to display preview. Download preview PDF.
- 1.Kim, J., Das, C.R., Lin, W.: A top-down processor allocation scheme for hypercube computers. IEEE Trans. on Parallel and Distributed Systems 2 (1991)Google Scholar
- 2.Krueger, P., Lai, T.H., Dixit-Radiya, V.A.: Job scheduling is more important than processor allocation for hypercube computers. IEEE Trans. on Parallel and Distributed Systems 5 (1994)Google Scholar
- 3.Mohapatra, P., Yu, C., Das, C.R., Kim, J.: A lazy scheduling scheme for improving hypercube performance. Proc. of Int. Conf. on Parallel Processing (1993)Google Scholar