Index: Operating Systems and Distributed Systems

TitleTypeConferenceLink
Automating Dependence-Aware Parallelization of Machine Learning Training on Distributed Shared MemorySummaryEuroSys
GRNN: Low-Latency and Scalable RNN Inference on GPUsSummaryEuroSys
Deferred Runtime Pipelining for contentious multicore software transactionsSummaryEuroSys
Replayable Execution Optimized for Page Sharing for a Managed Runtime EnvironmentSummaryEuroSys
Grapple: A Graph System for Static Finite-State Property Checking of Large-Scale Systems CodeSummaryEuroSys
Multiverse: Compiler-Assisted Management of Dynamic Variability in Low-Level System SoftwareSummaryEuroSys
Efficient, Consistent Distributed Computation with Predictive TreatiesSummaryEuroSys
Resource Deflation: A New Approach For Transient Resource ReclamationSummaryEuroSys
Serving Mobile Apps – A Slice at a TimeSummaryEuroSys
Keeping Master Green at ScaleSummaryEuroSys
Runtime Object Lifetime Profiler for Latency Sensitive Big Data ApplicationsSummaryEuroSys
Efficient and Safe Network Updates with Suffix Causal ConsistencySummaryEuroSys
I Sent It: Where Does Slow Data Go to Wait?SummaryEuroSys
The Case For In-Network Computing On DemandSummaryEuroSys
FlyMC: Highly Scalable Testing of Complex Interleavings in Distributed SystemsSummaryEuroSys
Scalable RDMA RPC on Reliable Connection with Efficient Resource SharingSummaryEuroSys
Managing Tail Latency in Datacenter-Scale File Systems Under Production ConstraintsSummaryEuroSys
Project Almanac: A Time-Traveling Solid-State DriveSummaryEuroSys
Compact NUMA-aware LocksSummaryEuroSys
LockDoc: Trace-Based Analysis of Locking in the Linux KernelSummaryEuroSys
CoPart: Coordinated Partitioning of Last-Level Cache and Memory Bandwidth for Fairness-Aware Workload Consolidation on Commodity ServersSummaryEuroSys
SkyBridge: Fast and Secure Inter-Process Communication for MicrokernelsSummaryEuroSys
Make the Most out of Last Level Cache in Intel ProcessorsSummaryEuroSys
When eXtended Para-Virtualization (XPV) Meets NUMASummaryEuroSys
AnDrone: Virtual Drone Computing in the CloudSummaryEuroSys
Per Application Power DeliverySummaryEuroSys
Time Protection: the Missing OS AbstractionSummaryEuroSys
BB: Booting Booster for Consumer Electronics with Modern OSSummaryEuroSys
vScale: Automatic and Efficient Processor Scaling for SMP Virtual MachinesSummaryEuroSys
On the Capacity of Thermal Covert Channels in MulticoresSummaryEuroSys
A High Performance File System for Non-Volatile Main MemorySummaryEuroSys
The Linux Scheduler: A Decade of Wasted CoresSummaryEuroSys
Shared Address Translation RevisitedSummaryEuroSys
Exploiting Variability for Energy Optimization of Parallel ProgramSummaryEuroSys
zExpander: a Key-value Cache with both High Performance and Fewer MissesSummaryEuroSys
Increasing Large-Scale Data Center Capacity by Statistical Power ControlSummaryEuroSys
HAFT: Hardware-Assisted Fault ToleranceSummaryEuroSys
A Study of Modern Linux API Usage and Compatibility: What to Support When You’re SupportingSummaryEuroSys
Practical Condition Synchronization for Transactional MemorySummaryEuroSys
Hardware Read-Write Lock ElisionSummaryEuroSys
POSIX Abstractions in Modern Operating Systems: The Old, the New, and the MissingSummaryEuroSys
Yoda: A Highly Available Layer-7 Load BalancerSummaryEuroSys
Efficient Queue Management for Cluster SchedulingSummaryEuroSys
Parallel Sections: Scaling System-Level Data-StructuresSummaryEuroSys
TetriSched: global rescheduling with adaptive plan-ahead in dynamic heterogeneous clustersSummaryEuroSys
An Efficient Page-level FTL to Optimize Address Translation in Flash MemorySummaryEuroSys
Application-Assisted Live Migration of Virtual Machines with Java ApplicationsSummaryEuroSys
Deriving and Comparing Deduplication Techniques Using a Model-Based ClassificationSummaryEuroSys
SpotCheck: Designing a Derivative IaaS Cloud on the Spot MarketSummaryEuroSys
Extensible Distributed CoordinationSummaryEuroSys
Guaranteeing Deadlines for Inter-Datacenter TransfersSummaryEuroSys
Guardat: Enforcing data policies at the storage layerSummaryEuroSys
Hare: a file system for non-cache-coherent multicoresSummaryEuroSys
High-Performance Determinism with Total Store Order ConsistencySummaryEuroSys
Large scale cluster management at Google with BorgSummaryEuroSys
MALT: Distributed Data-Parallelism for existing ML applicationsSummaryEuroSys
An In-Memory Object Caching Framework with Adaptive Load BalancingSummaryEuroSys
Process-level Power Estimation in VM-based SystemsSummaryEuroSys
Scaling Concurrent Log-Structured Data StoresSummaryEuroSys
Simba: Tunable End-to-End Data Consistency for Mobile AppsSummaryEuroSys
Synapse: A Microservices Architecture for Heterogeneous-Database Web ApplicationsSummaryEuroSys
Taming uncertainty in distributed systems with help from the networkSummaryEuroSys
Verifiable Differential PrivacySummaryEuroSys
Visigoth Fault ToleranceSummaryEuroSys
Chronos: A Graph Engine for Temporal Graph Analysis,SummaryEuroSys
DynMR: Dynamic MapReduce with ReduceTask Interleaving and MapTask BackfillingSummaryEuroSys
Reconciling High Server Utilization and Sub-millisecond Quality-of-Service,SummaryEuroSys
DIBS: Just-in-time Congestion Mitigation for Data CentersSummaryEuroSys
TAQ: Enhancing Fairness and Performance Predictability in Small Packet RegimesSummaryEuroSys
Practical Techniques to Obviate Setuid-to-Root BinariesSummaryEuroSys
Rex: Replication at the Speed of Multi-coreSummaryEuroSys
Relational access to Unix kernel data structuresSummaryEuroSys
Caching in Video CDNs: Building Strong Lines of DefenseSummaryEuroSys
Aerie: Flexible File-System Interfaces to Storage-Class MemorySummaryEuroSys
System Software for Persistent MemorySummaryEuroSys
TESLA: Temporally Enhanced System Logic AssertionsSummaryEuroSys
T-Rex: A Dynamic Race Detection Tool for C/C++ Transactional Memory Applications,SummaryEuroSys
Archiving Cold Data in Warehouses with Clustered Network CodingSummaryEuroSys
Callisto: Co-Scheduling Parallel Runtime SystemsSummaryEuroSys
Using Restricted Transactional Memory to Build a Scalable In-Memory DatabaseSummaryEuroSys
Algorithmic Improvements for Fast Concurrent Cuckoo HashingSummaryEuroSys
TimeStream: Reliable Stream Computation in the CloudSummaryEuroSys
Optimus: A Dynamic Rewriting Framework for Execution Plans of Data-Parallel ComputationSummaryEuroSys
BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large DataSummaryEuroSys
IFDB: Decentralized Information Flow Control for DatabasesSummaryEuroSys
Resolving the conflict between generality and plausibility in verified computationSummaryEuroSys
Conversion: Multi-Version Concurrency Control for Main Memory SegmentsSummaryEuroSys
Adaptive Parallelization of Web SearchSummaryEuroSys
Whose Cache Line Is It Anyway? Operating System Support for Live Detection and Repair of False SharingSummaryEuroSys
Mizan: A System for Dynamic Load Balancing in Large-scale Graph ProcessingSummaryEuroSys
Presto: Distributed Machine Learning and Graph Processing with Sparse MatricesSummaryEuroSys
RadixVM: Scalable address spaces for multithreaded applicationsSummaryEuroSys
Composing OS extensions safely and efficiently with BasculeSummaryEuroSys
Prefetching Mobile Ads: Can advertising systems afford it?SummaryEuroSys
hClock: Hierarchical QoS for Packet Scheduling in a HypervisorSummaryEuroSys
Omega: flexible, scalable schedulers for large compute clustersSummaryEuroSys
CPI2: CPU performance isolation for shared compute clustersSummaryEuroSys
Language constructs and support systems for distributed computingSummaryPODC
Distributed communication via global bufferSummaryPODC
Language concepts for distributed processing of large arraysSummaryPODC
Four combinators for concurrencySummaryPODC
A distributed algorithm for detecting resource deadlocks in distributed systemsSummaryPODC
On-the-fly deadlock preventionSummaryPODC
Synchronisation and recovery of actionsSummaryPODC
Data-dependent concurrency control and recovery (Extended Abstract)SummaryPODC
An algorithm, for replicated directoriesSummaryPODC
Decentralization of process nets with centralized controlSummaryPODC
Real-time programming and asynchronous message passingSummaryPODC
Invited address solved problems, unsolved problems and non-problems in concurrencySummaryPODC
Verification of multiprocess probabilistic protocolsSummaryPODC
A technique for proving liveness of communicating finite state machines with examplesSummaryPODC
Knowledge and common knowledge in a distributed environmentSummaryPODC
Asynchronous Byzantine consensusSummaryPODC
Elections in the presence of faultsSummaryPODC
An asynchronous [(n – 1)/3]-resilient consensus protocolSummaryPODC
Relations between concurrent-write models of parallel computationSummaryPODC
SODA: A simplified operating system for distributed applicationsSummaryPODC
Replicated procedure callSummaryPODC
Efficient solutions to the replicated log and dictionary problemsSummaryPODC
A distributed algorithm for deadlock detection and resolutionSummaryPODC
A distributed algorithm for generalized deadlock detectionSummaryPODC
Symmetry and similarity in distributed systemsSummaryPODC
Fast distributed agreement (preliminary version)SummaryPODC
Comparing how atomicity mechanisms support replicationSummaryPODC
Distributed version management for read-only actions (extended abstract)SummaryPODC
Improvements in the time complexity of two message-optimal election algorithmsSummaryPODC
Parallel arithmetic with concurrent writesSummaryPODC
Simple, efficient asynchronous parallel algorithms for maximizationSummaryPODC
Designing a global name serviceSummaryPODC
Correctness conditions for highly available replicated databasesSummaryPODC
Highly available distributed services and fault-tolerant distributed garbage collectionSummaryPODC
Transaction commit in a realistic fault modelSummaryPODC
Distributing the power of a government to enhance the privacy of votersSummaryPODC
Optimal message routing without complete routing tablesSummaryPODC
Incremental attribute evaluation in distributed language-based environmentsSummaryPODC
Gap theorems for distributed computingSummaryPODC
Protocols for dynamic vote reassignmentSummaryPODC
Efficient synchronization of multiprocessors with shared memorySummaryPODC
Memory coherence in shared virtual memory systemsSummaryPODC
What processes know: Definitions and proof methodsSummaryPODC
Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchingsSummaryPODC
A hundred impossibility proofs for distributed computingSummaryPODC
The intractability of bounded protocols for non-FIFO channelsSummaryPODC
Source to destination communication in the presence of faultsSummaryPODC
Knowledge, probability, and adversariesSummaryPODC
The ambiguity of choosingSummaryPODC
Sticky bits and universality of consensusSummaryPODC
Efficient solution to the distributed mutual exclusion problemSummaryPODC
Efficient parallel algorithms can be made robustSummaryPODC
Efficient distributed recovery using message loggingSummaryPODC
A structural induction theorem for processesSummaryPODC
Shared-memory vs. message-passing in an asynchronous distributed environmentSummaryPODC
Calling names in nameless networksSummaryPODC
Fast isolation of arbitrary forwarding faultsSummaryPODC
Atomic snapshots of shared memorySummaryPODC
The inhibition spectrum and the achievement of causal consistencySummaryPODC
Lazy replication: exploiting the semantics of distributed servicesSummaryPODC
Distributed variable server for atomic unificationSummaryPODC
Self-stabilizing extensions for message-passing systemsSummaryPODC
Token management schemes and random walks yield self-stabilizing mutual exclusionSummaryPODC
Distributed control for PARISSummaryPODC
Principle for high speed network control: congestion-and deadlock-freeness, self-routing, and a single buffer per linkSummaryPODC
Cost-sensitive analysis of communication protocolsSummaryPODC
Reasoning about probabilistic algorithmsSummaryPODC
Time-and space-efficient randomized consensusSummaryPODC
Sharing memory robustly in message-passing systemsSummaryPODC
Practical uses of synchronized clocks in distributed systemsSummaryPODC
Randomized wait-free concurrent objects (extended abstract)SummaryPODC
Efficient parallel algorithms on restartable fail-stop processorsSummaryPODC
Resiliency of interactive distributed tasks (extended abstracts)SummaryPODC
Optimal space distributed move-to-front listsSummaryPODC
A theory of relaxed atomicity (extended abstract)SummaryPODC
Real-time sequence transmission problemSummaryPODC
The benefits of relaxing punctualitySummaryPODC
Greedy packet scheduling on shortest paths (preliminary version)SummaryPODC
Efficient deadlock-free routingSummaryPODC
Knowledge in shared memory systems (preliminary version)SummaryPODC
Exploiting locality in maintaining potential causalitySummaryPODC
Inconsistency and contamination (preliminary version)SummaryPODC
Resource bounds for self stabilising message driven protocolsSummaryPODC
Unreliable failure detectors for asynchronous systems (preliminary version)SummaryPODC
Distributed priority algorithms under one-bit-delay constraintSummaryPODC
Connection-based communication in dynamic networksSummaryPODC
Requirements for deadlock-free, adaptive packet routingSummaryPODC
The slide mechanism with applications in dynamic networksSummaryPODC
Computing with faulty shared memorySummaryPODC
Concurrent countingSummaryPODC
Optimal multi-writer multi-reader atomic registerSummaryPODC
Performing work efficiently in the presence of faultsSummaryPODC
Observing self-stabilizationSummaryPODC
The weakest failure detector for solving consensusSummaryPODC
Improving fast mutual exclusionSummaryPODC
Fast network decompositionSummaryPODC
Leader election in complete networksSummaryPODC
The impact of time on the session problemSummaryPODC
The possibility and the complexity of achieving fault-tolerant coordinationSummaryPODC
Recent trends in experimental operating systems researchSummaryPODC
Issues and directions in scalable parallel computingSummaryPODC
Atomic snapshots in O(n log n) operationsSummaryPODC
Fast deflection routing for packets and wormsSummaryPODC
Experiences with a model for parallel computationSummaryPODC
Wait-free clock synchronizationSummaryPODC
Designing algorithms for distributed systems with partially synchronized clocksSummaryPODC
A completeness theorem for a class of synchronization objectsSummaryPODC
Fast, scalable synchronization with minimal hardware supportSummaryPODC
Adaptive solutions to the mutual exclusion problemSummaryPODC
On the space complexity of randomized synchronizationSummaryPODC
A lower bound on wait-free countingSummaryPODC
Knowledge-oriented programmingSummaryPODC
Research issues in ubiquitous computingSummaryPODC
Multimedia networking: applications and challengesSummaryPODC
Making operations of concurrent data types fastSummaryPODC
Delimiting the power of bounded size synchronization objects (extended abstract)SummaryPODC
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)SummaryPODC
Contention—free complexity of shared memory algorithmsSummaryPODC
Using belief to reason about cache coherenceSummaryPODC
Mixed consistency: a model for parallel programming (extended abstract)SummaryPODC
A checkpoint protocol for an entry consistent shared memory systemSummaryPODC
A performance evaluation of lock-free synchronization protocolsSummaryPODC
Using k-exclusion to implement resilient, scalable shared objects (extended abstract)SummaryPODC
Disjoint-access-parallel implementations of strong shared memory primitivesSummaryPODC
Resilience of general interactive tasksSummaryPODC
Potential function analysis of greedy hot-potato routingSummaryPODC
Self-stabilization by counter flushingSummaryPODC
Adaptive algorithms for PASO systemsSummaryPODC
Uniform actions in asynchronous distributed systemsSummaryPODC
Knowledge, timed precedence and clocks (preliminary report)SummaryPODC
Proving time bounds for randomized distributed algorithmsSummaryPODC
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)SummaryPODC
On the use of registers in achieving wait-free consensusSummaryPODC
Consensus power makes (some) sense! (extended abstract)SummaryPODC
Self-stabilizing algorithms for finding centers and medians of treesSummaryPODC
Leader election in the presence of link failures (abstract)SummaryPODC
The impact of synchronization on the session problemSummaryPODC
Dynamic load sharing algorithm with a weighted load representationSummaryPODC
Consistency and conformance in ODP (abstract)SummaryPODC
Verification of a distributed algorithm (abstract)SummaryPODC
Dynamic sets for searchSummaryPODC
Competitiveness in distributed algorithmsSummaryPODC
Simulating fail-stop in asynchronous distributed systemsSummaryPODC
On the memory overhead of distributed snapshotsSummaryPODC
Distributed pursuit-evasion: some aspects of privacy and security in distributed computingSummaryPODC
Contention in counting networksSummaryPODC
A case for NOW (networks of workstation)SummaryPODC
Sub-linear distributed algorithms for sparse certificates and biconnected componentsSummaryPODC
Faster computation on directed networks of automataSummaryPODC
On distributed object checkpointing and recoverySummaryPODC
On the relevance of communication costs of rollback-recovery protocolsSummaryPODC
More on t-resilience vs. wait-freedom (extended abstract)SummaryPODC
Achieving independence efficiently and securelySummaryPODC
Reasoning about meta level activities in open distributed systemsSummaryPODC
Knowledge-based programsSummaryPODC
Formal semantics for expressing optimism: the meaning of HOPESummaryPODC
Formal verification of timed properties of randomized distributed algorithmsSummaryPODC
Long-lived renaming made fastSummaryPODC
Lock-free linked lists using compare-and-swapSummaryPODC
Optimal distributed algorithm for minimum spanning trees revisitedSummaryPODC
Fast distributed construction of k-dominating sets and applicationsSummaryPODC
A modular measure of competitiveness for distributed algorithmsSummaryPODC
SuperStabilizing protocols for dynamic distributed systemsSummaryPODC
Self-stabilizing clock synchronization with Byzantine faultsSummaryPODC
The RAPID C++ environment (work in progress)SummaryPODC
Architecture decisions for wide area applicationsSummaryPODC
Prediction based task scheduling in distributed computingSummaryPODC
A view-based approach to relaxing global serializability in a multidatabase systemSummaryPODC
A calculus for concurrent update (abstract)SummaryPODC
Lazy-writer multivalued registersSummaryPODC
Using lock-free objects in hard real-time applicationsSummaryPODC
Complete implementations for shared memory consistency conditionsSummaryPODC
A logarithmic depth counting networkSummaryPODC
Load balancing networksSummaryPODC
Atomicity in electronic commerceSummaryPODC
Memory requirements for silent stabilizationSummaryPODC
Fault-containing self-stabilizing algorithmsSummaryPODC
About state recording in asynchronous computationsSummaryPODC
Minimizing access costs in replicated distributed systemsSummaryPODC
Trade-offs in implementing causal message logging protocolsSummaryPODC
Efficient message ordering in dynamic networksSummaryPODC
An efficient recovery-based spin lock protocol for preemptive shared-memory multiprocessorsSummaryPODC
Characterization of message ordering specifications and protocolsSummaryPODC
Comparing primary-backup and state machines for crash failuresSummaryPODC
Synthesis of distributed control systemsSummaryPODC
Synthesis of concurrent systems for an atomic read/atomic write model of computationSummaryPODC
Testing concurrent data structuresSummaryPODC
Memory requirement for routing in distributed networksSummaryPODC
Optimal routing tablesSummaryPODC
Fast, long-lived renaming improved and simplifiedSummaryPODC
The complexity of data mining on the WebSummaryPODC
Efficient token-based control in ringsSummaryPODC
Efficient traffic laws for mobile robots—work in progressSummaryPODC
Polylog randomized wait-free consensusSummaryPODC
Asynchrony versus bulk-synchrony in QRQW PRAM modelsSummaryPODC
Space-efficient construction of buffer-optimal 1-writer 1-reader multivalued atomic variableSummaryPODC
Randomized adaptive video on demandSummaryPODC
Distributed algorithms for sparse k-connectivity certificatesSummaryPODC
Randomness in private computationsSummaryPODC
Distributed pseudo-random bit generators—a new way to speed-up shared coin tossingSummaryPODC
Early-stopping Terminating Reliable Broadcast protocol for general-omission failuresSummaryPODC
Baked potatoes: deadlock prevention via schedulingSummaryPODC
Convergence complexity of optimistic rate based flow control algorithms (brief announcement)SummaryPODC
Universal operations: unary versus binarySummaryPODC
Space bounds for transactional synchronizationSummaryPODC
What critical algebraic property allows operations of concurrent abstract data types to be “fast”?SummaryPODC
The role of data-race-free programs in recoverable DSMSummaryPODC
Crash failures vs. crash + link failuresSummaryPODC
Crash failures can drive protocols to arbitrary statesSummaryPODC
Time and space lower bounds for non-blocking implementations (preliminary version)SummaryPODC
Simple, fast, and practical non-blocking and blocking concurrent queue algorithmsSummaryPODC
A proof of a theorem in algebraic-topology by a distributed algorithmSummaryPODC
Wait-free solvability via combinatorial topologySummaryPODC
Simulation as an iterated taskSummaryPODC
On the decidability of distributed decision tasksSummaryPODC
Counting networks are practically linearizableSummaryPODC
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)SummaryPODC
Eventually-serializable data servicesSummaryPODC
The strength of counting networksSummaryPODC
Tight bounds on the cumulative profit of distributed votersSummaryPODC
The offset problemSummaryPODC
Fail-awareness in timed asynchronous systemsSummaryPODC
On the impossibility of group membershipSummaryPODC
Collective consistency work in progressSummaryPODC
Impossibility of (repeated) reliable broadcastSummaryPODC
A framework for partitionable membership serviceSummaryPODC
Multi party computations: past and presentSummaryPODC
Internet support for wireless and mobile networking (tutorial)SummaryPODC
Principles and patterns of high-performance and real-time distributed object computing (tutorial)SummaryPODC
Maintaining authenticated communication in the presence of break-insSummaryPODC
Randomness vs. fault-toleranceSummaryPODC
Relative liveness and behavior abstraction (extended abstract)SummaryPODC
Dynamic voting for consistent primary componentsSummaryPODC
Lazy consistency using loosely synchronized clocksSummaryPODC
How useful is old information (extended abstract)?SummaryPODC
Determining consensus numbersSummaryPODC
On the power of shared object types to implement one-resilient ConsensusSummaryPODC
Disentangling multi-object operations (extended abstract)SummaryPODC
A wait-free sorting algorithmSummaryPODC
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)SummaryPODC
Algorithmic problems in Internet researchSummaryPODC
High performance clusters: state of the art and challenges aheadSummaryPODC
How to find it (abstract): research issues in distributed searchSummaryPODC
Distributed and parallel computing issues in data warehousing (abstract)SummaryPODC
Compact routing schemes with low stretch factor (extended abstract)SummaryPODC
Reconsidering fragmentation and reassemblySummaryPODC
Competitive dynamic bandwidth allocationSummaryPODC
Contention in balancing networks resolved (extended abstract)SummaryPODC
Asynchronous group mutual exclusion (extended abstract)SummaryPODC
Combining funnels: a new twist on an old tale…SummaryPODC
Amortizing randomness in private multiparty computationsSummaryPODC
Universal service-providers for database private information retrieval (extended abstract)SummaryPODC
Optimal efficiency of optimistic contract signingSummaryPODC
The unified structure of consensus: a layered analysis approachSummaryPODC
Unifying synchronous and asynchronous message-passing modelsSummaryPODC
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchronySummaryPODC
The message classification modelSummaryPODC
Reliable message delivery and conditionally-fast transactions are not possible without accurate clocksSummaryPODC
Synthesis of fault-tolerant concurrent programsSummaryPODC
A lower bound on the local time complexity of universal constructionsSummaryPODC
A tight lower bound for randomized synchronous consensusSummaryPODC
A time complexity lower bound for randomized implementations of some shared objectsSummaryPODC
Consensus numbers of multi-objectsSummaryPODC
Persistent messages in local transactionsSummaryPODC
A dynamic view-oriented group communication serviceSummaryPODC
Supporting quality of service in HTTP serversSummaryPODC
The HIP protocol for hierarchical multicast routingSummaryPODC
In-place reconstruction of delta compressed filesSummaryPODC
A polylog time wait-free construction for closed objectsSummaryPODC
Structured derivations of consensus algorithms for failure detectorsSummaryPODC
A consistent history link connectivity protocolSummaryPODC
An error control scheme for large-scale multicast applicationsSummaryPODC
The global efficiency of distributed, rate-based, flow control algorithmsSummaryPODC
Scalable best matching prefix lookupsSummaryPODC
Muteness detectors for consensus with Byzantine processesSummaryPODC
Implementing and evaluating an eventually-serializable data serviceSummaryPODC
k-stabilization of reactive tasksSummaryPODC
Asynchronous time-adaptive self stabilizationSummaryPODC
Robust efficient distributed RSA-key generationSummaryPODC
Probabilistic Byzantine quorum systemsSummaryPODC
Efficient evaluation of causality relations between nonatomic eventsSummaryPODC
An agent-based architecture for building CORBA distributed systemsSummaryPODC
Responsiveness and consistency tradeoffs in interactive groupwareSummaryPODC
Propeties of the r-operators to insure termination of distributed computationsSummaryPODC
Optimal and efficient clock synchronization under drifting clocksSummaryPODC
Analysis of timing-based mutual exclusion with random timesSummaryPODC
A simple local-spin group mutual exclusion algorithmSummaryPODC
Rollback-dependency trackability: visible characterizationsSummaryPODC
Optimal locking integrated with operational transformation in distributed real-time group editorsSummaryPODC
Matching events in a content-based subscription systemSummaryPODC
Liveness-preserving simulation relationsSummaryPODC
Long-lived renaming made adaptiveSummaryPODC
Flash Mixing SummaryPODC
Scalable concurrent priority queue algorithmsSummaryPODC
Wait-free synchronization in multiprogrammed systems: integrating priority-based and quantum-based schedulingSummaryPODC
Sequentially consistent versus linearizable counting networksSummaryPODC
Decentralized replicated-object protocolsSummaryPODC
Timed consistency for shared distributed objectsSummaryPODC
Comparison of initial conditions for distributed algorithms on anonymous networksSummaryPODC
Computing anonymously with arbitrary knowledgeSummaryPODC
Backward consistency and sense of direction in advanced distributed systemsSummaryPODC
Memory space requirements for self-stabilizing leader election protocolsSummaryPODC
Optimal reactive k-stabilization: the case of mutual exclusionSummaryPODC
A faster distributed algorithm for computing maximal matchings deterministicallySummaryPODC
Resource discovery in distributed networksSummaryPODC
Fast set agreement in the presence of timing uncertaintySummaryPODC
On k-set consensus problems in asynchronous systemsSummaryPODC
Mutable checkpoints: a new checkpointing approach for mobile computing systemsSummaryPODC
Delay-optimal quorum-based mutual exclusion for distributed systemsSummaryPODC
The HiMAT model for mobile agent applicationsSummaryPODC
The sound of silence—guessing games for saving energy in mobile environmentSummaryPODC
Fundamental distributed protocols in mobile networksSummaryPODC
External logging on a logical ringSummaryPODC
A dynamic self-stabilizing algorithm for finding strongly connected componentsSummaryPODC
Two classes of communication patternsSummaryPODC
Optimal, distributed decision-making: the case of no communicationSummaryPODC
Using CSP to derive a sequentially consistent DSM systemSummaryPODC
Maintenance of a spanning tree in dynamic networksSummaryPODC
Lower and upper bounds for attacks on authentication protocolsSummaryPODC
A design methodology for mobile distributed applications based on UNITY formalism and communication-closed layeringSummaryPODC
Distributed algorithms in TLA (abstract)SummaryPODC
A middleware overview: goals, research issues, and coded examples (abstract)SummaryPODC
Data communications vs. distributed computing (abstract)SummaryPODC
How computer architecture trends may affect future distributed systems: from infiniBand clusters to inter-processor speculation (abstract)SummaryPODC
Average-case analysis of greedy packet scheduling (extended astract)SummaryPODC
Adaptive and efficient mutual exclusion (extended abstract)SummaryPODC
Assigning labels in unknown anonymous networks (extended abstract)SummaryPODC
Clock synchronization with faults and recoveries (extended abstract)SummaryPODC
Garbage collection of timestamped data in StampedeSummaryPODC
On the interconnection of causal memory systemsSummaryPODC
Distributed reconfiguration of metamorphic robot chainsSummaryPODC
1/k phase stamping for continuous shared data (extended abstract)SummaryPODC
High performance adaptive middleware for CORBA-based systemsSummaryPODC
X-ability: a theory of replicationSummaryPODC
Self-stabilizing token circulation on asynchronous uniform unidirectional ringsSummaryPODC
Stable and fault-tolerant object allocationSummaryPODC
Indulgent algorithms (preliminary version)SummaryPODC
Fast deterministic consensus in a noisy environmentSummaryPODC
Toward a theory of maximally concurrent programs (shortened version)SummaryPODC
Optimal implementation of the weakest failure detector for solving consensus (brief announcement)SummaryPODC
Deterministic distributed resource discovery (brief announcement)SummaryPODC
Fast protocol transition in a distributed environment (brief announcement)SummaryPODC
The ABCD’s of PaxosSummaryPODC
Implementing atomic objects in a dynamic environmentSummaryPODC
On beyond registers: wait-free readable objectsSummaryPODC
Computing almost shortest pathsSummaryPODC
Distributed MST for constant diameter graphsSummaryPODC
On the generalized dining philosophers problemSummaryPODC
A note on group mutual exclusionSummaryPODC
Nearly optimal perfectly-periodic schedulesSummaryPODC
Compressed bloom filtersSummaryPODC
A hierarchy of conditions for consensus solvabilitySummaryPODC
The concurrency hierarchy, and algorithms for unbounded concurrencySummaryPODC
On scalable and efficient distributed failure detectorsSummaryPODC
Lock-free reference countingSummaryPODC
Detecting distributed cycles of garbage in large-scale systemsSummaryPODC
Reliability and performance of hierarchical RAID with multiple controllersSummaryPODC
Distributed multi-broadcast in unknown radio networksSummaryPODC
Selective private function evaluation with applications to private statisticsSummaryPODC
Optimal scheduling for disconnected cooperationSummaryPODC
Randomized shared queuesSummaryPODC
Dynamic input/output automata, a formal model for dynamic systemsSummaryPODC
A framework for semantic reasoning about Byzantine quorum systemsSummaryPODC
An efficient communication strategy for ad-hoc mobile networksSummaryPODC
Correction: practical implementations of non-blocking synchronization primitivesSummaryPODC
Nonatomic mutual exclusion with local spinningSummaryPODC
Space-optimal multi-writer snapshot objects are slowSummaryPODC
Safe memory reclamation for dynamic lock-free objects using atomic reads and writesSummaryPODC
The inherent price of indulgenceSummaryPODC
Competitive concurrent distributed queuingSummaryPODC
Non-blocking timeout in scalable queue-based spin locksSummaryPODC
Minimal replication cost for availabilitySummaryPODC
Building secure file systems out of byzantine storageSummaryPODC
Detectable byzantine agreement secure against faulty majoritiesSummaryPODC
A highly concurrent group mutual l-exclusion algorithm0SummaryPODC
Assignment-based partitioning in a condition monitoring systemSummaryPODC
Optimal plans for aggregationSummaryPODC
General perfectly periodic schedulingSummaryPODC
Sequential composition of protocols without simultaneous terminationSummaryPODC
Squirrel: a decentralized peer-to-peer web cacheSummaryPODC
Evaluating the running time of a communication round over the internetSummaryPODC
How to wait when you are not going to blockSummaryPODC
Early stopping in global data computationSummaryPODC
f-arrays: implementation and applicationsSummaryPODC
Dynamic and self-stabilizing distributed matchingSummaryPODC
Working with mike on distributed computing theory, 1978–1992SummaryPODC
Fischer’s cryptographic protocolsSummaryPODC
Compact roundtrip routing with topology-independent node namesSummaryPODC
Geometric ad-hoc routing: of theory and practiceSummaryPODC
Software transactional memory for dynamic-sized data structuresSummaryPODC
Split-ordered lists: lock-free extensible hash tablesSummaryPODC
Routing networks for distributed hash tablesSummaryPODC
Asynchronous resource discoverySummaryPODC
Oblivious signature-based envelopeSummaryPODC
Scalable public-key tracing and revokingSummaryPODC
Brief announcement: impossibility results for concurrent secure two-party computationSummaryPODC
tight bounds for k-set agreement with limited-scope failure detectorsSummaryPODC
Proactive secure message transmission in asynchronous networksSummaryPODC
Efficient reliable communication over partially authenticated networksSummaryPODC
Brief announcement: extending SQL access control to derived and distributed dataSummaryPODC
A work-optimal deterministic algorithm for the asynchronous certified write-all problemSummaryPODC
Performing work with asynchronous processors: message-delay-sensitive boundsSummaryPODC
Adaptive and efficient abortable mutual exclusionSummaryPODC
Automatic discovery of mutual exclusion algorithmsSummaryPODC
On using network attached disks as shared memorySummaryPODC
A lattice-theoretic characterization of safety and livenessSummaryPODC
Scaling properties of the Internet graphSummaryPODC
Adapting to a reliable network pathSummaryPODC
Mechanism design for policy routingSummaryPODC
Bringing practical lock-free synchronization to 64-bit applicationsSummaryPODC
An almost non-blocking stackSummaryPODC
Lock-free linked lists and skip listsSummaryPODC
Lower bounds for adaptive collect and related objectsSummaryPODC
Efficient synchronous snapshotsSummaryPODC
Specification faithfulness in networks with rational nodesSummaryPODC
On spectrum sharing gamesSummaryPODC
Load balancing and locality in range-queriable data structuresSummaryPODC
Choosing a random peerSummaryPODC
Compact routing on euclidian metricsSummaryPODC
When graph theory helps self-stabilizationSummaryPODC
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming modelsSummaryPODC
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphsSummaryPODC
Efficient top-K query calculation in distributed networksSummaryPODC
Byzantine disk paxos: optimal resilience with byzantine shared memorySummaryPODC
On the design of distributed protocols from differential equationsSummaryPODC
How fast can a distributed atomic read be?SummaryPODC
Signed quorum systemsSummaryPODC
A better wake-up in radio networksSummaryPODC
A note on efficient aggregate queries in sensor networksSummaryPODC
Computation in networks of passively mobile finite-state sensorsSummaryPODC
What cannot be computed locally!SummaryPODC
Gradient clock synchronizationSummaryPODC
Communication-efficient leader election and consensus with limited link synchronySummaryPODC
The weakest failure detectors to solve certain fundamental problems in distributed computingSummaryPODC
Group membership: a novel approach and the first single-round algorithmSummaryPODC
Asynchronous group key exchange with failuresSummaryPODC
stretch between nearby peersSummaryPODC
prefix hash treeSummaryPODC
detecting malicious routersSummaryPODC
a single enqueuer wait-free queue implementationSummaryPODC
constraint-based synchronization and verification of concurrent programsSummaryPODC
completing the lock-free dynamic cycleSummaryPODC
spoofing prevention methodSummaryPODC
concurrent maintenance of ringsSummaryPODC
name-independent compact routing in treesSummaryPODC
Trilix: a scalable unstructured lookup system for dynamic environmentsSummaryPODC
virtual mobile nodes for mobile ad hoc networksSummaryPODC
reconfigurable byzantine-fault-tolerant atomic memorySummaryPODC
building an adaptive distributed web server system on the fly for handling web hotspotsSummaryPODC
Cataclysm: handling extreme overloads in internet servicesSummaryPODC
RT oblivious erasure correctingSummaryPODC
degree: optimal deterministic routing for P2P systemsSummaryPODC
efficient clustering in unstructured radio networksSummaryPODC
on the round complexity of distributed consensus over synchronous networksSummaryPODC
the synchronous condition-based consensus hierarchySummaryPODC
efficient implementation of a byzantine data storage systemSummaryPODC
Brief announcement: on the inherent cost of generic broadcastSummaryPODC
Brief announcement: on the possibility of consensus in asynchronous systems with finite average response timesSummaryPODC
A topological characterization of weaknessSummaryPODC
Proof labeling schemesSummaryPODC
Efficient dependency tracking for relevant events in shared-memory systemsSummaryPODC
Policy-hiding access control in open environmentSummaryPODC
Distance estimation and object location via rings of neighborsSummaryPODC
On the locality of bounded growthSummaryPODC
Skip-webs: efficient distributed data structures for multi-dimensional data setsSummaryPODC
Efficient lookup on unstructured topologiesSummaryPODC
The price of selfish behavior in bilateral network formationSummaryPODC
Facility location: distributed approximationSummaryPODC
Primal-dual based distributed algorithms for vertex cover with semi-hard capacitiesSummaryPODC
Faster communication in known topology radio networksSummaryPODC
On reliable broadcast in a radio networkSummaryPODC
Maximal independent sets in radio networksSummaryPODC
On selection problem in radio networksSummaryPODC
Fast fault-tolerant agreement algorithmsSummaryPODC
The combined power of conditions and failure detectors to solve asynchronous set agreementSummaryPODC
The weakest failure detector to solve nonuniform consensusSummaryPODC
Routing complexity of faulty networksSummaryPODC
Feedback control for router congestion resolutionSummaryPODC
Competitive weighted throughput analysis of greedy protocols on DAGsSummaryPODC
Advanced contention management for dynamic software transactional memorySummaryPODC
Efficient multi-word locking using randomizationSummaryPODC
Toward a theory of transactional contention managersSummaryPODC
Stochastic analysis of distributed deadlock schedulingSummaryPODC
Adaptive routing with stale informationSummaryPODC
Session details: Peer-to-peerSummaryPODC
A scheme for load balancing in heterogenous distributed hash tablesCorrectness of a gossip based membership protocolSummaryPODC
On the establishment of distinct identities in overlay networksSummaryPODC
Feasibility and complexity of broadcasting with random transmission failuresSummaryPODC
Reliable broadcast in unknown fixed-identity networksSummaryPODC
The art of multiprocessor programmingSummaryPODC
Century papers at the first quarter-century milestoneSummaryPODC
Distributed social systemsSummaryPODC
On the complexity of distributed graph coloringSummaryPODC
Quorum placement in networks: minimizing network congestionSummaryPODC
Distributed verification of minimum spanning treesSummaryPODC
When selfish meets evil: byzantine players in a virus inoculation gameSummaryPODC
Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing gamesSummaryPODC
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computationSummaryPODC
EquiCast: scalable multicast with selfish usersSummaryPODC
Grouped distributed queues: distributed queue, proportional share multiprocessor schedulingSummaryPODC
Sketching asynchronous streams over a sliding windowSummaryPODC
Adversarial queuing on the multiple-access channelSummaryPODC
Veracity radius: capturing the locality of distributed computationsSummaryPODC
Life is not a state-machine: the long road from research to productionSummaryPODC
Computing separable functions via gossipSummaryPODC
Peer counting and sampling in overlay networks: random walk methodsSummaryPODC
On the topologies formed by selfish peersSummaryPODC
Self-stabilizing byzantine agreementSummaryPODC
Optimally efficient multi-valued byzantine agreementSummaryPODC
Oracle size: a new measure of difficulty for communication tasksSummaryPODC
Object location using path separatorsSummaryPODC
Optimal-stretch name-independent compact routing in doubling metricsSummaryPODC
Local approximation schemes for topology controlSummaryPODC
Single-scanner multi-writer snapshot implementations are fast!SummaryPODC
An O(1) RMRs leader election algorithmSummaryPODC
How fast can a very robust read be?An Ω (n log n) lower bound on the cost of mutual exclusionSummaryPODC
Stably computable predicates are semilinearSummaryPODC
Transactional contention management as a non-clairvoyant scheduling problemSummaryPODC
Synchronizing without locks is inherently expensiveSummaryPODC
Towards a theory of transactional contention managersSummaryPODC
The Akamai approach to achieving performance and reliability on the internetSummaryPODC
SNZI: scalable NonZero indicatorsSummaryPODC
Abortable and query-abortable objects and their efficient implementationSummaryPODC
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CASSummaryPODC
Reconstructing approximate tree metricsSummaryPODC
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphsSummaryPODC
Improved sparse covers for graphs excluding a fixed minorSummaryPODC
Compact routing with slack in low doubling dimensionSummaryPODC
Compact routing with slackSummaryPODC
Towards fast decentralized construction of locality-aware overlay networksSummaryPODC
On the complexity of greedy routing in ring-based peer-to-peer networksSummaryPODC
Constructing scalable overlays for pub-sub with many topicsSummaryPODC
Efficient fork-linearizable access to untrusted shared memorySummaryPODC
Truth in advertising: lightweight verification of route integritySummaryPODC
Countering web spam with credibility-based link analysisSummaryPODC
Distributed approximate matchingSummaryPODC
Controller and estimator for dynamic networksSummaryPODC
Broadcasting in udg radio networks with unknown topologySummaryPODC
Communication in dynamic radio networksSummaryPODC
Time-decaying sketches for sensor data aggregationSummaryPODC
Summarizing data using bottom-k sketchesSummaryPODC
On the weakest failure detector everSummaryPODC
Tolerating corrupted communicationSummaryPODC
Optimal inter-object correlation when replicating for availabilitySummaryPODC
Greedy distributed optimization of multi-commodity flowsSummaryPODC
Distributed network monitoring and multicommodity flows: a primal-dual approachSummaryPODC
Network formation games with local coalitionsSummaryPODC
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptionsSummaryPODC
Towards the minimal synchrony for byzantine consensusSummaryPODC
Remote storage with byzantine serversSummaryPODC
Multicoordinated PaxosSummaryPODC
From an intermittent rotating star to a leaderSummaryPODC
Practical private computation of vector addition-based functionsSummaryPODC
d-clock: distributed QoS in heterogeneous resource environmentsSummaryPODC
Privatization techniques for software transactional memory and privatization in Delaunay triangulationSummaryPODC
From causal to z-linearizable transactional memorySummaryPODC
Sharpness, a tight condition for throughput scalabilitySummaryPODC
An analysis of intention preservation in group editorsSummaryPODC
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approachSummaryPODC
Theory of BAR gamesSummaryPODC
An algorithm composition scheme preserving monotonicitySummaryPODC
A denial-of-service resistant DHTSummaryPODC
SuperTrust: a secure and efficient framework for handling trust in super-peer netwNon-searchability of random scale-free graphsorksSummaryPODC
Optimal atomic broadcast and multicast algorithms for wide area networksSummaryPODC
DoS-resilient secure aggregation queries in sensor networksSummaryPODC
Self-stabilizing counting in mobile sensor networksSummaryPODC
Paxos made live: an engineering perspectiveSummaryPODC
Beyond nash equilibrium: solution concepts for the 21st centurySummaryPODC
The internet is flat: a brief history of networking in the next ten yearsSummaryPODC
Accountability for distributed systemsSummaryPODC
Distributed computation of the modeSublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decompositionSummaryPODC
Brahms: byzantine resilient random membership samplingSummaryPODC
Improved compact routing schemes for dynamic treesSummaryPODC
The forgiving tree: a self-healing distributed data structureSummaryPODC
Flooding time in edge-Markovian dynamic graphsSummaryPODC
Distributed algorithms for ultrasparse spanners and linear size skeletonsSummaryPODC
New combinatorial topology upper and lower bounds for renamingSummaryPODC
Timeliness-based wait-freedom: a gracefully degrading progress conditionSummaryPODC
Lower bounds for randomized consensus under a weak adversarySummaryPODC
Randomized consensus in expected O(n log n) individual workSummaryPODC
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuingSummaryPODC
The impact of randomization in smoothing networksSummaryPODC
Optimizing data popularity conscious bloom filtersSummaryPODC
Distributed order scheduling and its application to multi-core dram controllersSummaryPODC
OCD: obsessive consensus disorder (or repetitive consensus)SummaryPODC
Forget him and keep on movingSummaryPODC
On the internet delay space dimensionalitySummaryPODC
The asynchronous bounded-cycle modelSummaryPODC
Model checking transactional memory with spinSummaryPODC
A fast distributed slicing algorithmSummaryPODC
A dynamic exchange gameSummaryPODC
Our brothers’ keepersSummaryPODC
Nearest-neighbor graphs on random point sets and their applications to sensor networksSummaryPODC
Dynamic service assignment in mobile networks: the magma approachSummaryPODC
Distributed averaging in the presence of a sparse cutSummaryPODC
Quantum distributed consensusSummaryPODC
Tight RMR lower bounds for mutual exclusion and other problemsSummaryPODC
Closing the complexity gap between mutual exclusion and FCFS mutual exclusionSummaryPODC
Optimizing consistency checking for memory-intensive transactionsSummaryPODC
Transactional memory retry mechanismsSummaryPODC
Efficient single phase unconditionally secure message transmission with optimum communication complexitySummaryPODC
The power of simulation relationsSummaryPODC
The future of distributed computing: renaissance or reformation?SummaryPODC
Refining the way to consensusSummaryPODC
Memory models: a case for rethinking parallel languages and hardwareSummaryPODC

#distributed-systems, #operating-systems