4 papers · 1 filter
Fork-join and redundancy systems with heavy-tailed job sizes
Youri Raaijmakers, Sem Borst, Onno Boxma
We investigate the tail asymptotics of the response time distribution for the cancel-on-start (c.o.s.) and cancel-on-completion (c.o.c.) variants of redundancy- scheduling and t…
Achievable Stability in Redundancy Systems
Youri Raaijmakers, Sem Borst
We consider a system with parallel servers where incoming jobs are immediately replicated to, say, servers. Each of the servers has its own queue and follows a FCFS dis…
Stability of Redundancy Systems with Processor Sharing
Youri Raaijmakers, Sem Borst, Onno Boxma
We investigate the stability condition for redundancy-d systems where each of the servers follows a processor-sharing (PS) discipline. We allow for generally distributed job sizes,…
Redundancy scheduling with scaled Bernoulli service requirements
Youri Raaijmakers, Sem Borst, Onno Boxma
Redundancy scheduling has emerged as a powerful strategy for improving response times in parallel-server systems. The key feature in redundancy scheduling is replication of a job u…