Good programming in transactional memory: game theory meets multicore architecture

DOI10.1016/J.TCS.2010.09.008zbMATH Open1221.68060OpenAlexW2082080508MaRDI QIDQ553350FDOQ553350

Authors: Raphael Eidenbenz, Roger Wattenhofer 

Publication date: 27 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.008

Recommendations

• Good programming in transactional memory. Game theory meets multicore architecture
• Transactional Memory: Glimmer of a Theory
• Toward a theory of transactional contention managers
• \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores
• Transactional memory

zbMATH Keywords

game theoryconcurrencymechanism designhuman factorstransactional memorycontention managementmulticore architecture

Mathematics Subject Classification ID

Applications of game theory (91A80) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• The price of anarchy of finite congestion games
• Toward a theory of transactional contention managers
• Transactional contention management as a non-clairvoyant scheduling problem
• Exact Price of Anarchy for Polynomial Congestion Games
• Bounds on contention management algorithms

Cited In (1)

• Good programming in transactional memory. Game theory meets multicore architecture

This page was built for publication: Good programming in transactional memory: game theory meets multicore architecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553350)