All Stories

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