Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique
Reexamination Certificate
2006-05-16
2006-05-16
Moazzami, Nasser (Department: 2187)
Electrical computers and digital processing systems: memory
Storage accessing and control
Control technique
C711S203000, C707S793000
Reexamination Certificate
active
07047379
ABSTRACT:
Disclosed are a system, a method, and a computer program product to efficiently create consistent transaction sets to maintain one or more copies of data at different data storage sites. All transactions sent to a primary backup appliance during a consistent transaction set creation interval are formed into a consistent transaction set by efficiently adding new transactions as they are received and removing unnecessary transfers as newer versions arrive. When the creation interval has expired, the complete consistent transaction set is transferred to a secondary backup appliance to be used to update a consistent backup copy of the primary site data. For each consistent transaction set, there will be a tree data structure (a search tree) created that contains the addressing information for all of the blocks of data in the consistent transaction set. The tree data structure used is a modified splay tree, which is a specialization of a binary search tree such that accessed nodes are “percolated” to the top of the tree for faster subsequent access. Secondary data consistency is maintained because the consistent transaction sets are applied whole at the secondary site, and after application, the secondary volumes are exact copies of the primary volumes at the time the consistent transaction set was completed.
REFERENCES:
patent: 4761785 (1988-08-01), Clark et al.
patent: 5276835 (1994-01-01), Mohan et al.
patent: 5278982 (1994-01-01), Daniels et al.
patent: 5317731 (1994-05-01), Dias et al.
patent: 5327556 (1994-07-01), Mohan et al.
patent: 5440727 (1995-08-01), Bhide et al.
patent: 5455944 (1995-10-01), Haderle et al.
patent: 5465328 (1995-11-01), Dievendorff et al.
patent: 5557770 (1996-09-01), Bhide et al.
patent: 5793412 (1998-08-01), Asamizuya
patent: 5974425 (1999-10-01), Obermarck et al.
patent: 6105103 (2000-08-01), Courtright, II et al.
patent: 6289355 (2001-09-01), Haderle et al.
patent: 6363462 (2002-03-01), Bergsten
patent: 6564219 (2003-05-01), Lee et al.
patent: 6651074 (2003-11-01), Taylor
patent: 2002/0087672 (2002-07-01), Milligan et al.
patent: WO 92/12482 (1992-07-01), None
U.S. Appl. No. 10/339,957, filed Jan. 9, 2003, K. W. Day et al.
IEEE, vol. 13, No. 5, May 2002; pp. 499-515.
IBM TDB, vol. 24, No. 2, Jul., 1981, pp. 986-987.
Menon, J et al., IBM RJ 8230 (75424); Jul. 1991; pp. 302-309.
RD; Mar. 2001; No. 443; pp. 464-465.
ACM, “Trans. On Comp. Syst.”; vol. 10, No. 1; Feb. 1992; pp. 26-52.
ACM, P-A Larson, et al., “Memory Management During . . . ”, 1998, pp. 472-483.
IEEE, A. Thomasian, “Priority Queueing in RAID5 Disk Arrays . . . ”, Oct. 1994, pp. 168-172.
IBM RJ 9187; Menon, J. et al. “The Architecture of a Fault-Tolerant . . . ”, Jan. 1993, pp. 76-86.
Boyd Kenneth Wayne
Day III Kenneth Fairclough
Dudas Philip Matthew
Micka William Frank
Wolfgang John Jay
Holcombe John H.
Moazzami Nasser
LandOfFree
Autonomic link optimization through elimination of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Autonomic link optimization through elimination of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Autonomic link optimization through elimination of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3596413