[PDF][PDF] Formal verification of local and distributed python software transactional memories

M Popovic, M Popovic, S Ghilezan… - Rev. Roum. Sci. Techn …, 2019 - revue.elth.pub.ro
Both local and distributed Python STMs are targeting a wide range of application domains,
including critical infrastructures, such as cyber-physical systems, internet of things, etc., and …

Conflict abstractions and shadow speculation for optimistic transactional objects

T Dickerson, E Koskinen, P Gazzillo… - Asian Symposium on …, 2019 - Springer
Concurrent data structures implemented with software transactional memory (STM) perform
poorly when operations which do not conflict in the definition of the abstract data type …

Advances in High Performance Computing Through Concurrent Data Structures and Predictive Scheduling

KM Lamar - 2024 - stars.library.ucf.edu
Abstract Modern High Performance Computing (HPC) systems are made up of thousands of
server-grade compute nodes linked through a high-speed network interconnect. Each node …

Fast snapshottable concurrent braun heaps

TD Dickerson - arXiv preprint arXiv:1705.06271, 2017 - arxiv.org
This paper proposes a new concurrent heap algorithm, based on a stateless shape property,
which efficiently maintains balance during insert and removeMin operations implemented …

Formalno Verifikovana Distribuirana Softverska Transakciona Memorija Otporna Na Otkaze

M Popović - 2021 - search.proquest.com
У дисертацији је развијена дистрибуирана софтверска трансакциона меморија у
језику Пајтон, која је формално верификована, отпорна на отказе, детерминистичка, и …

[PDF][PDF] Transactional Memory in Rust

T Lively - 2018 - dash.harvard.edu
Transactional memory is a concurrency primitive that is easier to reason about and therefore
less error prone than locking, but traditional software implementations have been …

Formalno verifikovana distribuirana softverska transakciona memorija otporna na otkaze

M Popović - Универзитет у Новом Саду, 2021 - nardus.mpn.gov.rs
U disertaciji je razvijena distribuirana softverska transakciona memorija u jeziku Pajton, koja
je formalno verifikovana, otporna na otkaze, deterministička, i implementirana kao proširenje …

Brief announcement: Proust: A design space for highly-concurrent transactional data structures

T Dickerson, P Gazzillo, M Herlihy… - Proceedings of the ACM …, 2017 - dl.acm.org
Most STM systems are poorly equipped to support libraries of concurrent data structures.
One reason is that they typically detect conflicts by tracking transactions' read sets and write …

[引用][C] Introducing Semantics to Transactional Memory

A Fathy - 2018