CODEWITHSUNDEEP
queue
Anonymous
Anonymous

Reputation: 71

Algorithm and Data Structure - Queue

The 2 queueing strategies are as follows: 1. A single queue. Each server will take the next customer as soon as the server becomes available. 2. A queue for each server. Customers will choose the server with the shortest queue on arrival and not allowed to jump queue thereafter.

Can someone explain the 2nd queue? It means the same thing as the first queue just that the customer will choose the shortest one(which means will faster process the customer) to queue. Where can I get more information of this queue or if there is any sample code?

Upvotes: 1

Views: 219

Answers (1)

Varshith
Varshith

Reputation: 58

Image representing the two queuing strategies

It has been found out that the single queue - multiple servers approach is more efficient than the multiple queues approach. In this approach, the waiting time is almost equally distributed among all the customers, even though the processing time for each customer is different.

Here is a link to a detailed analysis and mathematical proof of the same.

Comparison Between Single and Multiple Queues

Upvotes: 1

Related Questions