631 search results - page 86 / 127 » Composable memory transactions |
FTCS
1998
14 years 11 months ago
1998
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
105
click to vote
FDL
2006
IEEE
15 years 3 months ago
2006
IEEE
Reusing IP-cores to construct system models facilitated by automated generation of glue-logic, and automated composability checks can help designers to create efficient simulation...
101
click to vote
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
POPL
2009
ACM
15 years 4 months ago
2009
ACM
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...