The week's events
-
Keynote LIG
Keynote LIG
–
October 5, 2017
-
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 October–November 2017
MMonday TTuesday WWednesday TThursday FFriday SSaturday SSunday 25September 25, 201726September 26, 201727September 27, 2017On-line speed scaling minimizing expected energy consumption for real-time tasks, by Stephan Plassart (Polaris)
–
September 28, 2017We present a Markov Decision Process (MDP) approach to compute the optimal on-line speed scaling policy to minimize the energy consumption of a processor executing a finite or infinite set of jobs with real-time constraints. The policy is computed off-line but used on-line. We provide several qualitative properties of the optimal policy: monotonicity with respect to the jobs parameters, comparison with on-line deterministic algorithms. Numerical experiments show that our proposition performs well when compared with off-line optimal solutions and out-performs on-line solutions oblivious to statistical information on the jobs.
Bâtiment IMAG (442)29September 29, 201730September 30, 2017October
1October 1, 20172October 2, 20173October 3, 20174October 4, 2017Keynote LIG
–
October 5, 20176October 6, 20177October 7, 20178October 8, 2017Seminar Takai Kennouche : LTE/WiFi Coexistence: a WiFi interference-evasion approach
–
October 9, 2017LTE/WiFi Coexistence: a WiFi interference-evasion approach
Abstract
The growing spectrum crunch has motivated exploratory efforts in the use of LTE in the 5GHz ISM bands for downlink traffic. However, this paradigm raises concerns of fair sharing of the spectrum and the adverse impact of scheduled LTE frames on Wi-Fi Packet Success Rates (PSR). To address this issue, we propose an interference-evasion mechanism that allows Wi-Fi devices to survive LTE transmissions without any cooperation between these two different standards. Different from existing approaches, we argue that the simple use of Almost Blank Subframes (ABS) within the LTE standard offering short channel access windows overestimates opportunities for Wi-Fi. The pilots embedded in the ABS not only interfere with Wi-Fi but also adversely impact the carrier sensing function. E-Fi mitigates this problem through a two-fold approach. It uses a combination of (i) Wi-Fi Direct with packet relaying and (ii) classical distributed coordination function to reach distant nodes. Second, it ensures load balancing for both Wi-Fi uplink and downlink traffic with high PSR by creating node-groups with dedicated contention-based medium access intervals. Our approach is validated by comprehensive simulation and experimental results that indicate significantly higher throughput in our approach compared to classical Wi-Fi.Bâtiment IMAG (442)10October 10, 2017Thematic day: Optimizing Data Move-ments
–
October 11, 2017*9:30—10:45*: courts exposés & discussions
- Louis-Claude CANON (ROMA, Inria):
«Low-Cost Approximation Algorithms for Scheduling Independent Tasks on
Hybrid Platforms»- Grégory MOUNIÉ (LIG, Univ. Grenoble Alpes):
«Towards large-scale data-location-driven scheduling»*10:45—11:00*: pause
*11:00—12:30*: courts exposés & discussions
- Lionel EYRAUD-DUBOIS (LaBRI, Inria):
«Data Distribution to reduce communications in Parallel Matrix
Multiplication»- Alix MUNIER (LIP6, UPMC):
«Modelling Simulink periodic applications using Synchronous DataFlow Graphs»*14:00—16:00*: soutenance de thèse
- Raphaël BLEUSE (LIG, Univ. Grenoble Alpes):
«Appréhender l’hétérogénéité à (très) grande échelle.»"Fête de la science"
–
October 12, 201713October 13, 201714October 14, 201715October 15, 201716October 16, 201717October 17, 201718October 18, 2017Asymptotic Studies of Large Distributed systems with Failures by Philippe Robert (Inria, Paris)
–
October 19, 2017Asymptotic Studies of Large Distributed systems with Failures
The qualitative behavior of a large scale storage network of non reliable file servers is investigated. In such systems a fraction of the processing capacity can be used to duplicate files on new servers when necessary. Due to random losses, with probability 1 all files will be lost eventually if no new files are added. The main question in this context is of understanding the relation between the durability of the system and the parameters of the network: the duplication capacity, the failure rate, the duplication factor and the average load of a node. Different scalings via mean-field limits or stochastic averaging can be used to study the eventual decay of these networks. They will be reviewed and discussed. An analysis of placement algorithms will be also presented.
Bâtiment IMAG (442)20October 20, 201721October 21, 201722October 22, 201723October 23, 201724October 24, 201725October 25, 2017Association dans les réseaux WiFi, par Isabelle Guerin (Lyon)
–
October 26, 2017Les déploiements de réseaux WiFi denses permettent à une station d’avoir le choix entre plusieurs points d’accès lors de la connexion au réseau WiFi, améliorant ainsi la couverture radio, la qualité des liens radio et facilitant la mobilité. En contrepartie, la densité des points d’accès peut générer plus d’interférences et de contention, ce qui peut amener à une baisse du débit global puisque ces points d’accès doivent partager un nombre limité de canaux. Le retour à une gestion centralisée des réseaux WiFi offre l’opportunité d’une optimisation globale de l’usage de la ressource radio et donc de réduire les problèmes soulevés lors d’un partage intensif de cette dernière.
Dans cet exposé, je vous montrerai, qu’en modifiant l’étape d’association dans les réseaux WiFi (qui est dans les interfaces WiFi actuelles basée sur le RSSI -Received Signal Strength Indicator-), il est possible d’améliorer le débit global du réseau ainsi que l’équité entre les stations.Bâtiment IMAG (442)27October 27, 201728October 28, 201729October 29, 201730October 30, 201731October 31, 2017November
1November 1, 20172November 2, 20173November 3, 20174November 4, 20175November 5, 2017Journée de rentrée commune POLARIS/DATAMOVE
–
November 6, 2017Bâtiment IMAG (amphitheater)Saint-Martin-d'Hères, 38400France7November 7, 20178November 8, 2017Keynote LIG: George Wright - State of the Art Media Research
10November 10, 201711November 11, 201712November 12, 201713November 13, 201714November 14, 201715November 15, 2017Detecting Performance Outliers for Task-based HPC Applications in multi-[CPU|GPU|Node] clusters By Lucas Schnorr (Porto Allegre)
–
November 16, 2017Detecting Performance Outliers for Task-based HPC Applications in
multi-[CPU|GPU|Node] clustersProgramming paradigms in High-Performance Computing have
been shifting towards task-based models which are capable of
adapting readily to heterogeneous and scalable
supercomputers. Detecting performance outliers in such environments
is particularly difficult because it must consider architecture
heterogeneity and variability. In this work we present how we have
employed a very simple performance model to highlight task outliers
of the well-known tiled-based dense Cholesky factorization running
on top of StarPU-MPI, a runtime for task-based applications. Such
work has been integrated into our visualization framework based on the
R programming language and the tidyverse meta-package. Experiments
have been conducted in a controlled environment using the Chifflet
cluster at Lille, part of the Grid'5000 infrastructure, using up to
eight nodes, each one equipped with 28 cores and two GPUs. The
preliminary results, derived from collected traces, indicate that
explicit binding for the MPI and GPU-managing threads, within
StarPU, alleviate the issue, leading to performance gains.Bâtiment IMAG (406)Saint-Martin-d'Hères, 38400France17November 17, 201718November 18, 201719November 19, 201720November 20, 201721November 21, 201722November 22, 2017Inria 50th year Celebration
–
November 23, 201724November 24, 201725November 25, 201726November 26, 201727November 27, 201728November 28, 201729November 29, 2017Convergence d’algorithme de non regret, Amélie Heliou (Polaris)
–
November 30, 2017Les algorithmes de non-regret sont souvent utilisés dans les jeux répétés où les joueurs ont peu d’information sur le jeu auquel ils jouent. Ces algorithmes garantissent que le regret de chaque joueur est sous-linéaire. La moyenne temporelle des stratégies choisies en suivant un algorithme de non-regret converge dans l’ensemble des équilibres corrélés. Cependant cela ne donne aucune information sur la convergence de la séquence de stratégies.
Nous nous sommes intéressés à la question « est-ce que la sequence de stratégie obtenue pas un algorithme de non regret converge vers un équilibre de Nash? ».
Dans cet exposé, je présenterai un algorithme de non regret appelé Hedge qui est une version d’algorithmes à poids exponentiels. En particulier, je discuterai la convergence des séquences de stratégies obtenues par Hedge en utilisant deux types d’informations accessibles aux joueurs.Bâtiment IMAG (442)December
1December 1, 20172December 2, 20173December 3, 2017Meta
