Sciweavers

77 search results - page 1 / 16
» The common case transactional behavior of multithreaded prog...
Sort
View
HPCA
2006
IEEE
14 years 4 months ago
The common case transactional behavior of multithreaded programs
Transactional memory (TM) provides an easy-to-use and high-performance parallel programming model for the upcoming chip-multiprocessor systems. Several researchers have proposed a...
JaeWoong Chung, Hassan Chafi, Chi Cao Minh, Austen...
ISCA
2007
IEEE
198views Hardware» more  ISCA 2007»
13 years 11 months ago
Making the fast case common and the uncommon case simple in unbounded transactional memory
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...
Colin Blundell, Joe Devietti, E. Christopher Lewis...
ASPLOS
2011
ACM
12 years 8 months ago
Specifying and checking semantic atomicity for multithreaded programs
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
Jacob Burnim, George C. Necula, Koushik Sen
HPCA
2005
IEEE
14 years 4 months ago
Unbounded Transactional Memory
Hardware transactional memory should support unbounded transactions: transactions of arbitrary size and duration. We describe a hardware implementation of unbounded transactional ...
C. Scott Ananian, Krste Asanovic, Bradley C. Kuszm...
SOSP
1997
ACM
13 years 5 months ago
Eraser: A Dynamic Data Race Detector for Multi-Threaded Programs
Multi-threaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mi...
Stefan Savage, Michael Burrows, Greg Nelson, Patri...