检索结果-内蒙古大学图书馆

Thread and Data Mapping in software transactional memory: an Overview

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2025年第3期53卷 1-21页

作者： Pasqualin, Douglas Pereira Diener, Matthias Du Bois, Andre Rauber Pilla, Mauricio Lima Univ Fed Rio Grande do Sul Grad Program Comp Sci PPGC BR-91501570 Porto Alegre RS Brazil Univ Illinois Champaign IL 61801 USA

In current microarchitectures, due to the complex memory hierarchies and different latencies on memory accesses, thread and data mapping are important issues to improve application performance. software transactional memory (STM) is an abstraction used for thread synchronization, replacing the use of locks in parallel programming. Regarding thread and data mapping, STM presents new challenges and mapping opportunities, since (1) STM can use different conflict detection and resolution strategies, making the behavior of the application less predictable, and;(2) the STM runtime has precise information about shared data and the intensity with each thread accesses them. These unique characteristics provide many opportunities for low-overhead, but precise statistics to guide mapping strategies for STM applications. The main objective of this paper is to survey the existing work about thread and data mapping that uses solely information gathered from the STM runtime to guide thread and data mapping decisions. We also discuss future research directions within this research area.

关键词： software transactional memory Thread mapping Data mapping Communication

来源：评论

学校读者我要写书评

暂无评论

software transactional memory, OpenMP and Pthread Implementations of the Conjugate Gradients Method - A Preliminary Evaluation 1

引用

10th International Conference on High Performance Computing for Computational Science (VECPAR)

作者： Heuveline, Vincent Janko, Sven Karl, Wolfgang Rocker, Bjoern Schindewolf, Martin Karlsruhe Inst Technol Engn Math & Comp Lab Fritz Erler Str 23 D-76133 Karlsruhe Germany Karlsruhe Inst Technol Chair Comp Architecture & Parallel Proc D-76131 Karlsruhe Germany Robert Bosch GmbH Corp Sector Res & Adv Engn D-70839 Gerlingen Germany

ISBN: (数字)9783642387180

ISBN: (纸本)9783642387180;9783642387173

This paper shows the runtime and cache-efficiency of parallel implementations of the Conjugate Gradients Method based on the three paradigms software transactional memory (STM), OpenMP and Pthreads. While the two last named concepts are used to manage parallelization as well as synchronization, STM was designed to handle only the latter. In our work we disclose that an improved cache-efficiency does not necessarily lead to a better execution time because the execution time is dominated by the thread wait time at the barriers.

关键词： software transactional memory OpenMP Pthreads Conjugate Gradients Method Case Study

来源：评论

学校读者我要写书评

暂无评论

Compiler and runtime techniques for software transactional memory optimization

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2009年第1期21卷 7-23页

作者： Wu, Peng Michael, Maged M. von Praun, Christoph Nakalke, Takuya Bordawekar, Rajesh Cain, Harold W. Cascaval, Calin Chatterjee, Siddhartha Chiras, Stefame Hou, Rui Mergen, Mark Shen, Xiaowei Spear, Michael F. Wang, Hua Yong Wang, Kun IBM Res Corp Yorktown Hts NY USA Univ Rochester Rochester NY USA

software transactional memory (STM) systems are an attractive environment to evaluate optimistic concurrency. We describe our experience of supporting and optimizing an STM system at both the managed runtime and compiler levels. We describe the design policies of our STM system and the statistics collected by the runtime to identify performance bottlenecks and guide tuning decisions. We present an initial work on supporting automatic instrumentation of the STM primitives for C/C++ and Java programs in the IBM XL compiler and J9 Java virtual machine. We evaluate and discuss the performance of several transactional programs running on our system. Copyright (c) 2008 John Wiley & Sons, Ltd.

关键词： transactional memory software transactional memory compiler optimization optimistic concurrency

来源：评论

学校读者我要写书评

暂无评论

Remote Transaction Commit: Centralizing software transactional memory Commits

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第7期65卷 2228-2240页

作者： Hassan, Ahmed Palmieri, Roberto Ravindran, Binoy Virginia Tech Dept Elect & Comp Engn Blacksburg VA 24060 USA

software transactional memory (STM) has recently emerged as a promising synchronization abstraction for multicore architectures. State-of-the-art STM algorithms, however, suffer from performance challenges due to contention and spinning on locks during the transaction commit phase. In this paper, we introduce Remote Transaction Commit (or RTC), a mechanism for executing commit phases of STM transactions. RTC dedicates server cores to execute transactional commit phases on behalf of application threads. This approach has two major benefits. First, it decreases the overheads of spinning on locks during commit, such as the number of cache misses, blocking of lock holders, and CAS operations. Second, it enables exploiting the benefits of coarse-grained locking algorithms (simple and fast lock acquisition, reduced false conflicts) and bloom filter-based algorithms (concurrent execution of independent transactions). Our experimental study on a 64-core machine with four sockets shows that RTC solves the problem of performance degradation due to spin locking on both micro-benchmarks (red-black trees), and macro-benchmarks (STAMP), especially when the commit phase is relatively long and when thread contention increases.

关键词： software transactional memory remote commit transactions dependency

来源：评论

学校读者我要写书评

暂无评论

Purge-Rehab: Eager software transactional memory with High Performance Under Contention

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2016年第6期44卷 1359-1383页

作者： Siddique, Abubakar Ansari, Mohammad Lujan, Mikel Umm Al Qura Univ Sci & Technol Unit Mecca Saudi Arabia Umm Al Qura Univ Dept Comp Sci Mecca Saudi Arabia Univ Manchester Sch Comp Sci Manchester Lancs England

transactional memory is a programming model that attempts to make parallel programming easier. transactional memory uses either eager (at encounter time) or lazy (at commit time) validation to check for conflicting accesses between concurrent transactions, and researchers have been divided over which approach is best. Despite this, there is little work in the literature evaluating their comparative performance. One exploration of this topic using microbenchmarks found that lazy outperforms eager and increases its advantage as contention rises. Furthermore, eager was prone to livelock when accesses were irregular, which resulted in starvation and low throughput. We revisit the comparative performance of eager and lazy under contention using a larger set of microbenchmarks, more complex benchmarks from STAMP, and against multiple state-of-the-art STMs: word-based RSTM, TinySTM and SwissTM. We validate earlier findings that eager suffers from livelock, especially when accesses are irregular. This inspired Purge-Rehab: a lightweight mechanism for controlling transaction restarts in eager validation to reduce livelock and thus improve throughput and reduce starvation. Compared to lazy validation, Purge-Rehab achieves higher performance in five benchmarks, similar in four, and is lower in only one, showing that eager validation can achieve high performance under contention. Purge-Rehab is implemented in word-based RSTM, but is applicable to any eager STM.

关键词： software transactional memory Eager validation Lazy validation Conflict detection Contention management Livelock Starvation

来源：评论

学校读者我要写书评

暂无评论

Non-preemptive and SRP-based fully-preemptive scheduling of real-time software transactional memory

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2015年第10期61卷 553-566页

作者： Barros, Antonio Pinho, Luis Miguel Yomsi, Patrick Meumeu ISEP IPP CISTER Res Ctr P-4200072 Oporto Portugal

Recent embedded processor architectures containing multiple heterogeneous cores and non-coherent caches renewed attention to the use of software transactional memory (STM) as a building block for developing parallel applications. STM promises to ease concurrent and parallel software development, but relies on the possibility of abort conflicting transactions to maintain data consistency, which in turns affects the execution time of tasks carrying transactions. Because of this fact the timing behaviour of the task set may not be predictable, thus it is crucial to limit the execution time overheads resulting from aborts. In this paper we formalise a FIFO-based algorithm to order the sequence of commits of concurrent transactions. Then, we propose and evaluate two non-preemptive and one SRP-based fully-preemptive scheduling strategies, in order to avoid transaction starvation. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Real-time systems Synchronization mechanisms software transactional memory Non-preemptive scheduling Stack Resource Protocol Cache non-coherency Multi-core platforms Contention management

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a fully transparent partial abort support for software transactional memory

