Our paper “Privacy-Conscious Information Diffusion in Social Networks” by George Giakkoupis, Rachid Guerraoui, Arnaud Jégou, Anne-Marie Kermarrec and Nupur Mittal has been accepted at DISC 2015.
Paper accepted at DISC 2015
Aug 31st, 2015 by Pierre-Louis Roman
Mediego is one of the winners of the 2015 i-LAB prize
Jul 10th, 2015 by Pierre-Louis Roman
Mediego, the start-up founded by Anne-Marie Kermarrec, is one of the proud winners of this year’s i-LAB prize, the national start-up creation competition, sponsored by the French Ministry of Higher Education and Research.
Paper accepted at USENIX ATC 2015
Jun 5th, 2015 by Pierre-Louis Roman
Our paper “Hawk: Hybrid Datacenter Scheduling” by P. Delgado, F. Dinu, A.-M. Kermarrec, and W. Zwaenepoel has been accepted at the 2015 USENIX Annual Technical Conference (USENIX ATC 2015).
D1 seminar: Talk of John Wilkes on April the 27th in Markov room at 10:30 AM
Apr 22nd, 2015 by arault
We are receiving John Wilkes from Google. He will give a talk on Monday, April 27th, at 10:30 AM, in room Markov (G105, blue level).
Title: Large-scale cluster management at Google with Borg
Abstract:
Google’s Borg system is a cluster manager that runs hundreds of thousands of jobs, from many thousands of different applications, across a number of clusters each with up to tens of thousands of machines.
It achieves high utilization by combining admission control, efficient task-packing, over-commitment, and machine sharing with process-level performance isolation. It supports high-availability applications with runtime features that minimize fault-recovery time, and scheduling policies that reduce the probability of correlated failures. Borg simplifies life for its users by offering a declarative job specification language, name service integration, real-time job monitoring, and tools to analyze and simulate system behavior.
I’ll present a longer version of the paper talk that will be given at EuroSys on April 22. It’ll include a quick summary of the Borg system architecture and features, but focus mostly on a quantitative analysis of some of its policy decisions.
D1 seminar: Talk of Emmanuel Godard on April the 24th in Aurigny room at 10:00 AM
Apr 13th, 2015 by arault
We are receiving Emmanuel Godard from Université Aix-Marseille. He will give a talk on April 24th at 10:00 AM in room Aurigny (D165, orange level).
Title: Combinatorial Aspects of Message Adversaries
Abstract: “Message adversaries” denotes a synchronous distributed model. The term was coined recently [Afek & Gafni 2013], but the model was actually introduced long time ago in many contexts (from system with message omissions to dynamic networks). In the message passing context, it corresponds to the mobile omissions model [Santoro & Widmayer 89] but also the more recent “Heard-of” model [Charron-Bost & Schiper 09]. There are also equivalences (from a computability point of view) with shared memory models, like the “iterated snapshot” model [Borowsky & Gafni 93]. Some message adversaries, with specific restrictions, are also proved to be equivalent to standard asynchronous shared memory models [Raynal & Stainer 13].
We present results we have obtained considering message adversaries in the more general (combinatorial) way. We also discuss how a combinatorial approach might help investigate the current challenges in distributed computability.