AI & ML
Hapax Locks : Value-Based Mutual Exclusion
arXiv cs.DC0 views
arXiv:2511.14608v4 Announce Type: replace Abstract: We present Hapax Locks, a novel locking algorithm that is simple, enjoys constant-time arrival and unlock paths, provides FIFO admission order, and which is also space efficient and generates relatively little coherence traffic under contention in the common case. Hapax Locks offer performance (both latency and scalability) that is comparable with the best state of the art locks, while at the same time Hapax Locks impose fewer constraints and dependencies on the ambient runtime environment, making them particularly easy to integrate or retrofit into existing systems or under existing application programming interfaces Of particular note, no pointers shift or escape ownership between threads in our algorithm.
Source:https://arxiv.org/abs/2511.14608PreviousRetrofitting Service Dependency Discovery in Distributed SystemsNextFaster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
Related posts
BeeTalk 群主必备:AI 群管机器人 AIGB 免费解决垃圾信息问题
0dev.to AI
I Open-Sourced a Free YouTube Shorts Factory. The Money Isn't in the Shorts.
0dev.to AI
Priced per TB/s, the H200 beats the H100 at 6 of 7 providers
0dev.to Python
Daily Dose of DevOps — Telemetry design: for platform operations teams
0dev.to DevOps

Israeli startup 42AI, which is developing a "behavioral world model" that tries to predict human behavior, emerges from stealth with a $62.5M seed (Ram Iyer/TechCrunch)
0Techmeme

Anthropic confirms new Claude Code limits "to steer it away from recreating someone else's specific game", saying IP infringement violates its usage policy (Bruno Ferreira/Tom's Hardware)
0Techmeme