Question: A queue is a first-infirst-out data structure. Suppose you have two queues accepting requests for a particular service, but at some point, the server for
A queue is a first-infirst-out data structure. Suppose you have two queues accepting requests for a particular service, but at some point, the server for one queue goes down. You must now merge the two queues. If no other information is available, what might a reasonable strategy be for forming a single queue out of the two queues? What additional information would be necessary to form a single queue in such a way to be most fair to all requests?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
