March 1, 2018
Keynote
N/A
March 1, 2018
-
News
- Journée au vert POLARIS 2022/05/23
- DATAMOVE/POLARIS picnic 2021/06/22
- DATAMOVE/POLARIS BBQ 2019 2019/06/14
- POLARIS Bootcamp (May 2019) 2019/05/24
- slides of Andras Gyorgy 2016/01/15
Next seminars
Events
Events in March–April 2018
MMonday TTuesday WWednesday TThursday FFriday SSaturday SSunday 26February 26, 201827February 27, 201828February 28, 2018March
KeynoteN/A
March 1, 20182March 2, 20183March 3, 20184March 4, 20185March 5, 20186March 6, 20187March 7, 2018Randomized Load Balancing: Asymptotic Optimality of Power-of-d-Choices with Memory by Jonatha Anselmi (Inria Bordeaux)–
March 8, 2018In multi-server distributed queueing systems, the access of stochastically arriving jobs to resources is often regulated by a dispatcher. A fundamental problem consists in designing a load balancing algorithm that minimizes the delays experienced by jobs. During the last two decades, the power-of-d-choice algorithm, based on the idea of dispatching each job to the least loaded server out of $d$ servers randomly sampled at the arrival of the job itself, has emerged as a breakthrough in the foundations of this area due to its versatility and appealing asymptotic properties. We consider the power-of-d-choice algorithm with the addition of a local memory that keeps track of the latest observations collected over time on the sampled servers. Then, each job is sent to a server with the lowest observation. We show that this algorithm is asymptotically optimal in the sense that the load balancer can always assign each job to an idle server in the large-server limit. This holds true if and only if the system load $\lambda$ is less than $1-\frac{1}{d}$. If this condition is not satisfied, we show that queue lengths are bounded by $j^\star+1$, where $j^\star\in\mathbb{N}$ is given by the solution of a polynomial equation. This is in contrast with the classic version of the power-of-d-choice algorithm, where queue lengths are unbounded. Our upper bound on the size of the most loaded server, $j^*+1$, is tight and increases slowly when $\lambda$ approaches its critical value from below. For instance, when $\lambda= 0.995$ and $d=2$ (respectively, $d=3$), we find that no server will contain more than just $5$ ($3$) jobs in equilibrium. Our results quantify and highlight the importance of using memory as a means to enhance performance in randomized load balancing.
9March 9, 201810March 10, 201811March 11, 201812March 12, 201813March 13, 201814March 14, 2018Obtaining Dynamic Scheduling Policies with Simulation and Machine Learning (by Danilo Santos, Datamove)–
March 15, 2018Obtaining Dynamic Scheduling Policies with Simulation and Machine Learning
Abstract: Dynamic scheduling of tasks in large-scale HPC platforms is normally accomplished using ad-hoc heuristics, based on task characteristics, combined with some backfilling strategy. Defining heuristics that work efficiently in different scenarios is a difficult task, specially when considering the large variety of task types and platform architectures. In this work, we present a methodology based on simulation and machine learning to obtain dynamic scheduling policies. Using simulations and a workload generation model, we can determine the characteristics of tasks that lead to a reduction in the mean slowdown of tasks in an execution queue. Modeling these characteristics using a nonlinear function and applying this function to select the next task to execute in a queue improved the mean task slowdown in synthetic workloads. When applied to real workload traces from highly different machines, these functions still resulted in performance improvements, attesting the generalization capability of the obtained heuristics.
16March 16, 201817March 17, 201818March 18, 201819March 19, 201820March 20, 201821March 21, 2018A Class of Stochastic Multilayer Networks: Percolation, Exact and Asymptotic Results by Philippe Nain (inria, Lyon)–
March 22, 2018Abstract:
In this talk, we will introduce a new class of stochastic multilayer networks. A stochastic multilayer network is the aggregation of M networks (one per layer) where each is a subgraph of a foundational network G. Each layer network is the result of probabilistically removing links and nodes from G. The resulting network includes any link that appears in at least K layers. This model, which is an instance of a non-standard site-bond percolation model, finds applications in wireless communication networks with multichannel radios, multiple social networks with overlapping memberships, transportation networks, and, more generally, in any scenario where a common set of nodes can be linked via co-existing means of connectivity. Percolation, exact and asymptotic results will be presented.Bâtiment IMAG (442)23March 23, 201824March 24, 201825March 25, 201826March 26, 201827March 27, 2018Parallel Space-Time Kernel Density Estimation By Erik Saule (U. Caroline du Nord)–
March 28, 2018The exponential growth of available data has increased the need for
interactive exploratory analysis. Dataset can no longer be understood
through manual crawling and simple statistics. In Geographical
Information Systems (GIS), the dataset is often composed of events
localized in space and time; and visualizing such a dataset involves
building a map of where the events occurred.We focus in this paper on events that are localized among three
dimensions (latitude, longitude, and time), and on computing the first
step of the visualization pipeline, space-time kernel density
estimation (STKDE), which is most computationally expensive. Starting
from a gold standard implementation, we show how algorithm design and
engineering, parallel decomposition, and scheduling can be applied to
bring near real-time computing to space-time kernel density
estimation. We validate our techniques on real world datasets
extracted from infectious disease, social media, and ornithology.Bâtiment IMAG (442)Polyhedral Optimization at Runtime, by Manuel Selva.–
March 29, 2018The polyhedral model has proven to be very useful to optimize and parallelize a particular class of compute intensive application kernels. A polyhedral optimizer needs to have affine functions defining loop bounds, memory accesses and branching conditions. Unfortunately, this information is not always available at compile time. To broaden the scope of polyhedral optimization opportunities, runtime information can be considered. This talk will highlight the challenges of integrating polyhedral optimization in runtime systems:
- When and how to detect opportunities for polyhedral optimization?
- How to model the observed runtime behavior in a polyhedral fashion?
- How to deal at runtime with the complexity of polyhedral algorithm?These challenges will be illustrated in the context of both the APOLLO framework targeting C and C++ applications and of the JavaScript engine from Apple.
Bâtiment IMAG (442)30March 30, 201831March 31, 2018April
1April 1, 20182April 2, 20183April 3, 20184April 4, 20185April 5, 20186April 6, 20187April 7, 20188April 8, 20189April 9, 201810April 10, 201811April 11, 2018presentation of the Argo project by Swann Perarnau (Argonne National Laboratory)–
April 12, 201813April 13, 201814April 14, 201815April 15, 201816April 16, 201817April 17, 201818April 18, 201819April 19, 201820April 20, 201821April 21, 201822April 22, 201823April 23, 201824April 24, 201825April 25, 2018Approximate equilibria of Colonel Blotto games, by Quan Vu (Polaris and Nokia)–
April 26, 2018Resource allocation games are commonly used to model problems in many domains ranging from security to advertising. One of the most important resource allocation games is the Colonel Blotto game: Two players distribute a fixed budget of resources over multiple battlefields to maximize the aggregate value of battlefields they win, each battlefield being won by the player who allocates more resources to it. Despite its long-standing history and importance, the continuous version of the game---where players can choose any fractional allocation---still lacks a complete Nash equilibrium solution in its general form with asymmetric players' budgets and heterogeneous battlefield values.
In this work, we propose an approximate equilibrium for this general case. We construct a simple strategy (the independently uniform strategy) and prove that it is an epsilon-equilibrium. We give a theoretical bound on the approximation error in terms of the number of battlefields and players’ budgets which identifies precisely the parameters regime for which our strategy is a good approximation. We also investigate an extension to the discrete version (where players can only have integer allocations), for which we proposed an algorithm to compute very efficiently an approximate equilibrium. We perform numerical experiments that guarantee that we can "safely" use this strategy in practice. Our work extends the scope of application of Colonel Blotto games in several practical cases, especially with large games' parameters (e.g. in advertisements, voting, security, etc.,)
Bâtiment IMAGSaint-Martin-d'Hères, 38400France27April 27, 201828April 28, 201829April 29, 201830April 30, 2018May
1May 1, 20182May 2, 20183May 3, 2018A data structure for analyzing spatio-temporal correlations of alarms, by Anne Bouillard (Nokia)–
May 4, 2018In this talk, I will present a data structure for the analysis of correlations of alarms, for root-cause analysis or prediction purposes. This is a joint work with Marc-Olivier Buob and Maxime Raynal (intern). A sequence of alarms is modeled by a directed acyclic graph. The nodes of the graph are the alarms, that are represented by a symbol and an interval of time. An arc of the graph is interpreted as a potential causality between two alarms. I will first show how to build a "compact" structure storing all the potential causal sequences of alarms and then how to weight this structure so that the actual correlations can be detected. The efficiency of the approach will be demonstrated on toy examples.
Bâtiment IMAG (442)5May 5, 20186May 6, 2018Meta
