Image de couverture de livre

Round-optimal $n$-Block Broadcast Schedules in Logarithmic Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Träff, Jesper Larsson
Format:	Preprint
Publié:	2023
Sujets:	Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal Broadcast Schedules in Logarithmic Time with Applications to Broadcast, All-Broadcast, Reduction and All-Reduction
par: Träff, Jesper Larsson
Publié: (2024)

Communication Round and Computation Efficient Exclusive Prefix-Sums Algorithms (for MPI_Exscan)
par: Träff, Jesper Larsson
Publié: (2025)

Optimal, Non-pipelined Reduce-scatter and Allreduce Algorithms
par: Träff, Jesper Larsson
Publié: (2024)

Lectures on Parallel Computing
par: Träff, Jesper Larsson
Publié: (2024)

Two Efficient Message-passing Exclusive Scan Algorithms
par: Träff, Jesper Larsson
Publié: (2026)

Broadcast in Almost Mixing Time
par: Paramonov, Anton, et autres
Publié: (2025)

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
par: Fuchs, Marc, et autres
Publié: (2025)

Byzantine Reliable Broadcast with Low Communication and Time Complexity
par: Locher, Thomas
Publié: (2024)

Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
par: Hillebrandt, Henning, et autres
Publié: (2026)

BCM-Broadcast: A Byzantine-Tolerant Causal Broadcast Algorithm for Distributed Mobile Systems
par: NamvariTazehkand, Leila, et autres
Publié: (2024)

Dynamic Probabilistic Reliable Broadcast
par: Anikina, Veronika, et autres
Publié: (2023)

Broadcasting on Adversarial Multiple Access Channels
par: Aldawsari, Bader A., et autres
Publié: (2021)

Fast Byzantine Total Order Broadcast
par: Monti, Matteo, et autres
Publié: (2024)

Snow: Self-organizing Broadcast Protocol for Cloud
par: Tong, Chengkai
Publié: (2025)

Slim-ABC: An Optimized Atomic Broadcast Protocol
par: Sony, Nasit S, et autres
Publié: (2024)

Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
par: D'Amato, Francesco, et autres
Publié: (2023)

Vertical Atomic Broadcast and Passive Replication (Extended Version)
par: Bravo, Manuel, et autres
Publié: (2024)

Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience
par: Hu, Michael Yiqing, et autres
Publié: (2026)

Optimistic, Signature-Free Reliable Broadcast and Its Applications
par: Shrestha, Nibesh, et autres
Publié: (2025)

On the Universality of Round Elimination Fixed Points
par: Balliu, Alkida, et autres
Publié: (2025)

Network-Offloaded Bandwidth-Optimal Broadcast and Allgather for Distributed AI
par: Khalilov, Mikhail, et autres
Publié: (2024)

Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
par: Parzych, Garrett, et autres
Publié: (2024)

A Real-Time Digital Twin for Adaptive Scheduling
par: Zhang, Yihe, et autres
Publié: (2025)

Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer
par: Cohen, Shir, et autres
Publié: (2021)

The Expressive Power of Uniform Population Protocols with Logarithmic Space
par: Czerner, Philipp, et autres
Publié: (2024)

Accurate Computation of the Logarithm of Modified Bessel Functions on GPUs
par: Plesner, Andreas, et autres
Publié: (2024)

TOB-SVD: Total-Order Broadcast with Single-Vote Decisions in the Sleepy Model
par: D'Amato, Francesco, et autres
Publié: (2023)

Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
par: Albouy, Timothé, et autres
Publié: (2023)

Oblivious Robots Under Round Robin: Gathering on Rings
par: Navarra, Alfredo, et autres
Publié: (2025)

On Orchestrating Parallel Broadcasts for Distributed Ledgers
par: Sheng, Peiyao, et autres
Publié: (2024)

Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
par: Balliu, Alkida, et autres
Publié: (2024)

The Logarithmic Random Bidding for the Parallel Roulette Wheel Selection with Precise Probabilities
par: Nakano, Koji
Publié: (2024)

DARIS: An Oversubscribed Spatio-Temporal Scheduler for Real-Time DNN Inference on GPUs
par: Babaei, Amir Fakhim, et autres
Publié: (2025)

Eliminating Timing Anomalies in Scheduling Periodic Segmented Self-Suspending Tasks with Release Jitter
par: Lin, Ching-Chi, et autres
Publié: (2024)

GCAPS: GPU Context-Aware Preemptive Priority-based Scheduling for Real-Time Tasks
par: Wang, Yidi, et autres
Publié: (2024)

Parameterized Verification of Round-based Distributed Algorithms via Extended Threshold Automata
par: Baumeister, Tom, et autres
Publié: (2024)

Optimal Fixed Priority Scheduling in Multi-Stage Multi-Resource Distributed Real-Time Systems
par: Kumar, Niraj, et autres
Publié: (2024)

Revisiting the Schedule Graph Generation for the Exact and Sustainable Analysis of Non-preemptive Scheduling
par: Vlk, Marek, et autres
Publié: (2024)

Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin
par: Cicerone, Serafino, et autres
Publié: (2025)

Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots
par: Jana, Saswata, et autres
Publié: (2025)