30 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Institut de Recherche en Informatique et Systèmes AléatoiresFR46 papers
- Université de RennesFR5 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- Amplitude Systèmes (France)FR3 papers
- Université de Bretagne SudFR3 papers
- Edo State University UzairueNG2 papers
- Lebanese UniversityLB2 papers
- Airbus (France)FR1 paper
- Centre d'études et de recherche en informatique et communicationsFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Cheikh Anta Diop UniversitySN1 paper
- Computer Algorithms for MedicineAT1 paper
12 papers · 1 filter
A Model for Probabilistic Reasoning on Assume/Guarantee Contracts
Benoît Delahaye, Benoît Caillaud
In this paper, we present a probabilistic adaptation of an Assume/Guarantee contract formalism. For the sake of generality, we assume that the extended state machines used in the c…
Distributed Management of Massive Data: an Efficient Fine-Grain Data Access Scheme
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
This paper addresses the problem of efficiently storing and accessing massive data blocks in a large-scale distributed environment, while providing efficient fine-grain access to d…
Enabling Lock-Free Concurrent Fine-Grain Access to Massive Distributed Data: Application to Supernovae Detection
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
We consider the problem of efficiently managing massive data in a large-scale distributed environment. We consider data strings of size in the order of Terabytes, shared and access…
WCET analysis of multi-level set-associative instruction caches
Damien Hardy, Isabelle Puaut
With the advent of increasingly complex hardware in real-time embedded systems (processors with performance enhancing features such as pipelines, cache hierarchy, multiple cores),…
Goal-oriented Dialog as a Collaborative Subordinated Activity involving Collective Acceptance
Sylvie Saget, Marc Guyomard
Modeling dialog as a collaborative activity consists notably in specifying the content of the Conversational Common Ground and the kind of social mental state involved. In previous…
Monotony in Service Orchestrations
Anne Bouillard, Sidney Rosario, Albert Benveniste +1
Web Service orchestrations are compositions of different Web Services to form a new service. The services called during the orchestration guarantee a given performance to the orche…
A classification of invasive patterns in AOP
Freddy Munoz, Benoit Baudry, Olivier Barais
Aspect-Oriented Programming (AOP) improves modularity by encapsulating crosscutting concerns into aspects. Some mechanisms to compose aspects allow invasiveness as a mean to integr…
Fine-grained parallelization of similarity search between protein sequences
Van Hoa Nguyen, Dominique Lavenier
This report presents the implementation of a protein sequence comparison algorithm specifically designed for speeding up time consuming part on parallel hardware such as SSE instru…
Ascending runs in dependent uniformly distributed random variables: Application to wireless networks
Nathalie Mitton, Katy Paroux, Bruno Sericola +1
We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their depende…
Timed Quorum System for Large-Scale and Dynamic Environments
Vincent Gramoli, Michel Raynal
This paper presents Timed Quorum System (TQS), a new quorum system especially suited for large-scale and dynamic systems. TQS requires that two quorums intersect with high probabil…
Energy Aware Self-Organizing Density Management in Wireless Sensor Networks
Erwan Le Merrer, Vincent Gramoli, Anne-Marie Kermarrec +2
Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy…
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime
Vincent Gramoli, Anne-Marie Kermarrec, Achour Mostefaoui +2
Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can…