Sciweavers

631 search results - page 52 / 127
» Composable memory transactions
Sort
View
DSN
2000
IEEE
15 years 2 months ago
Data Replication Strategies for Fault Tolerance and Availability on Commodity Clusters
Recent work has shown the advantages of using persistent memory for transaction processing. In particular, the Vista transaction system uses recoverable memory to avoid disk I/O, ...
Cristiana Amza, Alan L. Cox, Willy Zwaenepoel
IPPS
2010
IEEE
14 years 7 months ago
Consistency in hindsight: A fully decentralized STM algorithm
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
Annette Bieniusa, Thomas Fuhrmann
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
14 years 7 months ago
Scalable Speculative Parallelization on Commodity Clusters
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
Hanjun Kim, Arun Raman, Feng Liu, Jae W. Lee, Davi...
FASE
2004
Springer
15 years 3 months ago
Reasoning about Card Tears and Transactions in Java Card
The Java dialect Java Card for programming smartcards contains some features which do not exist in Java. Java Card distinguishes persistent and transient data (data stored in EEPRO...
Engelbert Hubbers, Erik Poll
DAWAK
2008
Springer
14 years 11 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash