Sökning: "Semantic Relaxation"
Hittade 1 uppsats innehållade orden Semantic Relaxation.
1. Relaxed Priority Queue & Evaluation of Locks
Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : We present a new, lock-free and concurrent priority queue, utilizing some ideas from [1] by Rukundo et al., that relaxes the traditional sequential semantics of the delete_min operation to achieve better scalability and performance. LÄS MER
Resultatsidor:
1