scientific article; zbMATH DE number 7281359

zbMath1448.68111MaRDI QIDQ5137889

Wim H. Hesselink

Publication date: 3 December 2020

Full work available at URL: https://link.springer.com/article/10.1007/s004460050066

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

memory managementfault-toleranceclient-server architectureconcurrent data objectbounded fairness

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

Tournaments for mutual exclusion: verification and concurrent complexity ⋮ Wait-free concurrent memory management by Create and Read until Deletion (CaRuD) ⋮ Correctness and concurrent complexity of the black-white bakery algorithm

This page was built for publication: