SHF: Small: Collaborative Research: PEGASUS: ProgrEss GuAranteeS for Universal tranSactions

多核系统的软件可扩展性和可靠性是一个迫切需要解决的关键问题。事务处理是一种很有前途的编程模型，可用于跨许多领域（包括科学和应用软件）开发并行应用程序，它简化了正确并发软件的开发。该项目将开发克服当前许多限制的事务技术，并将探索在支持事务的系统上优化这些技术。智力上的优点是开发了在有或没有硬件支持事务的系统上构建事务数据结构的新技术。该项目将为具有进度保证的事务处理创建第一种方法。该项目的更广泛意义和重要性在于为工业界提供一套原型数据结构和编程技术，以进一步提高当前和未来多核系统上软件的可靠性和性能。该项目还将发展系统编程方面的关键人力资源。该项目将带来一些基本和实际的成果。事务已被认为是基于锁的系统的一个有前途的替代方案。然而，当前在软件或硬件中实现的事务有不同的缺点，其中最根本的缺点是缺乏进度保证。为了克服这个问题，这项工作进一步发展了基于无锁技术的事务性数据结构的概念，从而保证了进度。该项目还将扩展可交换事务对各种数据结构类型的适用性，包括常用的链接和连续内存数据结构。该项目利用事务性硬件来加速常见案例的执行，并通过对一组重要容器进行原型设计来演示其适用性。最后，本项目将对结果进行评估

Software scalability and reliability on multi-core systems is a crucial and urgent issue that needs to be addressed. Transactional processing is a promising programming model for developing parallel applications across many domains, including scientific and application software, that simplifies the development of correct concurrent software. This project will develop transactional techniques that overcome many current limitations, and it will explore the optimization of these techniques on systems with support for transactions. The intellectual merits are the development of novel techniques for constructing transactional data structures on systems with and without hardware support for transactions. The project will create a first approach for transactional processing with progress guarantees. The project's broader significance and importance are to make accessible to the industry a set of prototype data structures and programming techniques that furthers the reliability and performance of software on current and future multi-core systems. The project will also develop critical human resources in systems programming. The project will lead to a number of fundamental and practical outcomes. Transactions have been recognized as a promising alternative to lock-based systems. However, transactions as currently implemented in software or hardware have different drawbacks, with the absence of a progress guarantee being the most fundamental. To overcome this problem, this work further develops the notion of transactional data structures that are based on lock-free techniques, thereby guaranteeing progress. The project will also extend the applicability of commutable transactions to various data structure types including commonly used linked and contiguous memory data structures. The project harnesses transactional hardware to accelerate the execution of common cases and demonstrates the applicability by prototyping a set of important containers. Finally, this project will evaluate the outcome against