The assignment problem

DOI10.1016/j.tcs.2021.06.040OpenAlexW3173869321MaRDI QIDQ2232588

Carole Delporte-Gallet, Giuliano Losa, Eli Gafni, Hugues Fauconnier

Publication date: 6 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.040

zbMATH Keywords

resource allocationassignmentmutual exclusionwait-freerenamingshared-memory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• PlusCal
• TLC

Cites Work

• Solving the at-most-once problem with nearly optimal effectiveness
• On interprocess communication. II: Algorithms
• Myths about the mutual exclusion problem
• Efficient parallel algorithms can be made robust
• Wait-free algorithms for fast, long-lived renaming
• Asynchronous Coordination Under Preferences and Constraints
• Musical Chairs
• The PlusCal Algorithm Language
• Renaming in an asynchronous environment
• At-Most-Once Semantics in Asynchronous Shared Memory
• Performing Work Efficiently in the Presence of Faults
• The Instancy of Snapshots and Commuting Objects
• Atomic snapshots of shared memory
• A new solution of Dijkstra's concurrent programming problem
• The Strong At-Most-Once Problem
• Immediate atomic snapshots and fast renaming

This page was built for publication: The assignment problem