Transactional memory using buffered writes and enforced...

Data processing: database and file management or data structures – Data integrity – Transactional processing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S704000

Reexamination Certificate

active

07908255

ABSTRACT:
Various technologies and techniques are disclosed that support buffered writes and enforced serialization order in a software transactional memory system. A buffered write process is provided that performs writes to shadow copies of objects and writes content back to the objects after validating a respective transaction during commit. When a write lock is first obtained for a particular transaction, a shadow copy is made of a particular object. Writes are performed to and reads from the shadow copy. After validating the particular transaction during commit, content is written from the shadow copy to the particular object. A transaction ordering process is provided that ensures that an order in which the transactions are committed matches an abstract serialization order of the transactions. Transactions are not allowed to commit until their ticket number matches a global number that tracks the next transaction that should commit.

REFERENCES:
patent: 5428761 (1995-06-01), Herlihy et al.
patent: 6880045 (2005-04-01), Pong et al.
patent: 7496716 (2009-02-01), Dice et al.
patent: 2003/0182462 (2003-09-01), Moir et al.
patent: 2003/0187861 (2003-10-01), Lubbers et al.
patent: 2004/0015642 (2004-01-01), Moir et al.
patent: 2004/0034673 (2004-02-01), Moir et al.
patent: 2004/0225823 (2004-11-01), Heynemann et al.
patent: 2005/0060559 (2005-03-01), McKenney
patent: 2006/0085588 (2006-04-01), Rajwar et al.
patent: 2006/0085591 (2006-04-01), Kumar et al.
Hammond, et al., “Programming with Transactional Coherence and Consistency (TCC)”, Date: Oct. 2004, http://tcc.stanford.edu/publications/tcc—asplos2004.pdf.
Hammond, et al., “Transactional Coherence and Consistency: Simplifying Parallel Hardware and Software”, Date: 2004, http://tcc.stanford.edu/publications/tcc—micro2004.pdf.
Spear, et al., “Conflict Detection and Validation Strategies for Software Transactional Memory”, http://www.cs.rochester.edu/u/scott/papers/2006—DISC—conflict.pdf.
Johnson, Troy A. et al., “Can Transactions Enhance Parallel Programs?”, Proceedings of the 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC), Nov. 2006, 15 pages.
International Search Report and Written Opinion Received for PCT Patent Application No. PCT/US2008/056873, mailed on Jul. 15, 2008, 10 pages.
Hammond, L. et al., “Transactional memory coherence and consistency”, In: Proceedings on Computer Architecture, 31st Annual International Symposium. Edited by IEEE Society, Jun. 19-23, 2004, pp. 102-113.
Woo, S.K. et al., “An effective recovery under fuzzy checkpointing in main memory databases”, Information and Software Technology, vol. 42, No. 3, Feb. 25, 2000, pp. 185-196.
Moore, K. E. et al., “LogTM: log-based transactional memory”, In High-Performance Computer Architecture, 12-th International Symposium. Feb. 2006, pp. 254-265.
Garcia-Molina, H. et al., Main memory database systems: an overview, IEEE Transactions on Knowledge and Data Engineering, Dec. 1992, vol. 4, No. 6, pp. 509-516.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Transactional memory using buffered writes and enforced... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Transactional memory using buffered writes and enforced..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transactional memory using buffered writes and enforced... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2681900

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.