BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:354@lincs.fr
DTSTART;TZID=Europe/Paris:20180124T140000
DTEND;TZID=Europe/Paris:20180124T160000
DTSTAMP:20180125T075056Z
URL:https://www.lincs.fr/events/performance-of-balanced-fairness-in-resour
 ce-pools-a-recursive-approach/
SUMMARY:Performance of Balanced Fairness in Resource Pools: A Recursive
 Approach
DESCRIPTION:Understanding the performance of a pool of servers is crucial
 for proper dimensioning. One of the main challenges is to take into account
 the complex interactions between servers that are pooled to process jobs.
 In particular\, a job can generally not be processed by any server of the
 cluster due to various constraints like data locality. In this paper\, we
 represent these constraints by some assignment graph between jobs and
 servers. We present a recursive approach to computing performance metrics
 like mean response times when the server capacities are shared according to
 balanced fairness. While the computational cost of these formulas can be
 exponential in the number of servers in the worst case\, we illustrate
 their practical interest by introducing broad classes of pool structures
 that can be exactly analyzed in polynomial time. This extends considerably
 the class of models for which explicit performance metrics are
 accessible.This is a joint work with Thomas Bonald and Fabien Mathieu.
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