We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Optimal assignment of servers to tasks when collaboration is inefficient.
- Authors
Andradóttir, Sigrún; Ayhan, Hayriye; Down, Douglas
- 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.
- Subjects
QUEUEING networks; INTERNET servers; SCIENTIFIC community; MARKOV processes; SAMPLE path analysis; COMPUTER network resources
- Publication
Queueing Systems, 2013, Vol 75, Issue 1, p79
- ISSN
0257-0130
- Publication type
Article
- DOI
10.1007/s11134-013-9345-y