Transactional Memory for Smalltalk Concurrent Programming Problems …

Short Description
for Smalltalk. Lukas Renggli. Oscar Nierstrasz. Software Composition Group. University of Bern. Concurrent Programming. Semaphore forMutualExclusion …

Website: www.lukas-renggli.ch | Filesize: 193kb

Content
Transactional Memory
for Smalltalk
Lukas Renggli
Oscar Nierstrasz
Software Composition Group
University of Bern
Concurrent Programming
Semaphore forMutualExclusion
RecursionLock new
Mutex new
Problems
Deadlocks
Starvation
Priority Inversion
Complexity
Software
Transactional Memory
Programming
with Transactions
Lock Based
tree := BTree new.
lock := Semaphore forMutualExclusion.
” writing ”
lock critical: [ tree at: #a put: 1 ].
” reading ”
lock critical: [ tree at: #a ].Transactional
executed as
whole or has
no effect
runs in
isolation
applied
atomically
tree := BTree new.
” writing ”
[ tree at: #a put: 1 ] atomic.
” reading ”
tree at: #a.
Inside Transactions
Implementation in Smalltalk
Lazy code transformation
Method annotations
Context dependent code execution
Static Model
selector
parseTree
CompiledMethod
selector
*
methods
/selector
/parseTree
AtomicMethod
atomicMethod
1
method
1
name
superclass
subclasses
instanceVariables
Class
0..1
Code Transformation
Message Sends
Instance Variables
Variable Bindings…