Towards a Universal Construction for Transaction-Based Multiprocess Programs

Abstract

The aim of a Software Transactional Memory (STM) system is to discharge the programmer from the explicit management of synchronization issues. The programmer's job resides in the design of multiprocess programs in which processes are made up of transactions, each transaction being an atomic execution unit that accesses concurrent objects. The important point is that the programmer has to focus her/his efforts only on the parts of code which have to be atomic execution units without worrying on the way the corresponding synchronization has to be realized. Non-trivial STM systems allow transactions to execute concurrently and rely on the notion of commit/abort of a transaction in order to solve their conflicts on the objects they access simultaneously. In some cases, the management of aborted transactions is left to the programmer. In other cases, the underlying system scheduler is appropriately modified or an underlying contention manager is used in order that each transaction be ("practically always" or with high probability) eventually committed. This paper presents a deterministic STM system in which (1) every invocation of a transaction is executed exactly once and (2) the notion of commit/abort of a transaction remains unknown to the programmer. This system, which imposes restriction neither on the design of processes nor or their concurrency pattern, can be seen as a step in the design of a deterministic universal construction to execute transaction-based multiprocess programs on top of a multiprocessor. Interestingly, the proposed construction is lock-free (in the sense that it uses no lock).

Brief announcement

“…Several additional properties have been addressed in [2,9]. The notion of a universal construction has also been investigated in the context of transactional memories (e.g., [6,7,15,16,23] to cite a few).…”

A practical wait-free simulation for lock-free data structures

“…Intuitively, parallelizable methods can only execute a finite number of CASes while no owner CASes are exeucted 6 . For example, in the normalized form of Harris's linked list, given in Section 6, parallelizable methods can only execute physical deletions of logically deleted nodes.…”

Solo-Fast Universal Constructions for Deterministic Abortable Objects

“…Also transactional memory is not aware of the sequential code embedded in a transaction. A hybrid approach between transactional memory and universal constructions has been presented by Crain et al [6]. Their solution assumes that no failures occur.…”