אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב
יום חמישי, 02.05.2013, 12:30
We present an automated approach to concurrency control based on a restricted version of atomic sections that addresses a common and frequent need: the need to compose multiple atomic ADT operations into a new atomic operation.
Our approach aims to use and exploit the semantics of ADT operations to obtain specialized concurrency control solutions that can perform better than generic approaches. This is achieved by implementing ADT-specific locking, and then using an algorithm that automatically ensures atomicity and deadlock-freedom by adding calls to ADTs locking. We present the conditions required by such ADT-specific locking, and describe the automatic static algorithm. Our approach is based on pessimistic concurrency control, and does not require the use of rollbacks.
We show that our approach can handle real-life multi-threaded programs; and show that the resultant synchronization is scalable and outperforms common alternative approaches.
This is a joint work with G. Ramalingam, Mooly Sagiv, and Eran Yahav.