引用

software-PRACTICE & EXPERIENCE 2022年第11期52卷 2456-2475页

作者： Pellegrini, Alessandro Di Sanzo, Pierangelo Piccione, Andrea Quaglia, Francesco Univ Roma Tor Vergata DICII Rome Italy Univ Aquila DISIM Laquila Italy Sapienza Univ Rome DIAG Rome Italy

software transactional memory (STM) provides synchronization support to ensure atomicity and isolation when threads access shared data in concurrent applications. With STM, shared data accesses are encapsulated within transactions automatically handled by the STM layer. Hence, programmers are not requested to use code-synchronization mechanisms explicitly, like locking. In this article, we present our experience in designing and implementing a partial abort scheme for STM. The objective of our work is threefold: (1) enabling STM to undo only part of the transaction execution in the case of conflict, (2) designing a scheme that is fully transparent to programmers, thus also allowing to run existing STM applications without modifications, and (3) providing a scheme that can be easily integrated within existing STM runtime environments without altering their internal structure. The scheme we designed is based on automated software instrumentation, which injects into the application capabilities to undo the required portions of transaction executions. Further, it can correctly undo also non-transactional operations executed on the stack and the heap during a transaction. This capability allows programmers to write transactional code without concerns about the side effects of aborted transactions on both shared and thread-private data. We integrated and evaluated our partial abort scheme within the TinySTM open-source library. We analyze the experimental results we achieved with common STM benchmark applications, focusing on the advantages and disadvantages of the proposed solutions for implementing our scheme's different components. Hence, we highlight the appropriate choices and possible solutions to improve partial abort schemes further.

关键词： partial abort software transactional memory static binary instrumentation transactional memory

来源：评论

学校读者我要写书评

暂无评论

Weighted adaptive concurrency control for software transactional memory

引用

JOURNAL OF SUPERCOMPUTING 2014年第3期68卷 1027-1047页

作者： Ansari, Mohammad Umm Al Qura Univ Dept Comp Sci Mecca Saudi Arabia

transactional memory programs may have dynamic available parallelism, which is defined as the number of transactions that can be committed concurrently. Prior work presented adaptive concurrency control, which adapts the number of active threads at runtime, and thus the number of concurrently executing transactions, based on available parallelism. Reducing threads when available parallelism is low, and vice versa, improved speedup and reduced wasted work (in aborted transactions). However, prior work did not consider the case where individual threads exhibit dynamic available parallelism. Deactivating threads with low available parallelism, and vice versa, may improve speedup and reduce wasted work further. This paper introduces weighted adaptive concurrency control to exploit the variance in available parallelism between threads. Four algorithms are designed, implemented, and evaluated. They improve speedup and reduce wasted work over prior non-weighted algorithms in applications whose threads exhibit such variance, while maintaining performance parity in applications whose threads do not.

关键词： software transactional memory Adaptive concurrency control Auto tuning Performance evaluation Wasted work

来源：评论

学校读者我要写书评

暂无评论

High-throughput state-machine replication using software transactional memory

引用

JOURNAL OF SUPERCOMPUTING 2016年第11期72卷 4379-4398页

