Cover Image

Modelling cooperating failure-resilient Processes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Valk, Rüdiger
Format:	Preprint
Published:	2024
Subjects:	Distributed, Parallel, and Cluster Computing 94-08 D.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Reduction and Synthesis of Petri's Cycloids
by: Valk, Rüdiger, et al.
Published: (2025)

On Reduction and Synthesis of Petri's Cycloids
by: Valk, Rüdiger, et al.
Published: (2024)

Design and Implementation of an Analysis Pipeline for Heterogeneous Data
by: Sarker, Arup Kumar, et al.
Published: (2024)

Combining Serverless and High-Performance Computing Paradigms to support ML Data-Intensive Applications
by: Staylor, Mills, et al.
Published: (2025)

Deep RC: A Scalable Data Engineering and Deep Learning Pipeline
by: Sarker, Arup Kumar, et al.
Published: (2025)

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

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

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

Obfuscated Consensus
by: Aspnes, James, et al.
Published: (2025)

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

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

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

MATCH: Model-Aware TVM-based Compilation for Heterogeneous Edge Devices
by: Hamdi, Mohamed Amine, et al.
Published: (2024)

Clock Synchronization Is Almost Impossible with Bounded Memory
by: Charron-Bost, Bernadette, et al.
Published: (2024)

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

Verifying In-Network Computing Systems for Design Risks
by: Bai, Tianyu, et al.
Published: (2026)

Comparison of Autoscaling Frameworks for Containerised Machine-Learning-Applications in a Local and Cloud Environment
by: Schroeder, Christian, et al.
Published: (2023)

Analysing cycloids using linear algebra
by: Valk, Rüdiger
Published: (2024)

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

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

NBI-Slurm: Simplified submission of Slurm jobs with energy saving mode
by: Telatin, Andrea
Published: (2026)

Stream-K++: Adaptive GPU GEMM Kernel Scheduling and Selection using Bloom Filters
by: Sadasivan, Harisankar, et al.
Published: (2024)

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

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

Data Race Satisfiability on Array Elements
by: Shim, Junhyung, et al.
Published: (2025)

LUNDIsim: model meshes for flow simulation and scientific data compression benchmarks
by: Duval, Laurent, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

DPDPU: Data Processing with DPUs
by: Hu, Jiasheng, et al.
Published: (2024)