Sökning: onr:"swepub:oai:research.chalmers.se:494aa156-35b5-4c30-8f73-a5253251affc" >
The lock-free k-LSM...
The lock-free k-LSM relaxed priority queue
-
- Wimmer, M. (författare)
- Technische Universität Wien,Vienna University of Technology
-
- Gruber, J. (författare)
- Technische Universität Wien,Vienna University of Technology
-
- Träff, J.L. (författare)
- Technische Universität Wien,Vienna University of Technology
-
visa fler...
-
- Tsigas, Philippas, 1967 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
visa färre...
-
(creator_code:org_t)
- 2015-01-24
- 2015
- Engelska.
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - New York, NY, USA : ACM. - 0730-8566. ; 50:8, s. 277-278
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
http://arxiv.org/pdf...
-
https://research.cha...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We present a new, concurrent, lock-free priority queue that relaxes the delete-min operation to allow deletion of any of the ρ+1 smallest keys instead of only a minimal one, where ρ is a parameter that can be configured at runtime. It is built from a logarithmic number of sorted arrays, similar to log-structured merge-trees (LSM). For keys added and removed by the same thread the behavior is identical to a non-relaxed priority queue. We compare to state-of-the-art lock-free priority queues with both relaxed and non-relaxed semantics, showing high performance and good scalability of our approach.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Annan data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Other Computer and Information Science (hsv//eng)
Nyckelord
- Priority-queue
- Task-parallel programming
- Concurrent data structure relaxation
- Shared memory
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas