Citation Context

... of versioning records [12], additional header words [13], or made 14programmer-visible changes to the object model to add levels of indirection between object references and current object contents =-=[16, 10, 23]-=-. • Runtime filtering. Not all unnecessary operations can be identified statically, so we add complementary runtime filtering – e.g. to remove updates to transaction-local objects. (Section 5). • Garb...

Citation Context

... in each word that may be accessed. For example, word-size values can only be manipulated by fragmenting them across multiple locations with an attendant space cost [23]. More recently, Herlihy et al =-=[11]-=- have designed a practical software transactional memory which is obstruction-free and requires only the readily-available compare-and-swap (CAS) instruction. Unlike the design in Section 5, it introd...

Citation Context

... that has physically but not logically committed, then it stalls until the physical commit completes. This approach is similar to commit protocols used by software-only transactional memory proposals =-=[9]-=-. Because aborting or committing a transaction requires access to the XADT entries belonging to the transaction, these entries may be linked together (by extending the XADT entry fields) to speed trav...

Citation Context

...transactions abort. 1. Introduction The promise of plentiful thread support from chip multiprocessors is re-energizing interest in transactional memory (TM) [14] systems, implemented in software only =-=[12, 13, 18, 27]-=- or, our focus, in hardware (with some software support) [2, 11, 14, 25]. TM systems must provide transaction atomicity (all or nothing) and isolation (the partially-complete state of a transaction is...

Citation Context

...to effectively deal with large transactions will be crucial in these settings as well. Since the seminal paper on a software TM (STM) that supported dynamic data structures and unbounded transactions =-=[22]-=-, all modern STMs are supposed to handle complex workloads [22, 27, 10, 31, 21, 2, 35, 29]. A wide variety of STM techniques, mainly inspired by database algorithms, have been explored. The big challe...

Citation Context

...omatically manages synchronization issues without further burden on the application developer. There have been many proposed designs for TM systems based on hardware (HTM) [6, 16, 29], software (STM) =-=[13, 17, 19, 27, 34]-=-, and hybrid hardware/software techniques [8, 12, 25, 33, 36, 39]. Most evaluations of these systems have relied on microbenchmarks or parallel applications from benchmark suites like SPEComp [38] or ...

Citation Context

...emory augments a machine with memory transactions [17]. Original proposals required hardware changes, but subsequent work [31] showed how to do it in software; more efficient proposals appeared later =-=[16, 15]-=-. These systems are all targeted at multiprocessor machines rather than distributed systems. Distributed shared memory (DSM) emulates a shared memory environment over a distributed system. This line o...

Citation Context

...d-based TMs (e.g., [16, 3, 7]) access memory at the granularity of machine words or larger chunks of memory and keep TMmetadata external (i.e., at other areas of main memory). Objectbased TMs (e.g., =-=[9, 10, 8]-=-) access memory only at object granularity and require the TM to be aware of the object associated with every access. In this sense, word-based TMs are more widely applicable, for example in applicati...

Citation Context

...ypically retried until it commits, usually after taking some measures to reduce contention and avoid further conflicts. This approach has been investigated in hardware [1, 6, 12, 19, 20], in software =-=[7, 8, 11, 14, 15, 17, 25]-=-, and in schemes that mix hardware and software [18, 23]. Here we focus on software schemes. As an application programming interface (API), software transactional memory (STM) promises to alleviate th...