1043 search results - page 63 / 209 » Reading, Writing and Relations |
161
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
178
click to vote
EUROPAR
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Hardware Transactional Memory (HTM) gives software developers the opportunity to write parallel programs more easily compared to any previous programming method, and yiel...
155
click to vote
ASPLOS
2004
ACM
15 years 11 months ago
2004
ACM
Transactional Coherence and Consistency (TCC) offers a way to simplify parallel programming by executing all code within transactions. In TCC systems, transactions serve as the fu...
140
click to vote
DSN
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels—one for self-verifying data and the other for any data. ...
172
click to vote
DEXA
1998
Springer
15 years 10 months ago
1998
Springer
We discuss and prove the correctness of a transaction model for mobile computing. In our transaction model, we incorporate a prewrite operation (before a write) which does not upda...