This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Job Assignment for a Parallel System of Processor Sharing Queues
July 1990 (vol. 39 no. 7)
pp. 858-869

Two of the optimality criteria most commonly considered to compare job assignment policies, namely, the stochastic order and the average total completion time criterion, are discussed. It is shown that the latter, while being weaker than the former, still provides a useful criterion when policies are to be evaluated in terms of average performance measures such as the system average response time. Some of the most relevant results available in the literature on job assignment to parallel first come, first served (FCFS) servers are summarized. The assignment problem is discussed for a parallel system of processor sharing (PS) queues with exponential interarrival times and exponential and identical service requirements. The optimality of the join-the-shortcut-queue (JSQ) assignment policy for this case is proven. Feasible policies for general service time distribution are discussed. An approach allowing a meaningful comparison of servers in the perspective of job assignment is proposed. A comparison of the assignment problem for FCFS and PS parallel systems is presented.

Index Terms:
job assignment; parallel system of processor sharing queues; stochastic order; average total completion time criterion; performance measures; system average response time; join-the-shortcut-queue; parallel processing; performance evaluation; queueing theory; scheduling.
Citation:
F. Bonomi, "On Job Assignment for a Parallel System of Processor Sharing Queues," IEEE Transactions on Computers, vol. 39, no. 7, pp. 858-869, July 1990, doi:10.1109/12.55688
Usage of this product signifies your acceptance of the Terms of Use.