The proceedings contain 62 papers. The topics discussed include: determining recoverable consensus numbers;history-independent concurrent objects;MemSnap: a fast adaptive snapshot algorithm for RMWable shared-memory;b...
ISBN:
(纸本)9798400706684
The proceedings contain 62 papers. The topics discussed include: determining recoverable consensus numbers;history-independent concurrent objects;MemSnap: a fast adaptive snapshot algorithm for RMWable shared-memory;brief announcement: randomized consensus: common coins are not the holy grail!;game dynamics and equilibrium computation in the population protocol model;brief announcement: optimally encoding information in chemical reaction networks;polylogarithmic time algorithms for shortest path forests in programmable matter;majority consensus thresholds in competitive Lotka-Volterra populations;brief announcement: self-stabilizing mis computation in the beeping model;brief announcement: on the limits of information spread by memory-less agents;and system optimizations for enabling training of extreme long sequence transformer models.
The proceedings contain 44 papers. The topics discussed include: a near time-optimal population protocol for self-stabilizing leader election on rings with a poly-logarithmic number of states;fast convergence of k-opi...
ISBN:
(纸本)9798400701214
The proceedings contain 44 papers. The topics discussed include: a near time-optimal population protocol for self-stabilizing leader election on rings with a poly-logarithmic number of states;fast convergence of k-opinion undecided state dynamics in the population protocol model;brief announcement: efficient collaborative tree exploration with breadth-first depth-next;brief announcement: population protocols decide double-exponential thresholds;the complexity of distributed approximation of packing and covering integer linear programs;efficient distributed decomposition and routing algorithms in minor-free networks and their applications;brief announcement: distributed construction of near-optimal compact routing schemes for planar graphs;brief announcement: the Laplacian paradigm in deterministic congested clique;asynchronous wait-free runtime verification and enforcement of linearizability;and asynchronous wait-free runtime verification and enforcement of linearizability.
The proceedings contain 59 papers. The topics discussed include: node and edge averaged complexities of local graph problems;overcoming congestion in distributed coloring;the landscape of distributed complexities on t...
ISBN:
(纸本)9781450392624
The proceedings contain 59 papers. The topics discussed include: node and edge averaged complexities of local graph problems;overcoming congestion in distributed coloring;the landscape of distributed complexities on trees and beyond;brief announcement: on polynomial-time local decision;brief announcement: distributed MST computation in the sleeping model: awake-optimal algorithms and lower bounds;brief announcement: broadcasting time in dynamic rooted trees is linear;a recursive early-stopping phase king protocol;optimal synchronous approximate agreement with asynchronous fallback;perfectly-secure synchronous MPC with asynchronous fallback guarantees;brief announcement: asynchronous randomness and consensus without trusted setup;and brief announcement: deterministic consensus and checkpointing with crashes: time and communication efficiency.
The proceedings contain 60 papers. The topics discussed include: separating bounded and unbounded asynchrony for autonomous robots: point convergence with limited visibility;on implementing stabilizing leader election...
ISBN:
(纸本)9781450385480
The proceedings contain 60 papers. The topics discussed include: separating bounded and unbounded asynchrony for autonomous robots: point convergence with limited visibility;on implementing stabilizing leader election with weak assumptions on network dynamics;time-optimal self-stabilizing leader election in population protocols;lower bounds on the state complexity of population protocols;comparison dynamics in population protocols;diversity, fairness and sustainability in population protocols;brief announcement: a time and space optimal stable population protocol solving exact majority;a thin self-stabilizing asynchronous unison algorithm with applications to fault tolerant biological networks;and decision power of weak asynchronous models of distributedcomputing.
The proceedings contain 66 papers. The topics discussed include: an adaptive approach to recoverable mutual exclusion;upper and lower bounds on the space complexity of detectable objects;long-lived snapshots with poly...
ISBN:
(纸本)9781450375825
The proceedings contain 66 papers. The topics discussed include: an adaptive approach to recoverable mutual exclusion;upper and lower bounds on the space complexity of detectable objects;long-lived snapshots with polylogarithmic amortized step complexity;from Bezout's identity to space-optimal election in anonymous memory systems;brief announcement: store-collect in the presence of continuous churn with application to snapshots and lattice agreement;brief announcement: why extension-based proofs fail;exponentially faster shortest paths in the congested clique;lower bounds for distributed sketching of maximal matchings and maximal independent sets;seeing far vs. seeing wide: volume complexity of local graph problems;computing shortest paths and diameter in the hybrid network model;revisiting asynchronous fault tolerant computation with optimal resilience;and asynchronous byzantine approximate consensus in directed networks.
The proceedings contain 70 papers. The topics discussed include: composable computation in discrete chemical reaction networks;how to spread a rumor: call your neighbors or take a walk?;efficient size estimation and i...
ISBN:
(纸本)9781450362177
The proceedings contain 70 papers. The topics discussed include: composable computation in discrete chemical reaction networks;how to spread a rumor: call your neighbors or take a walk?;efficient size estimation and impossibility of termination in uniform dense population protocols;on counting the population size;self-stabilizing leader election;brief announcement: logarithmic expected-time leader election in population protocol model;brief announcement: on site fidelity and the price of ignorance in swarm robotic central place foraging algorithms;improved distributed expander decomposition and nearly optimal triangle enumeration;fast approximate shortest paths in the congested clique;brief announcement: optimal distributed covering algorithms;and with great speed come small buffers: space-bandwidth tradeoffs for routing.
The proceedings contain 7 papers. The topics discussed include: Relays: towards a link layer for robust and secure fog computing;distributing computations in fog architectures;scheduling at the edge for assisting clou...
ISBN:
(纸本)9781450357760
The proceedings contain 7 papers. The topics discussed include: Relays: towards a link layer for robust and secure fog computing;distributing computations in fog architectures;scheduling at the edge for assisting cloud real-time systems;enabling exclusive shared access to cloud of things resources;digital epidemiology and beyond;a novel NFV schedule optimization approach with sensitivity to packets dropping positions;and GoEdge: a scalable and stateless local breakout method.
The proceedings contain 9 papers. The topics discussed include: saying what you mean;towards reproducible evaluation of large-scale distributed systems;turn of the carousel – what does edge computing change for distr...
ISBN:
(纸本)9781450357753
The proceedings contain 9 papers. The topics discussed include: saying what you mean;towards reproducible evaluation of large-scale distributed systems;turn of the carousel – what does edge computing change for distributed applications?: research statement;towards a more reliable store-and-forward protocol for mobile text messages;logical clocks are not fair: what is fair? a case study of high-level language and optimization;an analysis of quorum-based abstractions: a case study using gorums to implement raft;data distribution method for fast giga-scale hologram generation on a multi-GPU cluster;language semantics driven design and formal analysis for distributed cyber-physical systems;and Partisan: enabling real-world protocol evaluation.
The proceedings contain 62 papers. The topics discussed include: nesting-safe recoverable linearizability: modular constructions for non-volatile memory;deterministic abortable mutual exclusion with sublogarithmic ada...
ISBN:
(纸本)9781450357951
The proceedings contain 62 papers. The topics discussed include: nesting-safe recoverable linearizability: modular constructions for non-volatile memory;deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity;brief announcement: persistent multi-word compare-and-swap;separating lock-freedom from wait-freedom;passing messages while sharing memory;revisionist simulations: a new approach to proving space lower bounds;on the classification of deterministic objects via set agreement power;leveraging indirect signaling for topology inference and fast broadcast;broadcast in radio networks, time vs. energy tradeoffs;round- and message-optimal distributed graph algorithms;improved massively parallel computation algorithms for mismatching, and vertex cover;distributed approximation of minimum k-edge-connected spanning subgraphs;brief announcement: distributed minimum vertex coloring and maximum independent set in chordal graphs;fair leader election for rational agents in asynchronous rings and networks;leader election in well-connected graphs;almost-surely terminating asynchronous byzantine agreement revisited;sublinear message bounds for randomized agreement;tight bounds for asymptotic and approximate consensus;property testing of planarity in the congest model;and locking timestamps versus locking objects.
The proceedings contain 59 papers. The topics discussed include: exploiting spontaneous transmissions for broadcasting and leader election in radio networks;communication primitives in cognitive radio networks;analyzi...
ISBN:
(纸本)9781450349925
The proceedings contain 59 papers. The topics discussed include: exploiting spontaneous transmissions for broadcasting and leader election in radio networks;communication primitives in cognitive radio networks;analyzing contention and backoff in asynchronous shared memory;a layered architecture for erasure-coded consistent distributed storage;seeing is believing: a client-centric specification of database isolation;space complexity of fault-tolerant register emulations;brief announcement: readers of wait-free unbounded registers must write;brief announcement: fast shared counting using (O(n)) compare-and-swap registers;on the multiparty communication complexity of testing triangle-freeness;distributed MST and routing in almost mixing time;brief announcement: optimal address-oblivious epidemic dissemination;a simple deterministic distributed MST algorithm, with near-optimal time and message complexities;distributed approximation of maximum independent set and maximum matching;deterministic distributed (delta + o(delta))-edge-coloring, and vertex-coloring of graphs with bounded diversity;optimal distance labeling schemes for trees;randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model;effectiveness of delaying timestamp computation;ignore or comply? on breaking symmetry in consensus;and greedy routing and the algorithmic small-world phenomenon.
暂无评论