Name
Abstract | ||
|---|---|---|
Consider a Markovian system of two stations in tandem with finite intermediate buffer and two servers. The servers are heterogeneous, flexible, and more efficient when they work on their own than when they collaborate. We determine how the servers should be assigned dynamically to the stations with the goal of maximizing the system throughput. We show that the optimal policy depends on whether or not one server is dominant (i.e., faster at both stations) and on the magnitude of the efficiency loss of collaborating servers. In particular, if one server is dominant then he must divide his time between the two stations, and we identify the threshold policy the dominant server should use; otherwise each server should focus on the station where he is the faster server. In all cases, servers only collaborate to avoid idleness when the first station is blocked or the second station is starved, and we determine when collaboration is preferable to idleness as a function of the efficiency loss of collaborating servers. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s11134-013-9345-y | Queueing Syst. |
Keywords | Field | DocType |
Flexible servers,Server collaboration,Tandem queues,Throughput maximization,Markov decision processes,60K25,90B15,90B22,90B30 | Server farm,Markov process,Computer science,Server,Markov decision process,Real-time computing,Throughput maximization,Throughput,Distributed computing | Journal |
Volume | Issue | ISSN |
75 | 1 | 0257-0130 |
Citations | PageRank | References |
2 | 0.40 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sigrún Andradóttir | 1 | 548 | 55.09 |
| Hayriye Ayhan | 2 | 217 | 26.52 |
| Douglas G. Down | 3 | 370 | 37.04 |