Abstract
If queue-states are unknown to a dispatcher, a replication strategy has been proposed where job copies are sent randomly to servers. When the service of any copy is completed, redundant copies are removed. For jobs that can be algebraically manipulated and have linear servers, to get the response-time performance of sending d copies of n jobs via the replication strategy, with Maximum Distance Separable (MDS) codes we show that n+d jobs suffice. That is, while replication is multiplicative, MDS is linear.
Original language | English |
---|---|
Pages (from-to) | 91-95 |
Number of pages | 5 |
Journal | Operations Research Letters |
Volume | 49 |
Issue number | 1 |
Early online date | 19 Nov 2020 |
DOIs | |
Publication status | Published - Jan 2021 |
Keywords
- Batch-completion times
- Load balancing
- MDS codes
- Replication
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics