Guerraoui, Rachid - Facult� Informatique et Communications, Ecole Polytechnique F�d�rale de Lausanne

Advanced Search

Guerraoui, Rachid - Facult� Informatique et Communications, Ecole Polytechnique F�d�rale de Lausanne

Linguistic Support for LargeScale Distributed Programming Patrick Th. Eugster Rachid Guerraoui Christian H. Damm
How Fast Can a Very Robust Read Be? [Extended Abstract]
(Almost) All Objects are Universal in Message Passing Systems
Biomechanics in bone tissue engineering Dominique P. Pioletti*
www.ecmjournal.org N Krattinger et al. Characterization and regulation of human fetal bone cellsEuropean Cells and Materials Vol. 21 2011 (pages 46-58) ISSN 1473-2262
Augmentation of bone defect healing using a new biocomposite scaffold: An in vivo study in sheep
An Ecient Universal Construction for Message-Passing Systems (Preliminary Version)
Composition vs Concurrency Vincent Gramoli Rachid Guerraoui Mihai Let, ia
Synchronizing without Locks is Inherently Expensive Hagit Attiya
Refined Quorum Systems Rachid Guerraoui
How Fast can a Distributed Atomic Read be? (Extended Abstract)
Laboratory of Biomechanical Orthopedics Inter-Institutional Center of Translational Biomechanics
Calcium phosphate cement augmentation of cancellous bone screws can compensate for the absence of cortical fixation
The Weakest Failure Detectors to Boost Obstruction-Freedom
Curing kinetics and mechanical properties of a composite hydrogel for the replacement of the nucleus pulposus
Tightening force and torque of nonlocking screws in a reverse shoulder prosthesis A. Terrier a,
Mechanical interaction between cells and fluid for bone tissue engineering scaffold: Modulation of the interfacial shear stress
Short communication A new technique to measure micromotion distribution around
Combined effects of zoledronate and mechanical stimulation on bone adaptation in an axially loaded mouse tibia
Please cite this article in press as: Terrier A, et al. A musculoskeletal shoulder model based on pseudo-inverse and null-space optimization. Med Eng Phys (2010), doi:10.1016/j.medengphy.2010.07.006
Robotics and Autonomous Systems 58 (2010) 12461255 Contents lists available at ScienceDirect
Securing Every Bit: Authenticated Broadcast in Radio Networks
Dynamic Proxies for Classes: Towards Type-Safe and Decoupled Remote Object Interaction
276 6. Consensus Variants Exercise 6.4 Give a specification of a state machine replication abstraction
Distributed Subtyping Sebastien Baehni
RGLEMENT D'ADMISSION PASSERELLE HES -EPFL
A High Throughput Atomic Storage Algorithm Rachid Guerraoui
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
Preventing versus Curing: Avoiding Conflicts in Transactional Memories
Distrib. Comput. (2009) 21:353366 DOI 10.1007/s00446-009-0079-3
Section d'Informatique Mineur "Biocomputing" responsables : prof. B. Moret et Ph. Bucher
Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
INFORMATIQUE -spcialisations Les enseignants, les crdits et la priode des cours sont indiqus sous rserve de modification.
BGP-based Clustering for Scalable and Reliable Gossip Broadcast
The Inherent Price of Indulgence Partha Dutta and Rachid Guerraoui
Reducing Fair Exchange to Atomic Commit Gildas Avoine1
Frugal Mobile Objects Beno^it Garbinato2
Frugal Event Dissemination in a Mobile Environment Sebastien Baehni, Chirdeep Singh Chhabra, and Rachid Guerraoui
High Throughput Total Order Broadcast for Cluster Environments Rachid Guerraoui
THE TIME-COMPLEXITY OF LOCAL DECISION IN DISTRIBUTED PARTHA DUTTA, RACHID GUERRAOUI, AND BASTIAN POCHON
Extensible Encoding of Type Hierarchies Hamed Seiied Alavi
Dividing Transactional Memories by Zero Aleksandar Dragojevic Rachid Guerraoui Michal Kapalka
Secure Communication Over Radio Channels Shlomi Dolev
Stretching Gossip with Live Streaming Davide Frey
Decentralized Polling with Respectable Participants
Complexity of Distributed (Continued...)
Distributed systems Total Order Broadcast
Distributed systems Prof R. Guerraoui
R. Guerraoui 1 Distributed algorithms
Live Streaming with Gossip Maxime Monod
DPOR-DS: Dynamic Partial Order Reduction in Distributed Systems Maysam Yabandeh and Dejan Kostic
Refined Quorum Systems Rachid Guerraoui1 and Marko Vukolic1,2
Abstractions for Distributed Interaction: Guests or Relatives?
Distributed Reliable Object-Oriented Programming (DROOP)
Effective Multicast Programming in Large Scale Distributed Systems
Independent Faults in the Cloud Rachid Guerraoui and Maysam Yabandeh
The Peer Sampling Service: Experimental Evaluation of Unstructured
FAST ACCESS TO DISTRIBUTED ATOMIC MEMORY PARTHA DUTTA, RACHID GUERRAOUI, RON R. LEVY, AND MARKO VUKOLIC
Fair Exchange Henning Pagnia1
Implementing e-Transactions with Asynchronous Replication Svend Frlund1
Rglement adopt par le Conseil de Facult du 25.06.2002/MH -1 -Rglement de section de la Facult I&C
Thesis for the Degree of Doctor of Philosophy Distributed Algorithms and Educational
On Obstruction-Free Transactions Rachid Guerraoui
From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement
Tradeoffs in Event Systems P. Th. Eugster1
Model Checking Transactional Memories Rachid Guerraoui Thomas A. Henzinger Barbara Jobstmann Vasu Singh
Gracefully Degrading Fair Exchange with Security Modules (Extended Abstract)
The Failure Detector Abstraction Felix C. Freiling, University of Mannheim
Unconscious Eventual Consistency with Gossips Roberto Baldoni1
From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement
Distributed Computing manuscript No. (will be inserted by the editor)
Finally the Weakest Failure Detector for Non-Blocking Atomic Commit
Even Small Birds are Unique: Population Protocols with Identifiers
Deconstructing Paxos Romain Boichat+
Of Malicious Motes and Suspicious Sensors On the efficiency of malicious interference in
How Live Can a Transactional Memory Be? Rachid Guerraoui Michal Kapalka
When Birds Die: Making Population Protocols Fault-Tolerant
Independent Faults in the Cloud Rachid Guerraoui and Maysam Yabandeh
Distributed systems Causal Broadcast
Distributed algorithms Example: consensus
Exercise 9 Solutions We want to show that I(P, P0) = 2.
How do you build a reliable service? Seth Gilbert
Model Checking Tools for Software System Implementations
COMBINE: An Improved Directory-Based Consistency Protocol Hagit Attiya
Acknowledgment I would like to thank Dr. Nasser Yazdani, my advisor in this thesis. Also, I would like
One Acceptor is Enough EPFL Technical Report LPD-REPORT-2010-001
On Tracking Freeriders in Gossip Protocols Rachid Guerraoui
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Transactional Memory: Glimmer of a Theory (Invited Paper)
How Fast Can a Very Robust Read Be? Rachid Guerraoui1,2 and Marko Vukolic1
Permissiveness in Transactional Memories Rachid Guerraoui, Thomas A. Henzinger, and Vasu Singh
The Weakest Failure Detector for Message Passing Set-Agreement
Distributed Systems Group Membership and View
Stretching Transactional Memory Aleksandar Dragojevic Rachid Guerraoui Michal Kapalka
Sharing is Harder than Agreeing Carole Delporte-Gallet
On Obstruction-Free Transactions Rachid Guerraoui Michal Kapalka
Gossiping Capabilities Davide Frey
The Next 700 BFT Protocols Rachid Guerraoui,
Reliable Distributed Storage Gregory Chockler, Rachid Guerraoui, Idit Keidar, Marko Vukolic
On the Correctness of Transactional Memory Rachid Guerraoui Michal Kapalka
Live Streaming with Gossip 4777 (2010)
A Generic Theoretical Framework for Modeling Gossip-Based Algorithms
The Semantics of Progress in Lock-Based Transactional Memory Rachid Guerraoui Michal Kapalka
Toward Integration 84 Published by the IEEE Computer Society 1089-7801/07/$25.00 2007 IEEE IEEE INTERNET COMPUTING
StreamFlex: High-throughput Stream Programming in Java Jesper H. Spring
The Weight-Watcher Service and its Lightweight Implementation
STMBench7: A Benchmark for Software Transactional Memory
Pervasive Computing with Frugal Objects Beno^it Garbinato
The Collective Memory of Amnesic Processes Rachid Guerraoui, Ron R Levy
The Perfectly-Synchronized Round-based Model of Distributed Computing
STMBench7: A Benchmark for Software Transactional Memory
The Alpha of Indulgent Consensus Rachid Guerraoui1
Community-Aware Event Dissemination Sebastien Baehni a
Boosting Obstruction-Freedom with Low Overhead Rachid Guerraoui1,2 Michal Kapalka2 Petr Kouznetsov3
Lucky Read/Write Access to Robust Atomic Storage Rachid Guerraoui1,2
The Weakest Failure Detectors to Boost Obstruction-Freedom
What Can Be Implemented Anonymously? Rachid Guerraoui1
FRUGAL MOBILE OBJECTS Beno^it Garbinato
Tolerating Arbitrary Failures With State Machine Replication
How Fast can a Distributed Atomic Read be? 1 PARTHA DUTTA, RACHID GUERRAOUI, RON R. LEVY and MARKO VUKOLIC
Computing with Reads and Writes in the Absence of Step Contention
Looking Ahead in Open Multithreaded Transactions
The weakest failure detectors to solve Quittable Consensus and Non-Blocking Atomic Commit
The Information Structure of Indulgent Consensus
Fast Non-Blocking Atomic Commit: An Inherent Trade-off
The Complexity of Asynchronous Byzantine Consensus Partha Dutta, Rachid Guerraoui and Marko Vukolic
Time-Efficient Self-Stabilizing Algorithms through Hierarchical Structures
Mobility Friendly Publish/Subscribe Sebastien Baehni Chirdeep Singh Chhabra Rachid Guerraoui
The CHT Play An Informal Note on the Necessary Part of the Proof that is the
Fast Non-Blocking Atomic Commit: An Inherent Trade-off
An Equational Theory for Transactions Andrew P. Black1
Data-Aware Multicast S. Baehni P. Th. Eugster R. Guerraoui
Network Membership: A Partition Model for Reliable Mobile Communication Romain Boichat
Lightweight Probabilistic Broadcast P. Th. Eugster1
A Realistic Look At Failure Detectors C. Delporte-Gallet , H. Fauconnier , R. Guerraoui
Automating the Addition of Fail-Safe Fault-Tolerance: Beyond Fusion-Closed
On Systematic Design of Fast and Perfect Detectors Arshad Jhumka
Mutual Exclusion in Asynchronous Systems with Failure Detectors
AOP: Does it Make Sense? The Case of Concurrency and Failures
Reliable and Total Order Broadcast in the Crash-Recovery Model Romain Boichat Rachid Guerraoui
Asynchronous Leasing Partha Dutta Romain Boichat Rachid Guerraoui
Democratizing the Parliament (Extended Abstract)
-Reliability Patrick Th. Eugster Rachid Guerraoui Petr Kouznetsov
X-Ability: A Theory of Replication Svend Frlund1
Indulgent Algorithms (Extended Abstract)
Distributed Asynchronous Collections: Abstractions for Publish/Subscribe Interaction
GETCO 2004 Preliminary Version The Complexity of Early Deciding Set
6.8 Solutions 281 broadcast primitive. 2
Hierarchical Probabilistic Multicast Patrick Th. Eugster Rachid Guerraoui
Byzantine Failures Seth Gilbert
182 4. Shared Memory Exercise 4.8 Assume that some algorithm A implements a regular register
Computer Science Department Dynamic Prediction based
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
What object oriented distributed programming does not have to be, and what it may be
On the Hardness of Failure-Sensitive Agreement Problems
Type-Based Publish/Subscribe Patrick Eugster
Modular Abstractions for Devising Byzantine-Resilient State Machine Replication
Open Consensus Romain Boichat+
Revisiting Liveness Properties in the Context of Secure Systems
OS Support for P2P Programming: a Case for TPS Sbastien Baehni, Patrick Th. Eugster, Rachid Guerraoui
Probabilistic Multicast Patrick Th. Eugster
Shared Memory vs Message Passing Carole Delporte-Gallet Hugues Fauconnier
Pragmatic Type Interoperability Sebastien Baehni
Mobile Databases: a Report on Open Issues and Research Directions * Action members
Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks
THE DRIVING PHILOSOPHERS Distributed Programming Laboratory
Failure Detection Lower Bounds on Registers and Consensus
Studies Plan Informatique 2011-12
Throughput Optimal Total Order Broadcast for Cluster Environments1
Generating Fast Indulgent Algorithms Dan Alistarh1
Technical Report no. 2005-10 Dynamic and fault-tolerant cluster management
Adaptive Gossip-Based Broadcast L. Rodrigues
Generalizing State Machine Replication (Preliminary Version)
JACM5704-21 Journal of the ACM April 6, 2010 2:44 Tight Failure Detection Bounds on Atomic
Distributed Systems Non-Blocking Atomic Commit
R. Guerraoui 1 Regular register algorithms
A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms
Optimizing Transactions for Captured Memory Aleksandar Dragojevic
On the Weakest Failure Detector Ever R. Guerraoui1,2
Distributed Computing manuscript No. (will be inserted by the editor)
A General Characterization of Indulgence R. Guerraoui1,2
THE THEORY OF TRANSACTIONAL MEMORY Rachid Guerraoui
The Gap in Circumventing the Consensus Impossibility
Optimistic Erasure-Coded Distributed Storage Partha Dutta
Chosen-prefix Collisions for MD5 and Applications
Section d'Informatique Section de Systmes de Communication
Transactional Exactly-Once Svend Fr lund and Rachid Guerraoui
The Disagreement Power of an Adversary Carole Delporte-Gallet1
Toward a Theory of Transactional Contention Managers
Towards Fair Event Dissemination Position Paper
Stretching Transactional Memory Aleksandar Dragojevic Rachid Guerraoui Michal Kapalka
The Impossibility of Boosting Distributed Service Resilience Paul Attie1,3
How Fast Can Eventual Synchrony Lead to Consensus?
Robust Emulations of Shared Memory in a Crash-Recovery Model
Heterogeneous Gossip Davide Frey2
EIDGENSSISCHE TECHNISCHE HOCHSCHULE LAUSANNE POLITECNICO FEDERALE DI LOSANNA
Throughput Optimal Total Order Broadcast for Cluster Environments
The Complexity of Renaming Dan Alistarh
On The Power of Hardware Transactional Memory to Simplify Memory Management
Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot be Eliminated
The Semantics of Progress in Lock-Based Transactional Memory Rachid Guerraoui Michal Kapalka
The LEAF Platform: Incremental Enhancements for the J2EE Philipp H. Oser1
Lucky Read/Write Access to Robust Atomic Storage Rachid Guerraoui1,2, Ron R. Levy1 and Marko Vukolic1
Opacity: A Correctness Condition for Transactional Memory Rachid Guerraoui Michal Kapalka
Amnesic Distributed Storage Gregory Chockler1
Solutions to Exercise Set 8 Problem 8.a
Flexible Task Graphs: A Unified Restricted Thread Programming Model for Java
Byzantine Failures and Security: Arbitrary is not (always) Random
Robust Contention Management in Software Transactional Memory
A Topological Treatment of Early-Deciding Set-Agreement
A Scalable and Oblivious Atomicity Assertion Rachid Guerraoui and Marko Vukolic
Supporting Mobility in Content-Based Publish/Subscribe Middleware
Linguistic Support for Large-Scale Distributed Programming Patrick Th. Eugster Rachid Guerraoui Christian H. Damm
Making Consensus Practical Romain Boichat+
Dealing with Uncertainty in Mobile Publish/Subscribe Middleware Ludger Fiege Andreas Zeidler
banner above paper title Transaction Polymorphism in Java
Trustful Cumulus Clouds Technical Report
TECS1001-04 ACM-TRANSACTION July 26, 2010 17:29 Reflexes: Abstractions for Integrating Highly
Fast Randomized Test-and-Set and Renaming Dan Alistarh1
Boosting Gossip for Live Streaming Davide Frey, Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod
Transactions in the Jungle Rachid Guerraoui
Collaborative Scoring with Dishonest Participants Seth Gilbert
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography
Le PlayLaB prsente Cryptologie et PlayStations Le PlayLaB propose d'accueillir des classes afin de visiter le laboratoire de cryptologie et de
Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using
Comptences du domaine des Solides et Structures Appliquer les concepts de la mcanique des solides rigides et
Comptences du domaine de l'Automatique et Mcatronique Reprsenter un processus physique sous forme de systme avec
Comptences du domaine de l'Energie Matriser les notions de bilans de matire, d'nergie et de quantit de
Plan d'tudes Mineur : Dveloppement territorial et urbanisme 2011-12
Comptences du domaine de l'Aro-hydrodynamique Dcrire un coulement en termes scientifiques, AH1
Comptences du domaine de la Conception et Production Choisir les mthodologies et les outils adquats pour le
Comptences du domaine de la Biomcanique Enoncer et expliquer le fonctionnement biomcanique des diffrents
OPTIONSTUDIO/URBANPLANNING/EPFLSH2011 EPFL/URBANLEMANICIDENTITY
IBI Institute of Bioengineering Institut de bioingnierie EPFL School of Life Sciences / School of Engineering
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
IBI Institute of Bioengineering Institut de bioingnierie EPFL School of Life Sciences / School of Engineering
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
School of Life Sciences School of Engineering IBI Institute of Bioengineering / Institut de bioingnierie
IBI Institute of Bioengineering Institut de bioingnierie EPFL School of Life Sciences / School of Engineering