Moran Tzafrir
Tel Aviv University, Ramat Aviv 69978, Israel
-
Flat combining and the synchronization-parallelism tradeoff
SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallel Algorithms and Architectures, 2010 – SPAA
bibtex -
Hopscotch Hashing
Distributed Computing, 22nd International Symposium, DISC 2008, vol. 5218,2008 – DISC
We present a new class of resizable sequential and concurrent hash map algorithms directed at both uni-processor and multicore machines. The new hopscotch algorithms are based on a novel hopscotch multi-phased probing and displacement technique that ...
bibtex -
Brief announcement: view transactions: transactional model with relaxed consistency checks
29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, 2010 – PODC
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory but may commit in a different snapshot. They are therefore simpler to ...
bibtex -
Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method
Distributed Computing, 23rd International Symposium, DISC 2009, vol. 5805,2009 – DISC
bibtex -
Scalable Flat-Combining Based Synchronous Queues
Distributed Computing, 24th International Symposium, DISC 2010, vol. 6343,2010 – DISC
bibtex
