Assignment of programs in a distributed system with resequencing

Abstract

The assignment of independent applications in a distributed system in conjunction with resequencing is studied in this paper using simulation techniques. Three scheduling policies are studied and compared. A probabilistic policy, and two policies that use an estimation of job service time, one deterministic and one adaptive. Their performance is examined for a variety of workloads. The impact on performance of resequencing delay is also explored.