1 citations · 1 across the 3 of their papers we have counts for
3 papers · 1 filter
Proving Highly-Concurrent Traversals Correct
Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea +4
Modern highly-concurrent search data structures, such as search trees, obtain multi-core scalability and performance by having operations traverse the data structure without any sy…
Privatization-Safe Transactional Memories (Extended Version)
Artem Khyzha, Hagit Attiya, Alexey Gotsman
Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often wou…
Safe Privatization in Transactional Memory
Artem Khyzha, Hagit Attiya, Alexey Gotsman +1
Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often wou…