Sciweavers

2703 search results - page 23 / 541
» Optimizing memory transactions
Sort
View
IPPS
2000
IEEE
14 years 1 months ago
Using Logs to Increase Availability in Real-Time Main-Memory Database
Abstract. Real-time main-memory databases are useful in real-time environments. They are often faster and provide more predictable execution of transactions than disk-based databas...
Tiina Niklander, Kimmo E. E. Raatikainen
PPOPP
2009
ACM
14 years 9 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
ADBIS
2004
Springer
92views Database» more  ADBIS 2004»
14 years 11 days ago
Optimal Database Locks for Efficient Integrity Checking
Abstract. In concurrent database systems, correctness of update transactions refers to the equivalent effects of the execution schedule and some serial schedule over the same set o...
Davide Martinenghi
ISCA
2011
IEEE
238views Hardware» more  ISCA 2011»
13 years 10 days ago
Rebound: scalable checkpointing for coherent shared memory
As we move to large manycores, the hardware-based global checkpointing schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include ...
Rishi Agarwal, Pranav Garg, Josep Torrellas
AAIM
2005
Springer
132views Algorithms» more  AAIM 2005»
14 years 2 months ago
Computation of Arbitrage in a Financial Market with Various Types of Frictions
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...
Mao-cheng Cai, Xiaotie Deng, Zhongfei Li