48 search results - page 4 / 10 » Simplifying concurrent algorithms by exploiting hardware tra... |
PPOPP
2010
ACM
14 years 3 months ago
2010
ACM
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
HASKELL
2009
ACM
14 years 23 days ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
CAV
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
SPAA
2010
ACM
13 years 11 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...
DATE
2009
IEEE
14 years 1 months ago
2009
IEEE
We consider multiprocessor distributed real-time systems where concurrency control is managed using software transactional memory (or STM). For such a system, we propose an algori...