AF:Small: Foundations of Transactional Memory Scheduling

AF:Small：事务内存调度的基础

• 批准号: 1320835
• 负责人: Konstantin Busch
• 金额: $ 36.59万
• 依托单位: Louisiana State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2013
• 资助国家: 美国
• 起止时间: 2013-09-01 至 2018-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1320835&HistoricalAwards=false
• 关键词: AF; Small; Foundations; Transactional; Memory

Multi-core computer architectures offer unprecedented performance benefits and present new challenges for the efficient synchronization of concurrent computations. Transactional memory is a prominent programming model that simplifies the synchronization of shared memory accesses, and avoids the complications of fine-grained locking mechanisms. A memory transaction represents a sequence of (read/write) shared memory operations that need to be performed atomically by a computation thread. A transaction either commits, or aborts in case of conflicts with other transactions that concurrently access the same shared resources. This project aims to design, develop, and analyze contention managers that schedule efficiently memory transactions in a variety of systems. The goal is to provide schedulers that have provable formal performance guarantees and at the same time are practically efficient; thus, bridging the gap between theory and practice that currently appears in the literature.The project considers a wide range of distributed systems, including tightly-coupled systems such as multi-core processors, and larger scale systems such as distributed networked processors. One of the main objectives is to provide scheduling algorithms which scale gracefully with the various system sizes and complexities. In order to fulfill this objective, this work proposes new analytical techniques to obtain good formal bounds with appropriate performance metrics, and also conducts experimental evaluations in real world workloads to obtain good performance in practical scenarios. The project establishes foundations for investigating the performance of transactional memory systems, and also provides analytical tools to the research community for exploring transactional memory to its full potential. The proposed research impacts the larger computing community because it affects the efficiency of distributed and parallel programs running on widely used distributed and multi-core systems.

多核计算机体系结构提供了前所未有的性能优势，同时也为并行计算的高效同步提出了新的挑战。事务性内存是一种突出的编程模型，它简化了共享内存访问的同步，并避免了细粒度锁定机制的复杂性。内存事务表示需要由计算线程自动执行的一系列（读/写）共享内存操作。在与并发访问相同共享资源的其他事务发生冲突的情况下，事务要么提交，要么中止。该项目旨在设计、开发和分析争用管理器，以便在各种系统中有效地调度内存事务。目标是提供具有可证明的正式性能保证的调度器，同时具有实际的效率；因此，弥合理论与实践之间的差距，目前出现在文献。该项目考虑了广泛的分布式系统，包括紧密耦合的系统，如多核处理器，以及更大规模的系统，如分布式网络处理器。其中一个主要目标是提供调度算法，它可以随不同的系统大小和复杂性而优雅地扩展。为了实现这一目标，本工作提出了新的分析技术，以获得具有适当性能指标的良好形式界限，并在现实工作负载中进行实验评估，以在实际场景中获得良好的性能。该项目为研究事务性内存系统的性能奠定了基础，并为研究社区提供了分析工具，以探索事务性内存的全部潜力。所提出的研究影响了更大的计算社区，因为它影响了在广泛使用的分布式和多核系统上运行的分布式和并行程序的效率。