Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique
Reexamination Certificate
2011-01-11
2011-01-11
Kim, Matt (Department: 2186)
Electrical computers and digital processing systems: memory
Storage accessing and control
Control technique
C711SE12103
Reexamination Certificate
active
07870354
ABSTRACT:
Embodiments of the system described herein can be implemented in a software application that runs on a host device or is embedded in a logic or memory device such as a gate array, EEPROM, a control, or dynamical system. The system embodiment allows a set of similar or dissimilar intelligent devices or sensors, which may be interconnected with any type of network or bus, to replicate data between themselves for the purpose of remote backup, redundancy, content distribution, or measurements. The attributes of the data, which may be changed or created on one device or passed through the device, are tracked and journaled in volatile or non-volatile storage in a first phase. This occurs in real-time as the data changes or passes through the device. In a second phase, the attributes that match patterns pre-specified in a configuration are used to decide what changes or the content to replicate to one or more devices. In a third phase, the data is replicated. In practice, the techniques described herein are independent of hardware, operating systems, and applications. The example embodiment is designed to be transparent for system redundancy and error recovery processes such as error correction, retransmission on links, and raid reconfiguration.
REFERENCES:
patent: 5295075 (1994-03-01), Korner
patent: 5353232 (1994-10-01), Vollmayr
patent: 5434793 (1995-07-01), Korner
patent: 5819020 (1998-10-01), Beeler, Jr.
patent: 5920725 (1999-07-01), Ma et al.
patent: 5974563 (1999-10-01), Beeler, Jr.
patent: 6442748 (2002-08-01), Bowman-Amuah
patent: 6496908 (2002-12-01), Kamvysselis et al.
patent: 6539396 (2003-03-01), Bowman-Amuah
patent: 6597983 (2003-07-01), Hancock
patent: 6898609 (2005-05-01), Kerwin
patent: 6937730 (2005-08-01), Buxton
patent: 7069267 (2006-06-01), Spencer, Jr.
patent: 7130870 (2006-10-01), Pecina et al.
patent: 7233975 (2007-06-01), Gerraty et al.
patent: 2003/0014433 (2003-01-01), Teloh et al.
patent: 2004/0133591 (2004-07-01), Holenstein et al.
patent: 2005/0149578 (2005-07-01), Sustman et al.
patent: 2006/0059511 (2006-03-01), Nocifera et al.
patent: WO-01/35244 (2001-05-01), None
Lanches, P., International Search Report for PCT/US2004/036474 as mailed Dec. 9, 2007 (7 pages).
Gladney, H.M., “Data Replicas in Distributed Information Services”, ACM Transactions on Database Systems, vol. 14, No. 1, Mar. 1989, pp. 75-97.
Nordin, Brent, et al., “Remote Operations Across a Network of Small Computers”, ACM, 1986, pp. 110-114.
Adusumilli, Panduranga Rao, “An Integrated Solution for Managing Replicated Data in Distributed Systems”, ACM, 1993, pp. 351-357.
Kahane, Yehuda, et al., “Computer Backup Pools, Disaster Recovery, and Default Risk”, Communications of the ACM, Jan. 1988, vol. 31, No. 1, pp. 78-83.
Birman, Kenneth P., “Replication and Fault-Tolerance in the ISIS System”, ACM, 1985, p. 79-86.
Liskov, Barbara, et al., “A Replicated Unix File System”, Jul. 31, 1990, (9 pages).
Mullender, Sape J., et al., “Simulating Wide-area Replication”, 1994, (8 pages).
Liskov, Barbara, et al., “Replication in the Harp File System”, ACM, 1991, pp. 226-238.
Ladin, Rivka, et al., “Lazy Replication: Exploiting the Semantics of the Distributed Services”, ACM, 1990, pp. 43-57.
Joseph, Thomas A., et al., “Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems”, ACM Transactions on Computer Systems, vol. 4, No. 1, Feb. 1986, pp. 54-70.
Birrell, Andrew D., et al., Grapevine: An Exercise in Distributed Computing, Communications of the ACM, Apr. 1982, vol. 25, No. 4, pp. 260-274.
Ruan, Zuwang, et al., “Performance Analysis of File Replication Schemes in Distributed Systems”, ACM, 1987, pp. 205-215.
Kim, Won, “Highly Available Systems for Database Applications”, Computing Surveys vol. 16, No. 1, Mar. 1984, (28 pages).
Ladin, Rivka, et al., “Providing High Availability Using Lazy Replication”, ACM Transactions on Computer Systems, vol. 10, No. 4, Nov. 1992, pp. 360-391.
Bhide, Anupam, et al., “An Efficient Scheme for Providing High Availability”, ACM SIGMOD, 1992, pp. 236-245.
Pu, Calton, et al., “Replica Control in Distributed Systems: An Asynchronous Approach”, ACM, 1991, pp. 377-386.
Mellor-Crummey, John, et al., “Synchronization Without Contention”, ACM, 1991, pp. 269-278.
Goldring, Rob, “Things every update replication customer should know”, ACM, 1995, pp. 439-440.
Polyzois, Christos A., et al., “Evaluation of Remote Backup Algorithms for Transaction-Processing Systems”, ACM Transactions on Database Systems, vol. 19, No. 3, Sep. 1994, pp. 423-449.
Ivinskis, Kestutis, “High Availability of Commercial Applications”, ACM, 1995, pp. 433-434.
King, Richard, P., et al., “Management of a Remote Backup Copy for Disaster Recovery”, ACM Transactions on Database Systems, vol. 16, No. 2, Jun. 1991, pp. 338-368.
Kumar, Akhil, et al., “Cost and availability tradeoffs in replicated data concurrency control”, ACM Transactions on Database Systems (TODS), vol. 18, Issue 1, Mar. 1993, (5 pages).
Bhide, Anupam et al., “An efficient scheme for providing high availability”, The Guide to Computing Literature, 1992, (4 pages).
Polyzois, Christos et al., “Evaluation of Remote Backup Algorithms for Transaction Processing Systems”, ACM SIGMOD, 1992, pp. 246-255.
Jensen, David W., et al., “File Archive Activity in a Supercomputing Environment”, ACM, 1993, pp. 387-396.
Olken, Frank, “HOPT: A Myopic Version of the STOCHOPT Automatic File Migration Policy”, ACM, 1983, pp. 39-43.
Weinstein, Matthew J., et al., “Transactions and Synchronization in a Distributed Operating System”, ACM, 1985, pp. 115-126.
Awerbuch, Baruch et al., “Competitive Distributed File Allocation”, ACM STOC, May 1993, pp. 164-173.
Sandhu, Harjinder S., et al., “Cluster-Based File Replication in Large-Scale Distributed Systems”, Performance Evaluation Review, vol. 20, No. 1, Jun. 1992, pp. 91-102.
Andrews, Gregory R., “Paradigms for Process Interaction in Distributed Programs”, ACM Computing Surveys, vol. 23, No. 1, Mar. 1991, pp. 82-90.
Wiebe, Douglas, “A Distributed Repository for Immutable Persistent Objects”, ACM, Sep. 1986, pp. 453-465.
Gray, Jim, “Why Do Computers Stop and What Can Be Done About It?”, Technical Report 85.7, Jun. 1985, pp. 1-35.
A.A. El Haddi et al., “Using File replication for business continuance and content distribution.”, www.constantdata.com, May 2003, (8 pages).
Ma, Chaoying, “On Building Very Large Naming Systems”, Cambridge University Computer Lab, 1992, pp. 1-5.
Herlihy, Maurice, “Taking Concurrency Seriously”, 1989, (2 pages).
McDermott, John, P. et al., “A Single-Level Scheduler for the Replicated Architecture for Multilevel-Secure Databases”, 1991, (10 pages).
Garcia-Molina, Hector, et al., “The Cost of Data Replication”, 1981, pp. 193-198.
Alsberg, Peter A. et al., “A Principle for Resilient Sharing of Distributed Resources”, 1976, pp. 562-570.
Bakbone Software, Inc.
Fishburn John P
Kim Matt
Winstead PC
LandOfFree
Data replication from one-to-one or one-to-many... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data replication from one-to-one or one-to-many..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data replication from one-to-one or one-to-many... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2692850