AbstractJob scheduling is a crucial factor affecting the performance of a distributed computer system (DCS). For effective utilization of the resources of a DCS, it is important that no processors remain idle at any time. A job may be run locally or on a remote processor, as decided by the job-scheduling policy. A jobscheduling algorithm may be either source initiated or server initiated. It has been shown that server-initiated algorithms generally outperform source-initiated algorithms. This paper proposes a simple dynamic and decentralized server-initiated job scheduling algorithm, that minimizes the unnecessary movement of jobs from processor to processor. The performance of this algorithm has been studied by a simulation experiment.