About this document
Competitive Algorithms for Transactional Memory by moumitachatterji is a document available to read on EtoBox.
1) The document presents two new polynomial time contention management algorithms for transactional memory workloads that are balanced. 2) The first algorithm, called Clairvoyant, is √s-competitive for balanced workloads where the number of writes is a constant fraction of total operations. It requires knowledge of the conflict graph. 3) The second algorithm, called Non-Clairvoyant, is √slogn-competitive for balanced workloads, without requiring the conflict graph. 4) These algorithms improve upon the pre
- Author
- moumitachatterji
- Language
- EN