A Consistency Checking Optimization Algorithm for Memory-Intensive Transactions ; CU-CS-1049-08
نویسندگان
چکیده
Transactional memory (TM), a recent parallel programming concept, aims to simplify parallel programming while simultaneously maintaining performance benefits found in concurrent applications. Consistency checking, the manner in which memory conflicts are identified in transactional memory, is a critical aspect to TM system performance. We present a theoretical, analytical and empirical view of our novel consistency checking algorithm which is optimized for spatially wide transactional workloads. Initial tests show our algorithm yields super linear performance improvements over other alternatives as transaction size grows, resulting in performance gains between 5x − 250x for experimental benchmarks.
منابع مشابه
A Consistency Checking Optimization Algorithm for Memory-Intensive Transactions
Transactional memory (TM), a recent parallel programming concept, aims to simplify parallel programming while simultaneously maintaining performance benefits found in concurrent applications. Consistency checking, the manner in which memory conflicts are identified in transactional memory, is a critical aspect to TM system performance. We present a theoretical, analytical and empirical view of ...
متن کاملAn Intentional Library Approach to Lock-Aware Transactional Memory ; CU-CS-1048-08
Transactional memory (TM) has garnered significant interest as an alternative to existing concurrency methods due to its simplified programming model, natural composition characteristics and native support of optimistic concurrency. Yet, mutual exclusion locks are ubiquitous in existing parallel software due to their fast execution, inherent property for irreversible operations and long-standin...
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کاملExtending Contention Managers for User-Defined Priority-Based Transactions
Transactional memory (TM) contention management (CM) is the process of handling memory conflicts in transactions. Contention managers were first proposed as a way of separating transactional progress from correctness and to prevent transactional starvation. While significant work in the area of contention management has been done, most prior work has focused on preventing starvation through var...
متن کاملChoosing a Set of Partitions to Collect in a Connectivity-Based Garbage Collector ; CU-CS-958-03
Connectivity-Based Garbage Collection is a new family of garbage collection algorithms that are based on potential object connectivity properties. Objects are placed into partitions based on a static connectivity analysis. When the program needs memory, the collector can choose a set of partitions to do a garbage collection on. This choice should maximize the expected benefit in reclaimed memor...
متن کامل