BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:377@lincs.fr
DTSTART;TZID=Europe/Paris:20180221T140000
DTEND;TZID=Europe/Paris:20180221T150000
DTSTAMP:20180305T124821Z
URL:https://www.lincs.fr/events/insensitivity-of-the-hydrodynamic-limit-of
 -ps-under-randomized-sqd-algorithms/
SUMMARY:Insensitivity of the Hydrodynamic Limit of PS under Randomized
 SQ(d) Algorithms
DESCRIPTION:In many applications such as cloud computing\, managing server
 farm resources etc. an incoming task or job has to be matched with an
 appropriate server in order to minimise the latency associated with the
 processing. Ideally the best choice would be to match a job to the fastest
 available server. However when there are thousands of servers requiring the
 information on all server tasks is an overkill.\nPioneered in the 1990’s
 the idea of randomised sampling of a few servers was proposed by Vve-
 denskaya and Dobrushin in Russia and Mitzmenmacher in the US and
 popularised as the “power of two” schemes which basically means that
 sampling two servers randomly and sending the job to the “better”
 server (i.e. with the shortest queue\, or most resources) provides most of
 the benefits of sampling all the servers.\n\nIn the talk I will discuss
 multi-server processor sharing models under power-of-d routing scheme when
 service time distributions are general with finite mean. Previous works on
 these models as- sume that the service times are exponentially distributed
 and insensitivity was suggested through simulations. Showing insensitivity
 to service time distributions has remained an open problem. The difficulty
 is that for general service times the underlying Markovian model is more
 complex. Indeed it can be viewed as a Markov process on Z+ × R?+ . Using a
 measure valued process approach we first derive the hydrodynamic limit or
 mean field equation (MFE) for the empirical measure. The MFE is now
 characterized by a pde whose stationary point coincides with the fixed
 point in the case with exponential service times. This establishes the
 insensitivity of the fixed point. The techniques developed in this paper
 are applicable to study mean field limits for Markov processes on general
 state spaces and insensitivity properties of other queueing models.\n\nThis
 is joint work with Thirupathiah Vasantam (UW) and Arpan Mukhopadhyay
 (EPFL).
CATEGORIES:Seminars,Youtube
LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\,
 France
GEO:48.828400;2.356897
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars
 room:geo:48.828400,2.356897
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR