ASAP is co-organizing the 3rd workshop on storage in collaboration with Technicolor Rennes on November 21-22.

Here is the list of invited senior speakers:

  • Xiao Bai (Yahoo! Research)
  • Edouard Bugnion (EPFL)
  • Alexandru Costan (INRIA)
  • Peter Druschel (MPI)
  • George Giakkoupis (INRIA)
  • Christos Gkantsidis (Microsoft Research)
  • Rachid Guerraoui (EPFL)
  • Anne-Marie Kermarrec (INRIA)
  • Julian Nevell (Technicolor)
  • Paolo Romano (INESC-ID)
  • Marko Vukolic (Eurecom)

Program includes student talks and a poster session (call for poster available on the webpage).

On the 22nd afternoon, there is a dissemination workshop for the FP7 project Figaro.

All details and program to be found here

SOUK: Social Observation of hUman Kinetics

Simulating pervasive systems requires accurate assumptions on the behavior of human groups. Recent models consider this behavior as a combination of both social and spatial factors. Yet, establishing accurate traces of human groups is difficult: current techniques capture either positions, or contacts, with a limited accuracy.

In this presentation we introduce a new technique to capture such behaviors. The interest of this approach lies in the unprecedented accuracy at which both positions and orientations of humans, even gathered in a crowd, are captured. From the mobility to the topological connectivity, the open-source framework we developed offers a layered approach that can be tailored, allowing to compare and reason about models and traces.

We introduce a new trace of 50 individuals on which the validity and accuracy of this approach is demonstrated. To showcase the interest of our software pipeline, we compare it against the random waypoint model. Our fine-grained analyzes, that take into account social interactions between users, show that the random waypoint model is not a reasonable approximation of any of the phenomena we observed.

Check it out!

On June the 28th, we are pleased to welcome Yehuda Afek (Blavatnik School of Computer Science, Tel Aviv University, Israel) and Eli Gafni (Computer Science Department, University of California, Los Angeles, USA). A session of talks will be organized in that occasion.

Place: Salle Sicile (F302)
Date: Friday 28th June at 15:15

Temporary program:

Yehuda Afek – Hardware Lock Elision with Improved Concurrency
We present a simple yet effective technique for improving performance of lock-based code using the hardware lock elision (HLE) feature in Intel’s upcoming Haswell processor. We also describe how to extend Haswell’s HLE mechanism to achieve a similar effect to our lock elision scheme entirely in hardware.

Eli Gafni – Title and abstract to be announced

George Giakkoupis – Randomized loose renaming in O(loglog n) time

Michel Raynal – s-Simultaneous consensus vs k-set agreement

EDIT: Because of the meteorological conditions, the seminar is postponed to Wednesday March the 27th at 15:00 in room Aurigny (D165).

Tuesday March the 12th, Jean-Loup Guillaume from LIP6 laboratory (Paris) will give a talk in the context of the department D1 Seminar.

Place : Salle Aurigny (D165)
Date : Tuesday 12th March at 11:00

Title: Evolving networks: communities and reachability.

Summary:
The last ten years have witnessed an upsurge in the number of real world datasets modeled by graphs, also called complex networks. Recent studies in the field are focused on the definition of methods and algorithms to describe and study the evolution of such networks. During my talk I will discuss two of my research interests on this issue: community detection in evolving networks and reachability in delay tolerant networks.
The computation and tracking of evolving communities is generally used to follow the evolution of initial communities coupled with the evolution of the underlying network. I will introduce different approaches to tackle this problem and will show that they suffer either from strong instability issues or from high complexity which prevent their usage on large or highly evolving networks.
I will then talk about reachability in evolving complex networks with a special focus on delay tolerant networks. I will present the theoretical framework around temporal reachability graphs which allowed us to propose an algorithm for their efficient computation. I will finally demonstrate the interest of the temporal reachability graph concept by applying it to synthetic and real-life datasets.

« Newer Posts - Older Posts »