An efficient software transactional memory using commit-time invalidation

Gottschlich, Justin; Vachharajani, Manish; Siek, Jeremy G.

doi:10.1145/1772954.1772970

Cited by 36 publications

(40 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…STMs that use eager concurrency control for both reads and writes, including our Lark-TM, can guarantee not only livelock freedom but also starvation freedom, as long as they provide support for aborting either thread involved in a conflict (since this flexibility enables age-based contention management; Section 3.4) [23]. (An interesting related design is InvalSTM, which uses fully lazy concurrency control and allows a thread to abort another thread's transaction [22]. )…”

Section: Progress Guaranteesmentioning

confidence: 99%

Low-overhead software transactional memory with progress guarantees and strong semantics

Zhang

Huang

Cao

et al. 2015

Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

Software transactional memory offers an appealing alternative to locks by improving programmability, reliability, and scalability. However, existing STMs are impractical because they add high instrumentation costs and often provide weak progress guarantees and/or semantics.This paper introduces a novel STM called LarkTM that provides three significant features. (1) Its instrumentation adds low overhead except when accesses actually conflict, enabling low single-thread overhead and scaling well on low-contention workloads. (2) It uses eager concurrency control mechanisms, yet naturally supports flexible conflict resolution, enabling strong progress guarantees. (3) It naturally provides strong atomicity semantics at low cost.LarkTM's design works well for low-contention workloads, but adds significant overhead under higher contention, so we design an adaptive version of LarkTM that uses alternative concurrency control for high-contention objects.An implementation and evaluation in a Java virtual machine show that the basic and adaptive versions of LarkTM not only provide low single-thread overhead, but their multithreaded performance compares favorably with existing high-performance STMs.

show abstract

Section: Progress Guaranteesmentioning

confidence: 99%

Low-overhead software transactional memory with progress guarantees and strong semantics

Zhang

Huang

Cao

et al. 2015

Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

show abstract

“…Calciu et al present a novel hybrid transactional memory (HyTM), called Invyswell, that uses hardware transactions from Haswell's RTM in conjunction with software transactions from a heavily modified design of InvalSTM [22] , an STM designed to provide scalability and performance for large transactions with notable contention [20] . As our results show, Haswell's RTM performs best for small transactions with low contention, as it imposes no instrumentation overhead in fallback policies.…”

Section: Related Workmentioning

confidence: 99%

Study of hardware transactional memory characteristics and serialization policies on Haswell

et al. 2016

View full text Add to dashboard Cite

“…Before conducting further tests, it is necessary to test whether the proposed method is memory-intensive or not [16]. Here memory intensive means that the cheating detection process frequently occupies RAM, and insufficient free RAM would lead to aborted detection.…”

Section: B Memory-intensive Testmentioning

confidence: 99%

User-Based CPU Verification Scheme for Public Cloud Computing

Zheng

Tan

et al. 2013

2013 IEEE Sixth International Conference on Cloud Computing

View full text Add to dashboard Cite

Abstract-In this paper, a user-based CPU verification scheme is proposed for cloud cheating detection. In this scheme, a predefined computational task is constructed for the cloud to execute in our cheating detection process. Then we compare the difference of the actual execution time (recorded by the user) and the theoretical execution time, as to determine whether the cloud is cheating or not. A time-lock puzzle is introduced to construct the predefined computational task, so that the predefined computational task is guaranteed to be executed by the cloud. Our cheating detection process has a higher probability of detecting cloud cheating if using a larger predefined computational task, which in turn costs more time. Further analysis shows that, if the total detection time is limited, it is better to detect cloud cheating using small-scale and short-length cheating detecting processes multiple times, as opposed to large-scale and longlength processes a few times. Finally, the feasibility and validity of the proposed scheme is shown in the evaluations.

show abstract

An efficient software transactional memory using commit-time invalidation

Cited by 36 publications

References 26 publications

Low-overhead software transactional memory with progress guarantees and strong semantics

Low-overhead software transactional memory with progress guarantees and strong semantics

Study of hardware transactional memory characteristics and serialization policies on Haswell

User-Based CPU Verification Scheme for Public Cloud Computing

Contact Info

Product

Resources

About