All Stories

  1. Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation
  2. Ripple: A Long-Sighted Self-Adaptation Approach to Retrain Machine Learning-Enabled Systems
  3. Don’t go MAD with Anomalies! Design-time Microservice Anomaly Detection in Migration to Microservices
  4. Self-adapting Machine Learning-based Systems via a Probabilistic Model Checking Framework
  5. PoTR: Accurate and Efficient Proof of Timely-Retrievability for Storage Systems
  6. A System for Authenticating Users While Ensuring Anonymity During and After Their Interactions
  7. Performance Trade-offs in Transactional Systems
  8. Deduplication vs Privacy Tradeoffs in Cloud Storage
  9. Practical Limitations of Ethereum’s Layer-2
  10. Omega: A Secure Event Ordering Service for the Edge
  11. FaaSTCC
  12. Poking a Hole in the Wall: Efficient Censorship-Resistant Internet Communications by Parasitizing on WebRTC
  13. Fireplug: Efficient and Robust Geo-Replication of Graph Databases
  14. EdgeScaler
  15. Forensic analysis of communication records of messaging applications from physical memory
  16. Localized Reliable Causal Multicast
  17. Adaptive information dissemination in the Bitcoin network
  18. Planning workflow executions when using spot instances in the cloud
  19. Measurements As First-class Artifacts
  20. Hourglass
  21. Policy-Based Adaptation of a Byzantine Fault Tolerant Distributed Graph Database
  22. FastRank: Practical lightweight tolerance to rational behavior in edge assisted streaming
  23. Learning non-deterministic impact models for adaptation
  24. Online Tuning of Parallelism Degree in Parallel Nesting Transactional Memory
  25. Towards affordable externally consistent guarantees for geo-replicated systems
  26. Dynamic adaptation of byzantine consensus protocols
  27. Fireplug: Flexible and robust N-version geo-replication of graph databases
  28. Augure: Proactive reconfiguration of cloud applications using heterogeneous resources
  29. CoopREP: Cooperative record and replay of concurrency bugs
  30. Saturn
  31. Automated generation of policies to support elastic scaling in cloud environments
  32. FastRank
  33. Accountability in Dynamic Networks
  34. DeltaShaper: Enabling Unobservable Censorship-resistant TCP Tunneling over Videoconferencing Streams
  35. GMU: Genuine Multiversion Update-Serializable Partial Data Replication
  36. MACHETE: Multi-path communication for security
  37. BioALeg - Enabling Biometric Authentication in Legacy Web Sites
  38. Message from the WMCSP 2016 Workshop Co-Chairs
  39. The Future(s) of Transactional Memory
  40. A Distributed Auctioneer for Resource Allocation in Decentralized Systems
  41. Efficient Free-Rider Detection Using Symmetric Overlays
  42. Concurrency Debugging with Differential Schedule Projections
  43. Dynamic adaptation of geo-replicated CRDTs
  44. Production-guided concurrency debugging
  45. Towards Incentive-Compatible Pricing for Bandwidth Reservation in Community Network Clouds
  46. Towards a Scalable, Distributed Metadata Service for Causal Consistency under Partial Geo-replication
  47. Q-OPT
  48. SmartFetch: Efficient Support for Selective Queries
  49. Chasing the Optimum in Replicated In-Memory Transactional Platforms via Protocol Adaptation
  50. Current trends and future directions in community edge clouds
  51. Efficient Free-Rider Detection Using Symmetric Overlays
  52. Concurrency debugging with differential schedule projections
  53. Reducing the vulnerability window in distributed transactional protocols
  54. On Data Placement in Distributed Systems
  55. On the Range of Equilibria Utilities of a Repeated Epidemic Dissemination Game with a Mediator
  56. A uto P lacer
  57. Overnesia: A Resilient Overlay Network for Virtual Super-Peers
  58. Balls-into-leaves
  59. On the energy and performance of commodity hardware transactional memory
  60. On the energy and performance of commodity hardware transactional memory
  61. Autonomic configuration of HyperDex via analytical modelling
  62. On speculative replication of transactional systems
  63. Virtues and limitations of commodity hardware transactional memory
  64. Policies for Efficient Data Replication in P2P Systems
  65. Towards effective and efficient search-based deterministic replay
  66. Rollerchain: A DHT for Efficient Replication
  67. Byzantine renaming in synchronous systems with t < N
  68. Order-Preserving Renaming in Synchronous Systems with Byzantine Faults
  69. Chasing the optimum in replicated in-memory transactional platforms via protocol adaptation
  70. ChainReaction
  71. Bounded gossip
  72. Self-Management of Adaptable Component-Based Applications
  73. On the Effectiveness of Punishments in a Repeated Epidemic Dissemination Game
  74. Self-management of Distributed Systems Using High-Level Goal Policies
  75. X-BOT: A Protocol for Resilient Optimization of Unstructured Overlay Networks
  76. SPECULA: Speculative Replication of Software Transactional Memory
  77. Brief announcement
  78. Lightweight cooperative logging for fault replication in concurrent programs
  79. When Scalability Meets Consistency: Genuine Multiversion Update-Serializable Partial Data Replication
  80. Summary of the 5th workshop on large-scale distributed systems and middleware (LADIS 2011)
  81. Asynchrony and Collusion in the N-party BAR Transfer Problem
  82. Rollerchain
  83. Exploiting Total Order Multicast in Weakly Consistent Transactional Caches
  84. Goal-oriented Self-management of In-memory Distributed Data Grid Platforms
  85. Topology Stability-Aware Multicast Protocol for MANETs
  86. N-party BAR Transfer
  87. A Generic Framework for Replicated Software Transactional Memories
  88. HPCS 2011 tutorials: Tutorial I: Distributed software transactional memories: Foundations, algorithms and tools
  89. Low-Coupling Cluster-Based Multipath Routing for Wireless Mesh Networks
  90. SCert
  91. N-party BAR Transfer
  92. PolyCert: Polymorphic Self-optimizing Replication for In-Memory Transactional Grids
  93. Introduction to Reliable and Secure Distributed Programming
  94. Feature-based probability blending
  95. Introduction
  96. Reliable Broadcast
  97. Thicket: A Protocol for Building and Maintaining Multiple Trees in a P2P Overlay
  98. A Machine Learning Approach to Performance Prediction of Total Order Broadcast Protocols
  99. An Optimal Speculative Transactional Replication Protocol
  100. Flexible and efficient resource location in large-scale systems
  101. Accessing probabilistic quorums in dynamic networks
  102. Communication and coordination support in ad hoc networks for emergency management scenarios
  103. Brief announcement
  104. Observable non-Sybil quorums construction in one-hop wireless ad hoc networks
  105. Cloud-TM
  106. RASM: A Reliable Algorithm for Scalable Multicast
  107. Practical Database Replication
  108. @Flood: Auto-Tunable Flooding for Wireless Ad Hoc Networks
  109. A-OSGi: A Framework to Support the Construction of Autonomic OSGi-Based Applications
  110. Asynchronous Lease-Based Replication of Software Transactional Memory
  111. Reputation in anonymous vehicular networks
  112. D2STM: Dependable Distributed Software Transactional Memory
  113. On Adding Structure to Unstructured Overlay Networks
  114. Gossip-Based Broadcast
  115. X-BOT: A Protocol for Resilient Optimization of Unstructured Overlays
  116. An Efficient Weak Mutual Exclusion Algorithm
  117. Verme: Worm containment in overlay networks
  118. An algorithm for dissemination and retrieval of information in wirelessad hocnetworks
  119. The Weak Mutual Exclusion problem
  120. FT-OSGi: Fault Tolerant Extensions to the OSGi Service Platform
  121. From Local Impact Functions to Global Adaptation of Service Compositions
  122. Towards the Integration of Distributed Transactional Memories in Application Servers’ Clusters
  123. Middleware for Network Eccentric and Mobile Applications
  124. Gossip-Based Dissemination
  125. Geographical distribution of subscriptions for content-based publish/subscribe in MANETs
  126. Large-Scale Peer-to-Peer Autonomic Monitoring
  127. Towards distributed software transactional memory systems
  128. Supporting Linearizable Semantics in Replicated Databases
  129. Versioned transactional shared memory for the FénixEDU web application
  130. Modelling adaptive services for distributed systems
  131. On Replication of Software Transactional Memories
  132. Single-step creation of localized Delaunay triangulations
  133. Epidemic Broadcast Trees
  134. Gossiping on MANETs
  135. Epidemic Broadcast Trees
  136. Implementation and analysis of real-time communication protocol compositions
  137. GORDA: An Open Architecture for Database Replication
  138. Emergent Structure in Unstructured Epidemic Multicast
  139. HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast
  140. DSN 2007 Tutorials
  141. A Framework to Support Multiple Reconfiguration Strategies
  142. A Power-Aware Broadcasting Algorithm
  143. A Framework to Provide Anonymity in Reputation Systems
  144. A Framework to Provide Anonymity in Reputation Systems
  145. SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks
  146. SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks
  147. Context adaptation of the communication stack
  148. On Statistically Estimated Optimistic Delivery in Wide-Area Total Order Protocols
  149. Program Co-chair's Message
  150. Reducing Latency in Rendezvous-Based Publish-Subscribe Systems for Wireless Ad Hoc Networks
  151. Introduction to Reliable Distributed Programming
  152. The atomic manifesto
  153. The atomic manifesto
  154. Scalable QoS-Based Event Routing in Publish-Subscribe Systems
  155. Low latency probabilistic broadcast in wide area networks
  156. Atomic broadcast in asynchronous crash-recovery distributed systems and its use in quorum-based replication
  157. Semantically reliable multicast: definition, implementation, and performance evaluation
  158. Configuring the Communication Middleware to Support Multi-user Object-Oriented Environments
  159. The GlobData Fault-Tolerant Replicated Distributed Object Database
  160. Semantically Reliable Broadcast
  161. A neural network for shortest path computation
  162. Distributed Systems for System Architects
  163. Secure Systems and Platforms
  164. Supporting Views in Network Management Systems
  165. A Dynamic Light-Weight Group Service
  166. Balancing configurability and efficiency in network support tools
  167. Quorum-Based Replication in Asynchronous Crash-Recovery Distributed Systems
  168. Topology-Aware Algorithms for Large-Scale Communication
  169. Multi-user Object-Oriented Environments
  170. A Fault-Tolerant Secure CORBA Store using Fragmentation-Redundancy-Scattering
  171. CesiumSpray: a Precise and Accurate Global Time Service for Large-scale Systems
  172. Group orientation
  173. Requirements for high performance group support in distributed systems
  174. Reliable Multicasting in High-speed LANs
  175. Adaptive gossip-based broadcast
  176. NEEM: network-friendly epidemic multicast
  177. Reducing the cost of group communication with semantic view synchrony
  178. Probabilistic semantically reliable multicast
  179. Policy-Driven Adaptation of Protocol Stacks
  180. A genetic algorithm for multicast mapping in publish-subscribe systems
  181. Friends and foes:preventing sel .shness in open mobile ad hoc networks
  182. The road to a more configurable and adaptive communication and coordination support
  183. An indulgent uniform total order algorithm with optimistic delivery
  184. On QoS-aware publish-subscribe
  185. Schedulability analysis of an event-based real-time protocol framework
  186. Response time analysis of composable micro-protocols
  187. Separating replication from distributed communication: problems and solutions
  188. Deadline-constrained causal order
  189. Flexible communication support for CSCW applications
  190. Fault-tolerant broadcasts in CAN
  191. Scalable atomic multicast
  192. A posteriori agreement for fault-tolerant clock synchronization on broadcast networks