Sciweavers

2512 search results - page 61 / 503
» Software Transactional Memory
Sort
View
ASPLOS
2012
ACM
12 years 5 months ago
Providing safe, user space access to fast, solid state disks
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...
Adrian M. Caulfield, Todor I. Mollov, Louis Alex E...
OSDI
2008
ACM
14 years 10 months ago
Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous bu...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
PPOPP
2010
ACM
14 years 7 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
HOTOS
2007
IEEE
14 years 1 months ago
Automatic Mutual Exclusion
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transac...
Michael Isard, Andrew Birrell
IPPS
2000
IEEE
14 years 2 months ago
Incorporating Non-functional Requirements into Software Architectures
Abstract. The concept of software architecture has created a new scenario for incorporating non-functional and transactional requirements into the software design. Transactional an...
Nelson S. Rosa, George R. Ribeiro-Justo, P. R. F. ...