Clock Synchronization Is Almost Impossible with Bounded Memory

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Charron-Bost, Bernadette, de Monterno, Louis Penet
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Distributed, Parallel, and Cluster Computing F.2.2; G.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Stabilizing Consensus is Impossible in Lossy Iterated Immediate Snapshot Models
di: Felber, Stephan, et al.
Pubblicazione: (2024)

A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique
di: Lingas, Andrzej
Pubblicazione: (2024)

On the Node-Averaged Complexity of Locally Checkable Problems on Trees
di: Balliu, Alkida, et al.
Pubblicazione: (2023)

Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
di: Bok, Jan, et al.
Pubblicazione: (2025)

Sublinear-Time Sampling of Spanning Trees in the Congested Clique
di: Pemmaraju, Sriram V., et al.
Pubblicazione: (2024)

Anonymous Self-Stabilising Localisation via Spatial Population Protocols
di: Gąsieniec, Leszek, et al.
Pubblicazione: (2024)

An Analysis of Avalanche Consensus
di: Amores-Sesar, Ignacio, et al.
Pubblicazione: (2024)

Obfuscated Consensus
di: Aspnes, James, et al.
Pubblicazione: (2025)

Why Canonical Rounds Fail for Optimal Byzantine Resilience
di: Attiya, Hagit, et al.
Pubblicazione: (2025)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
di: Gąsieniec, Leszek, et al.
Pubblicazione: (2025)

The consensus number of a shift register equals its width
di: Aspnes, James
Pubblicazione: (2025)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
di: Lingas, Andrzej
Pubblicazione: (2024)

Gathering Semi-Synchronously Scheduled Two-State Robots
di: Otaka, Kohei, et al.
Pubblicazione: (2024)

Near-Optimal Wafer-Scale Reduce
di: Luczynski, Piotr, et al.
Pubblicazione: (2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
di: Gupta, Chetan, et al.
Pubblicazione: (2024)

Scalable overset computation between a forest-of-octrees- and an arbitrary distributed parallel mesh
di: Brandt, Hannes, et al.
Pubblicazione: (2026)

Distributed Rhombus Formation of Sliding Squares
di: Kostitsyna, Irina, et al.
Pubblicazione: (2025)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
di: Lingas, Andrzej
Pubblicazione: (2026)

Fast Gossip-based Rumor Spreading using Small Messages
di: Dufoulon, Fabien, et al.
Pubblicazione: (2026)

FedMon: Federated eBPF Monitoring for Distributed Anomaly Detection in Multi-Cluster Cloud Environments
di: Zehra, Sehar, et al.
Pubblicazione: (2025)

Restless reachability problems in temporal graphs
di: Thejaswi, Suhas, et al.
Pubblicazione: (2020)

GVE-Louvain: Fast Louvain Algorithm for Community Detection in Shared Memory Setting
di: Sahu, Subhajit
Pubblicazione: (2023)

GVE-Leiden: Fast Leiden Algorithm for Community Detection in Shared Memory Setting
di: Sahu, Subhajit
Pubblicazione: (2023)

Decentralized Distributed Graph Coloring: Cluster Graphs
di: Flin, Maxime, et al.
Pubblicazione: (2024)

Low-Depth Spatial Tree Algorithms
di: Baumann, Yves, et al.
Pubblicazione: (2024)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
di: Faour, Salwa, et al.
Pubblicazione: (2025)

Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries
di: Kowalski, Dariusz R., et al.
Pubblicazione: (2025)

High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing
di: Maas, Nikolai
Pubblicazione: (2026)

Data Scheduling Algorithm for Scalable and Efficient IoT Sensing in Cloud Computing
di: Mohammad, Noor Islam S.
Pubblicazione: (2025)

RadiK: Scalable and Optimized GPU-Parallel Radix Top-K Selection
di: Li, Yifei, et al.
Pubblicazione: (2025)

GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in Shared Memory Setting
di: Sahu, Subhajit
Pubblicazione: (2023)

Scalability Optimization in Cloud-Based AI Inference Services: Strategies for Real-Time Load Balancing and Automated Scaling
di: Jin, Yihong, et al.
Pubblicazione: (2025)

AAFLOW: Scalable Patterns for Agentic AI Workflows
di: Sarker, Arup Kumar, et al.
Pubblicazione: (2026)

CooperLLM: Cloud-Edge-End Cooperative Federated Fine-tuning for LLMs via ZOO-based Gradient Correction
di: Sun, He, et al.
Pubblicazione: (2026)

Shortest paths search method based on the projective description of unweighted mixed graphs
di: Melent'ev, V. A.
Pubblicazione: (2023)

An Incrementally Expanding Approach for Updating PageRank on Dynamic Graphs
di: Sahu, Subhajit
Pubblicazione: (2024)

DF* PageRank: Improved Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs
di: Sahu, Subhajit
Pubblicazione: (2024)

Lock-Free Computation of PageRank in Dynamic Graphs
di: Sahu, Subhajit
Pubblicazione: (2024)

Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches
di: Sahu, Subhajit
Pubblicazione: (2024)

Scalable Mesh Coupling for Atmospheric Wave Simulation
di: Brandt, Hannes, et al.
Pubblicazione: (2026)