Delaunay Triangulation with Transactions and Barriers

Scott, Michael L.; Spear, Michael; Dalessandro, Luke; Marathe, Virendra J.

doi:10.1109/iiswc.2007.4362186

Cited by 48 publications

(32 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When there are mostly finds, the path length to a representative becomes one, and there the COP and STM have the same overhead and performance. However, in applications, usually there is a burst of unions when a new network structure is constructed and then the structure becomes read only, where instrumentation can be eliminated by a barrier [14]. Thus, the high contention scenario seems more important.…”

Section: Cop Union Findmentioning

confidence: 99%

Towards Consistency Oblivious Programming

Afek

Avni

Shavit

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.It is well known that guaranteeing program consistency when accessing shared data comes at the price of degraded performance and scalability. This paper initiates the investigation of consistency oblivious programming (COP). In COP, sections of concurrent code that meet certain criteria are executed without checking for consistency. However, checkpoints are added before any shared data modification to verify the algorithm was on the right track, and if not, it is re-executed in a more conservative and expensive consistent way. We show empirically that the COP approach can enhance a software transactional memory (STM) framework to deliver more efficient concurrent data structures from serial source code. In some cases the COP code delivers performance comparable to that of more complex fine-grained structures.

show abstract

Section: Cop Union Findmentioning

confidence: 99%

Towards Consistency Oblivious Programming

Afek

Avni

Shavit

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In some applications, program structure, such as barriers and thread join points, ensures that all threads agree that a datum is public or private [16]. Since these phase boundaries are ordered globally, and with respect to < t , no additional instrumentation is required for correctness on acquiring and releasing transactions.…”

Section: Phased Privatizationmentioning

confidence: 99%

Ordering-Based Semantics for Software Transactional Memory

Spear

Dalessandro

Marathe

et al. 2008

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

It has been widely suggested that memory transactions should behave as if they acquired and released a single global lock. Unfortunately, this behavior can be expensive to achieve, particularly whenas in the natural publication/privatization idiom-the same data are accessed both transactionally and nontransactionally. To avoid overhead, we propose selective strict serializability (SSS) semantics, in which transactions have a global total order, but nontransactional accesses are globally ordered only with respect to explicitly marked transactions. Our definition of SSS formally characterizes the permissible behaviors of an STM system without recourse to locks. If all transactions are marked, then SSS, singlelock semantics, and database-style strict serializability are equivalent.We evaluate several SSS implementations in the context of a TL2-like STM system. We also evaluate a weaker model, selective flow serializability (SFS), which is similar in motivation to the asymmetric lock atomicity of Menon et al. We argue that ordering-based semantics are conceptually preferable to lock-based semantics, and just as efficient.

show abstract

“…For example, Scott et al [34] describe the use of four varieties of pointers which guard accesses to transactional objects. Two of these pointer types, sh_ptr<T> and un_ptr<T>, denote transactionally shared and transactionally private data, respectively.…”

Section: Exploiting Privatization 431 Prior Tm Privatization Approamentioning

confidence: 99%