'Lock-based versus non-blocking algorithms'
Author
Madsen, Jesper
Term
10. Term
Education
Publication year
2006
Abstract
Dette speciale undersøger ydeevnen for en abstrakt datatype, implementeret på to måder: som en låsebaseret (lock‑based) og som en ikke‑blokerende (non‑blocking) algoritme. Gennem et ydelseseksperiment sammenligner vi varianterne for at afgøre, hvilken implementering der har den bedste ydeevne på den testede arkitektur. Resultaterne kan bruges som retningslinjer, når man skal vælge mellem låsebaserede og ikke‑blokerende implementeringer på den testede arkitektur.
This thesis evaluates the performance of an abstract data type (a conceptual data structure) implemented in two ways: as a lock‑based algorithm and as a non‑blocking algorithm. Through a performance experiment, we compare the variants to determine which implementation performs best on the tested architecture. The results offer guidelines for choosing between lock‑based and non‑blocking implementations on the tested architecture.
[This abstract was generated with the help of AI]
Documents