作者： Zhao, Wenbing Yang, William Zhang, Honglei Yang, Jack Luo, Xiong Zhu, Yueqin Yang, Mary Luo, Chaomin Cleveland State Univ Dept Elect Engn & Comp Sci Cleveland OH 44115 USA Univ Texas Austin Texas Adv Comp Ctr 10100 Burnet Rd Austin TX 78758 USA Agilysys Inc Bellevue WA USA Massachusetts Gen Hosp Div Biostat & Biomath Boston MA 02114 USA Harvard Med Sch Boston MA 02114 USA Univ Sci & Technol Beijing Sch Comp & Commun Engn Beijing 100083 Peoples R China Minist Land & Resources Res Dev Ctr China Geol Survey Key Lab Geol Informat Technol Beijing 100037 Peoples R China Univ Arkansas Joint Bioinformat Program George Washington Donaghey Coll Engn & Informat T Dept Informat Sci 2801 S Univ Ave Little Rock AR 72204 USA Univ Arkansas Med Sci 2801 S Univ Ave Little Rock AR 72204 USA Univ Detroit Mercy Dept Elect & Comp Engn Detroit MI 48221 USA

State-machine replication is a common way of constructing general purpose fault tolerance systems. To ensure replica consistency, requests must be executed sequentially according to some total order at all non-faulty replicas. Unfortunately, this could severely limit the system throughput. This issue has been partially addressed by identifying non-conflicting requests based on application semantics and executing these requests concurrently. However, identifying and tracking non-conflicting requests require intimate knowledge of application design and implementation, and a custom fault tolerance solution developed for one application cannot be easily adopted by other applications. software transactional memory offers a new way of constructing concurrent programs. In this article, we present the mechanisms needed to retrofit existing concurrency control algorithms designed for software transactional memory for state-machine replication. The main benefit for using software transactional memory in state-machine replication is that general purpose concurrency control mechanisms can be designed without deep knowledge of application semantics. As such, new fault tolerance systems based on state-machine replications with excellent throughput can be easily designed and maintained. In this article, we introduce three different concurrency control mechanisms for state-machine replication using software transactional memory, namely, ordered strong strict two-phase locking, conventional timestamp-based multiversion concurrency control, and speculative timestamp-based multiversion concurrency control. Our experiments show that speculative timestamp-based multiversion concurrency control mechanism has the best performance in all types of workload, the conventional timestamp-based multiversion concurrency control offers the worst performance due to high abort rate in the presence of even moderate contention between transactions. The ordered strong strict two-phase locking mechanism

关键词： State-machine replication software transactional memory Ordered strong strict two-phase locking Multiversion concurrency control One-copy serializability

来源：评论

学校读者我要写书评

暂无评论

Convoider: A Concurrency Bug Avoider Based on Transparent software transactional memory

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2020年第1期48卷 32-60页

作者： Yu, Zhen Zuo, Yu Zhao, Yong Guizhou Educ Univ Dept Math & Comp Sci Guiyang 550018 Peoples R China Guizhou Educ Univ Big Data Sci & Intelligent Engn Res Inst Guiyang 550018 Peoples R China

software transactional memory is an effective mechanism to avoid concurrency bugs in multi-threaded programs. However, two problems hinder the adoption of traditional such systems in wild world: high human cost for equipping programs with transaction functionality and low compatibility with I/O calls and conditional variables. This paper presents Convoider to try to solve these problems. By intercepting inter-thread operations and designating code among them as transactions in each thread, Convoider automatically transactionalizes target programs without any source code modification and recompiling. By saving/restoring stack frames and CPU registers on beginning/aborting a transaction, Convoider makes execution flow revocable. By turning threads into processes, leveraging virtual memory protection and customizing memory allocation/deallocation, Convoider makes memory manipulations revocable. By maintaining virtual file systems and redirecting I/O operations onto them, Convoider makes I/O effects revocable. By converting lock/unlock operations to no-ops, customizing signal/wait operations on condition variables and committing memory changes transactionally, Convoider makes deadlocks, data races and atomicity violations impossible. Experimental results show that Convoider succeeds in transparently transactionalizing twelve real-world applications and perfectly avoid 94% of thirty-one concurrency bugs used in our experiments. This study can help efficiently transactionalize legacy multi-threaded applications and effectively improve the runtime reliability of them.

关键词： software transactional memory Concurrency bug avoidance Deadlock Data race Atomicity violation Order violation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：