Sciweavers

35 search results - page 2 / 7
» On Optimistic Methods for Mobile Transactions
Sort
View
DEXAW
2008
IEEE
129views Database» more  DEXAW 2008»
13 years 11 months ago
SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concu...
Zhaowen Xing, Le Gruenwald, K. K. Phang
HOTOS
2007
IEEE
13 years 9 months ago
Is the Optimism in Optimistic Concurrency Warranted?
Optimistic synchronization allows concurrent execution of critical sections while performing dynamic conflict detection and recovery. Optimistic synchronization will increase perf...
Donald E. Porter, Owen S. Hofmann, Emmett Witchel
SAC
1999
ACM
13 years 9 months ago
Transaction Processing in PRO-MOTION
To provide data consistency in the presence of failures and concurrency, database methods will continue to be important to the processing of shared information in a mobile computi...
Gary D. Walborn, Panos K. Chrysanthis
IPPS
2003
IEEE
13 years 10 months ago
A Case Study of Optimistic Computing on the Grid: Parallel Mesh Generation
This paper describes our progress in creating a case study on optimistic computing for the Grid using parallel mesh generation. For the implementation of both methods we will be u...
Nikos Chrisochoides, Andriy Fedorov, Bruce Lowekam...
ISCN
2006
IEEE
13 years 11 months ago
An optimistic fair e-commerce protocol for large e-goods
Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want ...
Cagil Can Oniz, Erkay Savas, Albert Levi