Electrical computers and digital processing systems: memory – Storage accessing and control – Memory configuring
Reexamination Certificate
2007-09-11
2007-09-11
Peugh, Brian R. (Department: 2187)
Electrical computers and digital processing systems: memory
Storage accessing and control
Memory configuring
C712S228000
Reexamination Certificate
active
11008525
ABSTRACT:
A method, apparatus and computer program product are disclosed for incrementally checkpointing the state of a computer memory in the presence of at least one executing software application at periodic instants. A secure hash function is periodically applied to each partitioned contiguous block of memory to give a periodic block hash value. At each periodic instant, a block hash value for each block is compared with a respective preceding block hash value to determine if said memory block has changed according to whether said block hash values are different. Only changed memory blocks are stored in a checkpoint record. The memory block sizes are adapted at each periodic instant to split changed blocks into at least two parts and to merge only two non-changed contiguous blocks at a time.
REFERENCES:
patent: 6154877 (2000-11-01), Ramkumar et al.
patent: 6161219 (2000-12-01), Ramkumar et al.
patent: 6289474 (2001-09-01), Beckerle
patent: 6351754 (2002-02-01), Bridge, Jr. et al.
patent: 6513050 (2003-01-01), Williams et al.
patent: 6519712 (2003-02-01), Kim et al.
patent: 6622263 (2003-09-01), Stiffler et al.
patent: 6678704 (2004-01-01), Bridge, Jr. et al.
patent: 6718538 (2004-04-01), Mathiske et al.
patent: 6766428 (2004-07-01), Saulsbury et al.
patent: 7039663 (2006-05-01), Federwisch et al.
patent: 7200705 (2007-04-01), Santos et al.
patent: 2005/0050307 (2005-03-01), Reinhardt et al.
H. Nam, J. Kim, S. J. Hong, and S. Lee, “Probabilistic checkpointing”IEICE Transactions, Information and Ssytems,vol. E85-D, Jul. 2002.
M. Litzkow, T. Tannenbaum, J. Basney, and M. Livny, “Checkpointing and migration of UNIX processes in the Condor distributed processing system”Tech. Rep. UW-CS-TR-1346, University of Wisconsin—Madison Computer Sciences Department,Apr. 1997.
J. S. Plank, M. Beck, G. Kingsley, and K. Li, “Libckpt: Transparent checkpointing under Unix” inUsenix Winter Technical Conference,pp. 213-223, Jan. 1995.
E. Elnozahy, “How safe is probabilistic checkpointing” inTwenty Eight Annual International Symposium on Fault-Tolerant Computing,pp. 358-363, 1998.
H. Nam, J. Kim, S. J. Hong, and S. Lee, “Secure Checkpointing”Journal of Systems Architecture,vol. 48, pp. 237-254, 2003.
A. J. Menezes, P. C. Oorschot, and S. A. Vanstone, “Handbook of Applied Crytography”. 1997, pp. 38, 44, 338-351, CRC Press, Inc. ISBN: 0-8493-8523-7.
S. S. Mukherjee, C. Weaver, J. Emer, S. K. Reinhardt, and T. Austin, “A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor”Proc. 36th Annual Int'l Symp. on Microarchitecture(MICRO), pp. 29-40, Dec. 2003.
Robert Baumann, “Soft Errors in Commerical Semiconductor Technology: Overview and Scaling Trends”IEEE 2002 Reliability Physics Tutorial Notes, Reliability Fundamentals,pp. 121—01.1 - 121—01.14, Apr. 7, 2002.
D.C.Bossen, J.M. Tendler, K. Reick, “Power 4 System Design for High Reliability” Micro, IEEE, vol. 22, Issue 2, Mar.-Apr. 2002, pp. 16-24.
Agarwal Saurabh
Garg Rahul
Gupta Meeta S
Farrokh Hashem
Gibb & Rahman, LLC
McSwain, Esq. Marc
Peugh Brian R.
LandOfFree
Adaptive incremental checkpointing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Adaptive incremental checkpointing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive incremental checkpointing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3741558