108 search results - page 4 / 22 » Runtime checking of serializability in software transactiona... |
103
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
104
click to vote
CGO
2009
IEEE
15 years 6 months ago
2009
IEEE
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
113
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
100
click to vote
MICRO
2010
IEEE
14 years 6 months ago
2010
IEEE
Today's transactional memory systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict happens. 2PL is a simple algorithm that pr...
PLDI
2010
ACM
15 years 2 months ago
2010
ACM
We describe an automatic verification method to check whether transactional memories ensure strict serializability--a key property assumed of the transactional interface. Our main...