Tootfinder

from my link log —
VBR: version based reclamation.
https://arxiv.org/abs/2107.13843
saved 2022-12-26 https://dotat.at/:/IVLGG.html

VBR: Version Based Reclamation
Safe lock-free memory reclamation is a difficult problem. Existing solutions follow three basic methods (or their combinations): epoch based reclamation, hazard pointers, and optimistic reclamation. Epoch-based methods are fast, but do not guarantee lock-freedom. Hazard pointer solutions are lock-free but typically do not provide high performance. Optimistic methods are lock-free and fast, but previous optimistic methods did not go all the way. While reads were executed optimistically, writes w…

dom: Animal dominance archive (2022)
Animal dominance interaction data published over a century of research. The archive contains 434 agonistic interaction datasets, totaling over 241,000 interactions. A directed edge (i,j) corresponds to an antagonist interaction between i (winner) and j (loser). If a 'weight' edge property map exists, it counts the number of such interactions.
This network has 6 nodes and 26 edges.
Tags: Social, Animal, Weighted

Over the past couple of nights I've been setting up my Mastodon server on a new Ubuntu 26.04 VM (The original server was set up using Digital Ocean's "One click install" on 20.04 back in 2022).
I feel like a teenager again, in a good way. I haven't had this much fun messing with computers in a long time.

dom: Animal dominance archive (2022)
Animal dominance interaction data published over a century of research. The archive contains 434 agonistic interaction datasets, totaling over 241,000 interactions. A directed edge (i,j) corresponds to an antagonist interaction between i (winner) and j (loser). If a 'weight' edge property map exists, it counts the number of such interactions.
This network has 12 nodes and 72 edges.
Tags: Social, Animal, Weighted

from my link log —
VBR: version based reclamation.
https://arxiv.org/abs/2107.13843
saved 2022-12-26 https://dotat.at/:/IVLGG.html

VBR: Version Based Reclamation
Safe lock-free memory reclamation is a difficult problem. Existing solutions follow three basic methods (or their combinations): epoch based reclamation, hazard pointers, and optimistic reclamation. Epoch-based methods are fast, but do not guarantee lock-freedom. Hazard pointer solutions are lock-free but typically do not provide high performance. Optimistic methods are lock-free and fast, but previous optimistic methods did not go all the way. While reads were executed optimistically, writes w…

from my link log —
NBR: neutralization based reclamation.
https://arxiv.org/abs/2012.14542
saved 2022-12-26 https://dotat.at/:/03IIM.html

NBR: Neutralization Based Reclamation
Safe memory reclamation (SMR) algorithms suffer from a trade-off between bounding unreclaimed memory and the speed of reclamation. Hazard pointer (HP) based algorithms bound unreclaimed memory at all times, but tend to be slower than other approaches. Epoch based reclamation (EBR) algorithms are faster, but do not bound memory reclamation. Other algorithms follow hybrid approaches, requiring special compiler or hardware support, changes to record layouts, and/or extensive code changes. Not all …