Sciweavers

439 search results - page 71 / 88
» Stretching transactional memory
Sort
View
FTCS
1998
91views more  FTCS 1998»
15 years 1 months ago
How Fail-Stop are Faulty Programs?
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...
Subhachandra Chandra, Peter M. Chen
KDD
2000
ACM
101views Data Mining» more  KDD 2000»
15 years 3 months ago
Incremental quantile estimation for massive tracking
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...
Fei Chen, Diane Lambert, José C. Pinheiro
POPL
2009
ACM
15 years 6 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
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...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
100
Voted
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
15 years 6 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir
CSSE
2008
IEEE
15 years 6 months ago
The Relation of Version Control to Concurrent Programming
Version control helps coordinating a group of people working concurrently to achieve a shared objective. Concurrency control helps coordinating a group of threads working concurre...
Annette Bieniusa, Peter Thiemann, Stefan Wehr