PROBABILISTIC LOAD SCHEDULING WITH PRIORITIES IN DISTRIBUTED COMPUTING SYSTEMS

In this paper a distributed computing system/network in which two type of loads (or jobs) namely local loads and global loads arrive is cons idered. The local loads originate at the individual processors/nodes i n the network and have to be processed at the same processors. The glo bal loads originate at the central scheduler and have to be distribute d among the processors in the system. The individual processors in the system assign different priorities to local and global loads. A prior ity queuing optimization model of this situation is formulated as a no nlinear programming problem and a solution methodology is presented. T he arrival rate of the global and local loads are assumed to follow Po isson distribution and the service time of the global and local loads at the processors follow a general or exponential service time distrib ution. Both the situations are analyzed. The objective of this study i s to minimize the response time of the global loads in the network. (C ) 1998 Published by Elsevier Science Ltd. All rights reserved.