yusuke1997/dblp-id-title huggingface dataset:
Parallel and Distributed Algorithms for the Housing Allocation Problem
A Fresh Look at the Design and Implementation of Communication Paradigms (Invited Talk)
Self-Stabilizing Fully Adaptive Maximal Matching
Set-Consensus Collections are Decidable
FaaSLoad: Fine-Grained Performance and Resource Measurement for Function-As-a-Service
Optimizing the HTTP Protocol
Reconfigurable Distributed Storage for Dynamic Networks
A Formal Analysis of the Deferred Update Technique
Deconstructing Stellar Consensus
The Cost of Monotonicity in Distributed Graph Searching
Travail Cooperatif a Distance
Optimal Resilience in Systems That Mix Shared Memory and Message Passing
The Fault Detection Problem
Gathering Teams of Deterministic Finite Automata on a Line
Deadline Monotonic Scheduling on Uniform Multiprocessors
A Quorum-Based Replication Framework for Distributed Software Transactional Memory
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters
Scalable Wake-up of Multi-channel Single-Hop Radio Networks
Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs
Towards a Theory of Self-organization
Local Problems in Trees Across a Wide Range of Distributed Models
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions
Bounded Disagreement
Step Optimal Implementations of Large Single-Writer Registers
Fast Geometric Routing with Concurrent Face Traversal
Tolerating Transient and Intermittent Failure
Computing with Pavlovian Populations
Logical Physical Clocks
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems
Collective Communications on a Reconfigurable Optical Interconnect
On Minimizing Average End-to-End Delay in P2P Live Streaming Systems
Communicating with Beeps
Sparse Hopsets in Congested Clique
Nova: Safe Off-Heap Memory Allocation and Reclamation
Efficient Assignment of Identities in Anonymous Populations
The Role of Software Architecture in Configuring Middleware: The ScalAgent Experience
When Is Spring Coming? A Security Analysis of Avalanche Consensus
Linearizable Replicated State Machines With Lattice Agreement
Uniform Partition in Population Protocol Model Under Weak Fairness
Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial)
Gathering Asynchronous Mobile Robots with Inaccurate Compasses
Efficient Large Almost Wait-Free Single-Writer Multireader Atomic Registers
Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
On Simple Back-Off in Unreliable Radio Networks
A Comparison of the M-PCP, D-PCP, and FMLPon LITMUSRT
ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List
ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object Synchronization
Range Queries in Non-blocking k -ary Search Trees
Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering
Characterizing Asynchronous Message-Passing Models Through Rounds
On the Message Complexity of Global Computations
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
Split and Migrate: Resource-Driven Placement and Discovery of Microservices at the Edge
Theory Meets Practice in the Algorand Blockchain (Invited Talk)
Accountability and Reconfiguration: Self-Healing Lattice Agreement
Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
Population Protocols for Graph Class Identification Problems
Causal Broadcast: How to Forget?
Efficient Lock Free Privatization
Local Recurrent Problems in the SUPPORTED Model
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs
MTcast: Robust and Efficient P2P-Based Video Delivery for Heterogeneous Users
Reactive Smart Buffering Scheme for Seamless Handover in PMIPv6
Renaming with k -Set-Consensus: An Optimal Algorithm into n + k - 1 Slots
Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes
A Dynamic Elimination-Combining Stack Algorithm
Principles of Distributed Systems - 17th International Conference, OPODIS 2013, Nice, France, December 16-18, 2013. Proceedings
Making Distributed Applications Robust
A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem
Highly Space-Efficient Self-Stabilizing Depth-First Token Circulation for Trees
Non-Uniform Replication
Functional Architecture of the NODS Fault Tolerance Framework
Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata
Optimal Register Construction in M&M Systems
Resolving the Network Reliability Problem with a Tree Decomposition of the Graph
Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks
A Communication Lower Bound for Invariance Preserving on Partitioned Transition Systems
Improved Distributed Fractional Coloring Algorithms
New Dolev-Reischuk Lower Bounds Meet Blockchain Eclipse Attacks
Distributed Algorithms for AllPairs Shortest Paths and Minimum Diameter Spanning Tree Problems
Distributed Algorithms for Systems of Autonomous Mobile Robots
Demystifying Bitcoin (Keynote Abstract)
Leader Election in Extremely Unreliable Rings and Complete Networks
The Impossibility of Approximate Agreement on a Larger Class of Graphs
Modeling Resources in Permissionless Longest-Chain Total-Order Broadcast
Byzantine Chain Replication
Causal Broadcast Protocol for Very Large Group Communication Systems
Cycle Prevention in Distributed Checkpointing
Approximate Majority with Catalytic Inputs
Partial Replication: Achieving Scalability in Redundant Arrays of Inexpensive Databases
Linear Time Byzantine Self-Stabilizing Clock Synchronization
Local Certification of Graph Decompositions and Applications to Minor-Free Classes
Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization
Recoverable and Detectable Self-Implementations of Swap
Totally Ordered Multicast with Bounded Delays and Variable Rates
Federated Byzantine Quorum Systems
Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm
SelfStabilizing Token Circulation on Anonymous Message Passing
Probabilistic Compositional Reasoning for Guaranteeing Fault Tolerance Properties
On Time-Optimal, Fault-Tolerant Algorithms for Connected Consensus Beyond Grade Two
Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
Self-Organization Approach of Communities for P2P Networks
Protocol System Integration, Interface and Interoperability
29th International Conference on Principles of Distributed Systems, OPODIS 2025, Iaşi, Romania, December 3-5, 2025
Specification and Implementation of Replicated List: The Jupiter Protocol Revisited
Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores
Reliably Detecting Connectivity Using Local Graph Traits
Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover
Partitioning Real-Time Systems on Multiprocessors with Shared Resources
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
From Consensus Research to Redbelly Network Pty Ltd (Invited Talk)
Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, Reims, France, December 11-13, 2002
Asynchronous and Fully Self-stabilizing Time-Adaptive Majority Consensus
Searching for Black-Hole Faults in a Network Using Multiple Agents
Synthesis of Distributed Algorithms with Parameterized Threshold Guards
On Two-Party Communication through Dynamic Networks
Firewall Queries
Analyzing Convergence in Consistency Models for Distributed Objects
Read-Write Memory and k-Set Consensus as an Affine Task
Formalizing Rollback Netcodes for Robust and Real-Time Client-Server Architectures
CQS-Pair: Cyclic Quorum System Pair for Wakeup Scheduling in Wireless Sensor Networks
Randomized Uniform SelfStabilizing Mutual Exclusion
Failure sensitive analysis for parallel algorithm with controlled memory access concurrency
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
The Incidence of the Controllable Parameters in Routing Algorithms Based on Ant Colony Optimization
Constant Space and Non-Constant Time in Distributed Computing
Tree Exploration by a Swarm of Mobile Agents
Self-Stabilizing Token Distribution with Constant-Space for Trees
From Principles to Practice: Algorithmic Insights from Building the Internet Computer (Invited Talk)
Distributed Branching Random Walks and Their Applications
Oblivious Permutations on the Plane
27th International Conference on Principles of Distributed Systems, OPODIS 2023, Tokyo, Japan, December 6-8, 2023
Arbitrarily Accurate Aggregation Scheme for Byzantine SGD
Solving Atomic Multicast When Groups Crash
A Hierarchy of Unrestricted Deterministic Objects with Consensus Number 1
Lower Bounds for Shoreline Searching With 2 or More Robots
Task Assignment Based on Prioritising Traffic Flows
Snap ML - Accelerated Machine Learning for Big Data (Keynote Abstract)
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
Self-stabilizing Resource Discovery Algorithm
Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks
Distributed Algorithm for Certain Assignment Problems
Verification Techniques for Distributed Algorithms
Near-Optimal Dispersion on Arbitrary Anonymous Graphs
A Protocol for Recording Provenance in Service-Oriented Grids
Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives
Multicast in DKS(N, k, f) Overlay Networks
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
m-Consensus Objects Are Pretty Powerful
Using Read-k Inequalities to Analyze a Distributed MIS Algorithm
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs
Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding
Byzantine Consensus with Unknown Participants
Stabilizing in the Presence of Faults, The Digital Clock Synchronization Case
Computing on a Partially Eponymous Ring
Fast, Fair and Truthful Distributed Stable Matching for Common Preferences
About the Lifespan of Peer to Peer Networks,
Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory
Robust Topology Control Protocols
Gradient Clock Synchronization Using Reference Broadcasts
Anonymous Agreement: The Janus Algorithm
Procedings of the 4th International Conference on Principles of Distributed Systems, OPODIS 2000, Paris, France, December 20-22, 2000
Fast Re-Routing in Networks: On the Complexity of Perfect Resilience
Generic Proofs of Consensus Numbers for Abstract Data Types
On the Power of Anonymous One-Way Communication
Managing Dependencies in Dynamic Collaborations using Coordination Diagrams
Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, Hanoi, Vietnam, October 20-22, 1999
Distributed Spanner Construction in Doubling Metric Spaces
Robust Network Supercomputing without Centralized Control
Impact of Information on the Complexity of Asynchronous Radio Broadcasting
Computing with Content-Oblivious Messages (Invited Talk)
Bounding Communication Cost in Dynamic Load Balancing of Distributed Hash Tables
Time Lower Bounds for Distributed Distance Oracles
Anonymous Obstruction-Free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers
Methodology to Quantify the Security in TCP/IP Systems
Remote Memory References at Block Granularity
Accurate Byzantine Agreement with Feedback
Electing a Leader in Multi-hop Radio Networks
Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems
A Multicast Algorithm for Dynamic Closed Groups
How Robust Are Synchronous Consensus Protocols?
Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers
A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms
Mobile Agent Algorithms Versus Message Passing Algorithms
Asynchronous Gathering in a Torus
Optimistic Algorithms for Partial Database Replication
Concurrent Robin Hood Hashing
Asynchronous Active Recommendation Systems
k-Set Agreement in Communication Networks with Omission Faults
On Finality in Blockchains
Approximating Bipartite Minimum Vertex Cover in the CONGEST Model
Speculative Concurrent Processing with Transactional Memory in the Actor Model
Silent Programmable Matter: Coating
Stable Predicate Detection in Dynamic Systems
Secure Location Verification Using Radio Broadcast
Sentries and Sleepers in Sensor Networks
Separability to Help Parallel Simulation of Distributed Computations
Direct Dependency-Based Determination of Consistent GlobalCheckpoints
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols
Directed Graph Exploration
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
Fault-Tolerant Computing with Unreliable Channels
Optimal Pattern Matching on dDimensional Meshes
On the Impact of Serializing Contention Management on STM Performance
Efficiently Implementing a Large Number of LL/SC Objects
Self-Stabilizing Clock Synchronization in Dynamic Networks
Morpheus Consensus: Excelling on Trails and Autobahns
Contention-Aware Cooperation
piChain: When a Blockchain meets Paxos
Distributed Priority Inheritance for Real-Time and Embedded Systems
𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots
Application of Random Walks to Decentralized Recommender Systems
Byzantine Agreement and SMR with Sub-Quadratic Message Complexity (Invited Talk)
Implementing an EventuallySerializable Data Service as a Distributed System Building Block
A New and Simple Interconnection Network HCN: Hierarchical Complete Network
Towards Consistency Oblivious Programming
Deterministic Subgraph Detection in Broadcast CONGEST
An Architectural Approach to Replication Configuration
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
Black Hole Search by Mobile Agents in Hypercubes and Related Networks
Distance Sensitive Snapshots in Wireless Sensor Networks
Self-optimizing DHTs Using Request Profiling
Generalized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions
Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks
Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3
N-Consensus is the Second Strongest Object for N+1 Processes
On the Complexity of Distributed Edge Coloring and Orientation Problems
AKSEL: Fast Byzantine SGD
Time-Optimal and Energy-Efficient Deterministic Consensus
Design and Analysis of a Logless Dynamic Reconfiguration Protocol
Black Hole Search in Dynamic Rings: The Scattered Case
Optimal Instrumentation of Data-flow in Concurrent Data Structures
Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees
Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System
Generating Random Permutation in the Framework of Coarse Grained Models
Big Data Processing: Security and Scalability Challenges (Invited Talk)
Adversarial Multiple Access Channel with Individual Injection Rates
A General Class of Reductions and Extension-Based Proofs
Fever: Optimal Responsive View Synchronisation
On the Importance of Registers for Computability
A Scheme for Supporting Fault-Tolerant Objects in Distributed Systems using Java ORBs
Analyzing Global-EDF for Multiprocessor Scheduling of Parallel Tasks
Overcoming Obstacles with Ants
On Replication of Software Transactional Memories
Communication Complexity of Consensus in Anonymous Message Passing Systems
Hybrid Distributed Consensus
Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries
Synchronous Executions and View Synchrony
Lower Bounds for Subgraph Detection in the CONGEST Model
On the Mailbox Problem
On the Self-stabilization of Mobile Robots in Graphs
Fast Deterministic Algorithms for Highly-Dynamic Networks
Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization
On Scheduling Algorithms for MapReduce Jobs in Heterogeneous Clouds with Budget Constraints
A Wait-Free Deque With Polylogarithmic Step Complexity
Snap-Stabilizing Depth-First Search on Arbitrary Networks
Relaxed Byzantine Vector Consensus
In Search of the Fastest Concurrent Union-Find Algorithm
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
24th International Conference on Principles of Distributed Systems, OPODIS 2020, Strasbourg, France (Virtual Conference), December 14-16, 2020
Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time
Contribution in Assignment of Spare Capacities in Reconfigurable
Load-Balanced and Sybil-Resilient File Search in P2P Networks
Distributed Recoverable Sketches
Distributed (Δ+1)-Coloring in Graphs of Bounded Neighborhood Independence
20th International Conference on Principles of Distributed Systems, OPODIS 2016, Madrid, Spain, December 13-16, 2016
End to End Communication
Atomic Register Abstractions for Byzantine-Prone Distributed Systems
Large-Scale Distributed Algorithms for Facility Location with Outliers
Distributed Stable Matching with Similar Preference Lists
On Deterministic Linearizable Set Agreement Objects
Failure Detectors Encapsulate Fairness
Biconsistency and Homonymy in Distributed Systems with Edge Symmetry
Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector
Line Search for an Oblivious Moving Target
Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks
Security Analysis of Ripple Consensus
Not All Fair Probabilistic Schedulers Are Equivalent
Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract)
Deterministic Population Protocols for Exact Majority and Plurality
Lock-Free Dynamically Resizable Arrays
Recognizing Hereditary Properties in the Presence of Byzantine Nodes
Describing Mobile Computations with Path Vectors
Fused State Machines for Fault Tolerance in Distributed Systems
22nd International Conference on Principles of Distributed Systems, OPODIS 2018, Hong Kong, December 17-19, 2018
A Distributed Algorithm for the Validation of Timed State Machines
Self-tuning Reactive Distributed Trees for Counting and Balancing
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks
Internet Computing of Tasks with Dependencies Using Unreliable Workers
The Singular Optimality of Distributed Computation in LOCAL
On Broadcast in Generalized Network and Adversarial Models
Optimal Deterministic Remote Clock Estimation in Real-Time Systems
A Tight Bound on Multiple Spending in Decentralized Cryptocurrencies
On Memory, Communication, and Synchronous Schedulers When Moving and Computing
Self-Stabilizing Group Mutual Exclusion for Asynchronous Rings
RADON: Repairable Atomic Data Object in Networks
Collision-Free Pattern Formation
A simple and fast Wait-Free Snapshot Algorithm for Real-Time Systems
Can Memory Be Used Adaptively by Uniform Algorithms?
LFthreads: A Lock-Free Thread Library
Synchronization Helps Robots to Detect Black Holes in Directed Graphs
Asynchronous Approximate Agreement with Quadratic Communication
The Benefits of Entropy in Population Protocols
The Teleportation Design Pattern for Hardware Transactional Memory
Asynchronous Message Orderings Beyond Causality
Vulnerability-Tolerant Transport Layer Security
The Power of Simplicity on Dependable Distributed Systems (Invited Talk)
Robust and Fast Blockchain State Synchronization
A Distributed Protocol for Constructing Multicast Trees
A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph
Computing Power of Hybrid Models in Synchronous Networks
Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem
Distributed Computing on Neighbourhood Constrained Systems
Recoverable Lock-Free Locks
Issues in Distributed Rerouting On High Speed Networks
Distributed Sparse Cut Approximation
Consensus in Equilibrium: Can One Against All Decide Fairly?
Computationally Light "Multi-Speed" Atomic Memory
Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage
Byzantine-Tolerant Phase Clock
A Protocol for WorkGroup in Industrial Environments Based on MMS
Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings
BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation
The Synchronization Power of Atomic Bitwise Operations
Making "Fast" Atomic Operations Computationally Tractable
Predicate Detection for Parallel Computations with Locking Constraints
BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration
Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers
Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary
Timed Quorum Systems for Large-Scale and Dynamic Environments
Tight Conditions for Binary-Output Tasks Under Crashes
Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol
Distributed Runtime Verification Under Partial Synchrony
Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks
Byzantine Fault-Tolerance with Commutative Commands
A New Fault Identification Algorithm
Biased Selection for Building Small-World Networks
On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
Lock Oscillation: Boosting the Performance of Concurrent Data Structures
An Optimal Routing Technique: the Proportional Routing
Computing All the Best Swap Edges Distributively
A Holistic Approach for Trustworthy Distributed Systems with WebAssembly and TEEs
On the Impact of Identifiers on Local Decision
Embedded Performance Analysis Tool for a Distributed Hard Real Time Micro-Kernel: Hierarchical LINDA
Gathering Few Fat Mobile Robots in the Plane
Optimal Multilevel Slashing for Blockchains
Flexible Paxos: Quorum Intersection Revisited
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement
Fast Local-Spin Abortable Mutual Exclusion with Bounded Space
Effect of Fairness in Model Checking of Self-stabilizing Programs
Degree 3 Suffices: A Large-Scale Overlay for P2P Networks
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
Circuits Without Clocks: What Makes Them Tick?
Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
Blockchain - From the Anarchy of Cryptocurrencies to the Enterprise (Keynote Abstract)
A Binary Integer Programming Model for Optimal Object Distribution
23rd International Conference on Principles of Distributed Systems, OPODIS 2019, Neuchâtel, Switzerland, December 17-19, 2019
Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Cortina d'Ampezzo, Italy, December 16-19, 2014. Proceedings
Splitters: Objects for Online Partitioning
Fault Identification in Probabilistically Diagnosable Heterogeneous Systems: A Genetic Approach
Be General and Don't Give Up Consistency in Geo-Replicated Transactional Systems
BFT Consensus: From Academic Paper to Mainnet (Invited Talk)
A Simple Testing Technique for Embedded Systems
Near-Shortest Path Routing in Hybrid Communication Networks
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
Services, Methodologies and Platforms for Cooperative Environments
Converging toward Decision Conditions
An Implementation of Causal Memories using the Writing Semantic
Optimal Randomized Fair Exchange with Secret Shared Coins
The Synchronization Power of Auditable Registers
Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency