Probabilistic load scheduling with priorities in distributed computing systems

In this paper a distributed computing system/network in which two types of loads (or jobs) namely local loads and global loads arrive are considered. The local loads originate at the individual processors/nodes in the network and have to be processed at the same processors. The global loads originate at the central scheduler and have to be distributed among the processors in the system. The individual processors in the system assign different priorities to local and global loads. A priority queuing optimization model of this situation is formulated as a nonlinear programming problem and a solution methodology is presented. The arrival rate of the global and local loads are assumed to follow Poisson distribution and the service time of the global and local loads at the processors follows a general or exponential service time distribution. Both the situations are analyzed. The objective of this study is to minimize the response time of the global loads in the network.