Efficient synchronization techniques for shared memory systems

Abstract

First, I would like to sincerely thank my supervisor Panagiota Fatourou for motivating and encouraging me during the entire period that I was conducting my PhD. I would also like to thank the members of my advisory committee, Vassilios Dimakopoulos and Leonidas Palios for their support. Many thanks to Dimitris Nikolopoulos for arranging the provision of access to some of the multi-core machines of the Department of Computer Science at Virginia Tech where I ran some of the experiments of this dissertation, and to Michael Scott for providing me access to the Rochester's Niagara 2 machine. I would also like to thank the rest of the members of my examination committee, Kostas Magoutis, Evaggelia Pitoura, and Apostolos Zarras. Special thanks go to my friends Spiros Agathos, Eytychia Datsika, Vasilis Kagias, Kostas Lillis, Thanos Mpiliris, Odysseas Petrocheilos, and Kostas Ramantas for supporting and encouraging me.Finally, I would like to thank Empirikion Foundation for the moral and financial support.

Lock Cohorting

“…Subsequently, Fatourou and Kallimanis [2012] and Kallimanis [2013] developed delegation schemes that are explicitly NUMA-aware, specifically the H-Synch construct. Hendler et al [2010] propose generalized flat-combining where the role of server is periodically handed over among client threads.…”