BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Queueing with Redundant Requests:  A more realistic model - Mor Ha
 rchol-Balter - CMU
DTSTART:20160916T100000Z
DTEND:20160916T110000Z
UID:TALK67010@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Recent computer systems research has proposed using redundant 
 requests to reduce latency. The idea is to replicate a request so that it 
 joins the queue at multiple servers\, where the request is considered comp
 lete as soon as any one copy of the request completes.\n\nRedundancy is be
 neficial because it allows us to overcome server-side variability -- the f
 act that the server we choose might be temporarily slow\, due to factors l
 ike background load\, network interrupts\, garbage collection\, and so on.
    When server-side variability dominates runtime\, replicating requests c
 an greatly reduce their response times.  \n\nIn the past few years\, queue
 ing theorists have begun to study redundancy\, first via approximations\, 
 and\, more recently\, via exact analysis.   Unfortunately\, for analytical
  tractability\, all the theoretical analysis has assumed models where a jo
 b's replicas each have independent service requirements\, unrelated to the
  job's inherent size.   These unrealistic models have resulted in analysis
  which differs greatly from computer systems implementation results.\n\nIn
  this talk\, we introduce a much more realistic model of redundancy.   Our
  model allows us to decouple the inherent job size (X) from the server-sid
 e slowdown (S)\, where we track both S and X for each job.  Analysis withi
 n the S&X model is\, of course\, much more difficult.  Nevertheless\, we d
 erive a policy which is both analytically tractable within the S&X model a
 nd has provably excellent performance.\n\nJoint work with: Kristy Gardner 
 and Alan Scheller-Wolf.\n
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR