Sciweavers

268 search results - page 20 / 54
» Language constructs for transactional memory
Sort
View
EPEW
2005
Springer
14 years 1 months ago
Executable Semantics for Compensating CSP
Compensation is an error recovery mechanism for long-running transactions. Compensating CSP is a variant of the CSP process algebra with constructs for orchestration of compensatio...
Michael J. Butler, Shamim Ripon
IPPS
2006
IEEE
14 years 1 months ago
Improving cooperation in peer-to-peer systems using social networks
Rational and selfish nodes in P2P systems usually lack effective incentives to cooperate, contributing to the increase of free-riders, and degrading the system performance. Variou...
Wenyu Wang, Li Zhao, Ruixi Yuan
ASPLOS
2011
ACM
12 years 11 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
FIMI
2003
123views Data Mining» more  FIMI 2003»
13 years 9 months ago
Apriori, A Depth First Implementation
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
Walter A. Kosters, Wim Pijls
PLDI
2012
ACM
11 years 10 months ago
JANUS: exploiting parallelism via hindsight
This paper addresses the problem of reducing unnecessary conflicts in optimistic synchronization. Optimistic synchronization must ensure that any two concurrently executing trans...
Omer Tripp, Roman Manevich, John Field, Mooly Sagi...