Brief announcement: selfishness in transactional memory

In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI), i.e., writing efficient code for the overall system coincides with writing code that optimizes an individual program's performance. By implementing a selfish strategy, we show that under most contention managers (CM) proposed in the literature so far, TM systems are not GPI compatible, whereas a simple randomized CM is GPI compatible. Categories and Subject Descriptors: D.4.1 [Process Management]: Concurrency, Scheduling, Threads; J.4 [Social and Behavioral Sciences] Economics General Terms: Performance, Human Factors, Experimentation

• Type: Conference
• Year: 2009
• Where: SPAA
• Authors: Raphael Eidenbenz, Roger Wattenhofer
• Keywords: Multicore Transactional Memory, Parallel Computing, Selfish Programmers, Simple Randomized Cm, SPAA 2009