ProPS: A Progressively Pessimistic Scheduler for Software Transactional Memory.

Lecture Notes in Computer Science(2014)

引用 9|浏览7
暂无评分
摘要
Software Transactional Memory (STM) is one promising abstraction to simplify the task of writing highly parallel applications. Nonetheless, in workloads lacking enough parallelism, STM's optimistic approach to concurrency control can adversely degrade performance as transactions abort and restart often. In this paper, we describe a new scheduling-based solution to improve STM's performance in high-contention scenarios. Our Progressively Pessimistic Scheduler (ProPS) uses a fine-grained scheduling mechanism that controls the amount of concurrency in the system gradually as transactions abort and commit with success. Experimental results with the STMBench7 benchmark and the STAMP benchmark suite showed that current coarse-grained, conservative transaction schedulers are not suitable for workloads with long transactions, whereas ProPS is up to 40% faster than all other scheduling alternatives.
更多
查看译文
关键词
Performance,Software Transactional Memory,Transaction Conflict,Transaction Scheduling
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要