IP Library Granted Patent US 12,688,200
Granted Patent B2
US 12,688,200 · App. 18/522,007 · Granted Jul 21, 2026

Systems and methods for data replication synchronization

Inventors: Stephen Freiberg (Palo Alto, CA); Alexander Landau (Palo Alto, CA); Andrew Greene (Palo Alto, CA); Brian Dorne (San Francisco, CA); Bryan Offutt (Palo Alto, CA); Ernest Zeidman (Palo Alto, CA); Ilya Nepomnyaschchiy (Mountain View, CA); John Garrod (San Mateo, CA); Katherine Brainard (East Orange, NJ); Kolin Purcell (San Francisco, CA); Michael Levin (Bethesda, MD); Simon Swanson (San Francisco, CA); Spencer Stecko (Palo Alto, CA)
Assignee: Palantir Technologies Inc.
G06F16/273G06F7/02
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,688,200
App. No.
18/522,007
Granted
Jul 21, 2026
Kind
B2
Abstract

Systems and methods are provided for storing a first data object comprising a first set of immutable components, the first data object being associated with a corresponding second data object stored by a remote replication system. A difference is determined between the first set of immutable components of the first data object and a second set of immutable components of the corresponding second data object. A subset of immutable components is identified from the first set of immutable components based on the difference. The subset of immutable components from the first set of immutable components is provided to the remote replication system over a communication network.

Claims (70)

1 . A system comprising:

a first server communicatively coupled to different servers and to one or more clients;

the different servers;

the one or more clients;

one or more processors; and

a memory storing instructions that, when executed by the one or more processors, cause the system to perform:

storing a first data object at the first server, the first data object being associated with a corresponding second data object stored by a second server of the one or more different servers and a corresponding third data object stored by a third server of the one or more different servers;

receiving an update to the second data object from the second server;

generating a version vector representing the updated second data object;

generating a condensed form of the version vector, wherein the condensed form hides second server client information of any associated clients of the second server;

transmitting the condensed form of the version vector to the first server or the third server;

prior to or during scheduling of one or more import actions from the second server to the first server and scheduling of one or more export actions from the first server to the third server:

generating a condensed import version vector representing an import data object to be imported by the one or more import actions, wherein the condensed import version vector hides the second server client information or hides different client information of any associated clients of a different server besides the second server; and

generating a condensed export version vector representing an export data object to be exported by the one or more export actions, wherein the condensed export version vector hides first server client information of any associated clients of the first server, hides the second server client information, or hides the different client information; and

selectively scheduling the one or more import action and the one or more export actions, according to ordering rules of the one or more import actions from the second server to the first server relative to the one or more export actions from the first server to the third server to synchronize, among the first server, the second server and the third server, the first data object, the second data object, and the third data object.

2 . The system of claim 1 , wherein hiding of second server client information results in identity information of any second associated clients associated with the second server being invisible from a perspective of the first server, and wherein identity information of any third associated clients associated with the third server is invisible from the perspective of the first server.

3 . The system of claim 1 , wherein the selective scheduling comprises refraining from reordering a priority of an import action or an export action with respect to a different import action.

4 . The system of claim 1 , wherein the selective scheduling comprises refraining from reordering a first export action to occur ahead of a second export action.

5 . The system of claim 1 , wherein the selective scheduling is based on a predicted saturation state of a network connection resulting from an export action.

6 . The system of claim 1 , wherein the instructions further cause the system to:

hold, at the first server, separate version clock acknowledgements for each of different data objects stored within the first server, and for different updates from each of the different servers;

compare the condensed form of the version vector associated with an update to the second data object or the third data object to a condensed form of a local version vector of the first server associated with an update to the first data object to determine any concurrent changes;

upon detecting a difference between the condensed form of the version vector associated with the update, hold the update to the first data object from replication to the second server and to the third server;

resolve a conflict associated with the concurrent changes; and

in response to resolving the conflict, update the condensed form of the local version vector of the first server and transmit the updated first data object and the updated condensed form of the local version vector to the second server or the third server.

7 . The system of claim 1 , wherein the instructions further cause the system to update the first data object at the first server in response to the update to the second data object and propagate the updated first data object to a first client without propagating the updated first data object to any other clients.

8 . The system of claim 1 , wherein the selectively scheduling comprises:

determining that a local update to the first data object takes precedence over the update received from the second server;

updating the first data object based on the local update;

propagating the updated first data object to the second server; and

propagating the updated first data object to the third server without propagating the updated second data object.

9 . The system of claim 1 , wherein the selectively scheduling is based on a predicted transfer time of propagating the second update to the first server and the third server, the selectively scheduling comprising refraining from scheduling in response to the predicted transfer time being longer than a threshold time.

10 . The system of claim 1 , wherein the update comprises a first update, and the condensed form of the version vector comprises a first condensed form of the version vector; and the instructions that, when executed by the one or more processors, cause the system to perform:

receiving an indication of an additional client of the second server;

receiving a second update to the first updated second data object from the second server;

generating a second version vector representing the second updated second data object;

generating a second condensed form of the second version vector, wherein the second condensed form hides second server client information regarding an identity of the additional client;

and transmitting the second condensed form of the second version vector to the first server or the third server.

11 . The system of claim 1 , wherein the second server client information comprises identify information of one or more identities of the any associated clients of the second server.

12 . A method being implemented by a computing system including one or more physical processors and storage media storing machine-readable instructions, the method comprising:

storing, at a first server, a first data object, the first data object being associated with a corresponding second data object stored by a second server of the one or more different servers and a corresponding third data object stored by a third server of the one or more different servers;

receiving an update to the second data object from the second server;

generating a version vector representing the updated second data object;

generating a condensed form of the version vector, wherein the condensed form hides second server client information of any associated clients of the second server;

transmitting the condensed form of the version vector to the first server or the third server;

prior to or during scheduling of one or more import actions from the second server to the first server and scheduling of one or more export actions from the first server to the third server:

generating a condensed import version vector representing an import data object to be imported by the one or more import actions, wherein the condensed import version vector hides the second server client information or hides different client information of any associated clients of a different server besides the second server; and

generating a condensed export version vector representing an export data object to be exported by the one or more export action, wherein the condensed export version vector hides first server client information of any associated clients of the first server, hides the second server client information, or hides the different client information; and

selectively scheduling the one or more import action and the one or more export actions, according to ordering rules of the one or more import actions from the second server to the first server relative to the one or more export actions from the first server to the third server to synchronize, among the first server, the second server and the third server, the first data object, the second data object, and the third data object.

13 . The method of claim 12 , wherein hiding of second server client information results in identity information of any second associated clients associated with the second server being invisible from a perspective of the first server, and wherein identity information of any third associated clients associated with the third server is invisible from the perspective of the first server.

14 . The method of claim 12 , wherein the selective scheduling is based on a predicted saturation state of a network connection resulting from an export action.

15 . The method of claim 12 , further comprising:

holding, at the first server, separate version clock acknowledgements for each of different data objects stored within the first server, and for different updates from each of the different servers;

comparing the condensed form of the version vector associated with an update to the second data object or the third data object to a condensed form of a local version vector of the first server associated with an update to the first data object to determine any concurrent changes;

upon detecting a difference between the condensed form of the version vector associated with the update, holding the update to the first data object from replication to the second server and to the third server;

resolving a conflict associated with the concurrent changes; and

in response to resolving the conflict, updating the condensed form of the local version vector of the first server and transmit the updated first data object and the updated condensed form of the local version vector to the second server or the third server.

16 . The method of claim 12 , further comprising:

updating the first data object at the first server in response to the update to the second data object and propagating the updated first data object to a first client without propagating the updated first data object to any other clients.

17 . The method of claim 12 , wherein the selectively scheduling comprises:

determining that a local update to the first data object takes precedence over the update received from the second server;

updating the first data object based on the local update;

propagating the updated first data object to the second server; and

propagating the updated first data object to the third server without propagating the updated second data object.

18 . The method of claim 12 , wherein the selectively scheduling is based on a predicted transfer time of propagating the second update to the first server and the third server, the selectively scheduling comprising refraining from scheduling in response to the predicted transfer time being longer than a threshold time.

19 . The system of claim 10 , wherein the instructions that, when executed by the one or more processors, cause the system to perform:

receiving a third update to the second updated second data object from the third server;

generating a third version vector representing the third updated second data object;

generating a third condensed form of the third version vector, wherein the third condensed form hides third server client information regarding one or more identities of clients of the third server; and

transmitting the third condensed form of the third update to the first server or the second server.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 28, 2023
From: FREIBERG, STEPHEN; LANDAU, ALEXANDER; GREENE, ANDREW; DORNE, BRIAN; OFFUTT, BRYAN; ZEIDMAN, ERNEST; NEPOMNYASCHCHIY, ILYA; GARROD, JOHN; BRAINARD, KATHERINE; PURCELL, KOLIN; LEVIN, MICHAEL; SWANSON, SIMON; STECKO, SPENCER
To: PALANTIR TECHNOLOGIES INC.
Reel/Frame 065690/0092 →
Continuity (5)
Continuation 17517481 · Nov 2, 2021
Continuation 16359398 · Mar 20, 2019
Continuation 15456256 · Mar 10, 2017
Provisional Application 62438190 · Dec 22, 2016
Related Publication 20240095259A1 · Mar 21, 2024
References Cited (182)
US 5548749A · Kroenke et al. · 1996 [cited by applicant]
US 5708828A · Coleman · 1998 [cited by applicant]
US 5765171A · Gehani et al. · 1998 [cited by applicant]
US 5870761A · Demers et al. · 1999 [cited by applicant]
US 6098078A · Gehani et al. · 2000 [cited by applicant]
US 6190053B1 · Stahlecker et al. · 2001 [cited by applicant]
US 6202085B1 · Benson et al. · 2001 [cited by applicant]
US 6216140B1 · Kramer · 2001 [cited by applicant]
US 6240414B1 · Beizer et al. · 2001 [cited by applicant]
US 6304882B1 · Strellis et al. · 2001 [cited by applicant]
US 6317754B1 · Peng · 2001 [cited by applicant]
US 6374252B1 · Althoff et al. · 2002 [cited by applicant]
US 6539381B1 · Prasad et al. · 2003 [cited by applicant]
US 6560620B1 · Ching · 2003 [cited by applicant]
US 6816941B1 · Carlson et al. · 2004 [cited by applicant]
US 6993539B2 · Federwisch et al. · 2006 [cited by applicant]
US 7072911B1 · Doman · 2006 [cited by applicant]
US 7167877B2 · Balogh et al. · 2007 [cited by applicant]
US 7437664B2 · Borson · 2008 [cited by applicant]
US 7596285B2 · Brown et al. · 2009 [cited by applicant]
US 7676788B1 · Ousterhout et al. · 2010 [cited by applicant]
US 7730396B2 · Chidlovskii et al. · 2010 [cited by applicant]
US 7818297B2 · Peleg et al. · 2010 [cited by applicant]
US 7877421B2 · Berger et al. · 2011 [cited by applicant]
US 7962495B2 · Jain et al. · 2011 [cited by applicant]
US 8015151B2 · Lier et al. · 2011 [cited by applicant]
US 8266698B1 · Seshardi · 2012 [cited by examiner]
US 8290990B2 · Drath et al. · 2012 [cited by applicant]
US 8301904B1 · Gryaznov · 2012 [cited by applicant]
US 8312546B2 · Alme · 2012 [cited by applicant]
US 8316060B1 · Snyder et al. · 2012 [cited by applicant]
US 8380659B2 · Zunger · 2013 [cited by applicant]
US 8442940B1 · Faletti · 2013 [cited by applicant]
US 8515912B2 · Garrod et al. · 2013 [cited by applicant]
US 8527461B2 · Ducott, III et al. · 2013 [cited by applicant]
US 8646080B2 · Williamson et al. · 2014 [cited by applicant]
US 8688749B1 · Ducott, III et al. · 2014 [cited by applicant]
US 8726379B1 · Stiansen et al. · 2014 [cited by applicant]
US 8782004B2 · Ducott, III et al. · 2014 [cited by applicant]
US 8838538B1 · Landau et al. · 2014 [cited by applicant]
US 8886601B1 · Landau et al. · 2014 [cited by applicant]
US 9009827B1 · Albertson et al. · 2015 [cited by applicant]
US 9275069B1 · Garrod et al. · 2016 [cited by applicant]
US 9330157B2 · Ducott, III et al. · 2016 [cited by applicant]
US 9444798B1 · Wang · 2016 [cited by applicant]
US 11163795B2 · Freiberg et al. · 2021 [cited by applicant]
US 20020161913A1 · Gonzalez · 2002 [cited by examiner]
US 20030084017A1 · Ordille · 2003 [cited by applicant]
US 20030088654A1 · Good et al. · 2003 [cited by applicant]
US 20040103124A1 · Kupkova · 2004 [cited by applicant]
US 20040111390A1 · Saito et al. · 2004 [cited by applicant]
US 20040250576A1 · Flanders · 2004 [cited by applicant]
US 20050034107A1 · Kendall et al. · 2005 [cited by applicant]
US 20050108063A1 · Madill et al. · 2005 [cited by applicant]
US 20050193024A1 · Beyer et al. · 2005 [cited by applicant]
US 20060036568A1 · Moore et al. · 2006 [cited by applicant]
US 20060106879A1 · Zondervan et al. · 2006 [cited by applicant]
US 20060155945A1 · McGarvey · 2006 [cited by applicant]
US 20060190497A1 · Inturi et al. · 2006 [cited by applicant]
US 20060206866A1 · Eldrige et al. · 2006 [cited by applicant]
US 20060212465A1 · Fish et al. · 2006 [cited by applicant]
US 20060218637A1 · Thomas et al. · 2006 [cited by applicant]
US 20060224579A1 · Zheng · 2006 [cited by applicant]
US 20070005707A1 · Teodosiu et al. · 2007 [cited by applicant]
US 20070026373A1 · Suriyanarayanan et al. · 2007 [cited by applicant]
US 20070112887A1 · Liu et al. · 2007 [cited by applicant]
US 20070168516A1 · Liu et al. · 2007 [cited by applicant]
US 20070180075A1 · Chasman et al. · 2007 [cited by applicant]
US 20070220067A1 · Suriyanarayanan et al. · 2007 [cited by applicant]
US 20070220328A1 · Liu et al. · 2007 [cited by applicant]
US 20070233756A1 · D'Souza et al. · 2007 [cited by applicant]
US 20070288533A1 · Srivastava · 2007 [cited by applicant]
US 20070299887A1 · Novik et al. · 2007 [cited by applicant]
US 20080027981A1 · Wahl · 2008 [cited by applicant]
US 20080033753A1 · Canda et al. · 2008 [cited by applicant]
US 20080086718A1 · Bostick et al. · 2008 [cited by applicant]
US 20080141117A1 · King et al. · 2008 [cited by applicant]
US 20080148398A1 · Mezack et al. · 2008 [cited by applicant]
US 20080189240A1 · Mullins et al. · 2008 [cited by applicant]
US 20080235575A1 · Weiss · 2008 [cited by applicant]
US 20080243951A1 · Webman et al. · 2008 [cited by applicant]
US 20080320299A1 · Wobber et al. · 2008 [cited by applicant]
US 20090172821A1 · Daira et al. · 2009 [cited by applicant]
US 20090199090A1 · Poston et al. · 2009 [cited by applicant]
US 20090254970A1 · Agarwal et al. · 2009 [cited by applicant]
US 20100100963A1 · Mahaffey · 2010 [cited by applicant]
US 20100145909A1 · Ngo · 2010 [cited by applicant]
US 20100330801A1 · Rouh · 2010 [cited by applicant]
US 20110010342A1 · Chen et al. · 2011 [cited by applicant]
US 20110173155A1 · Becchi · 2011 [cited by applicant]
US 20110219450A1 · McDougal et al. · 2011 [cited by applicant]
US 20110246229A1 · Pacha · 2011 [cited by applicant]
US 20120005159A1 · Wang et al. · 2012 [cited by applicant]
US 20120016849A1 · Garrod · 2012 [cited by examiner]
US 20120023075A1 · Pulfer et al. · 2012 [cited by applicant]
US 20120036106A1 · Desai et al. · 2012 [cited by applicant]
US 20120036178A1 · Gavini · 2012 [cited by examiner]
US 20120254129A1 · Wheeler et al. · 2012 [cited by applicant]
US 20130006655A1 · Van Arkel et al. · 2013 [cited by applicant]
US 20130006668A1 · Van Arkel et al. · 2013 [cited by applicant]
US 20130067017A1 · Carriere et al. · 2013 [cited by applicant]
US 20130097595A1 · Stern et al. · 2013 [cited by applicant]
US 20130114811A1 · Boufounos · 2013 [cited by examiner]
US 20130173540A1 · Qian et al. · 2013 [cited by applicant]
US 20130191336A1 · Ducott, III · 2013 [cited by applicant]
US 20130191338A1 · Ducott, III et al. · 2013 [cited by applicant]
US 20130276799A1 · Davidson · 2013 [cited by applicant]
US 20130346444A1 · Makkar et al. · 2013 [cited by applicant]
US 20140011000A1 · Dunkmann et al. · 2014 [cited by applicant]
US 20140040182A1 · Gilder et al. · 2014 [cited by applicant]
US 20140040714A1 · Siegel et al. · 2014 [cited by applicant]
US 20140081652A1 · Klindworth · 2014 [cited by applicant]
US 20140114972A1 · Ducott et al. · 2014 [cited by applicant]
US 20140129518A1 · Ducott et al. · 2014 [cited by applicant]
US 20140149130A1 · Getchius · 2014 [cited by applicant]
US 20140201145A1 · Dorman · 2014 [cited by examiner]
US 20140250066A1 · Calkowski et al. · 2014 [cited by applicant]
US 20140358812A1 · Hourte · 2014 [cited by applicant]
US 20150074050A1 · Landau et al. · 2015 [cited by applicant]
US 20150127568A1 · Zehentleitner · 2015 [cited by examiner]
US 20150227582A1 · Gu et al. · 2015 [cited by applicant]
US 20150235334A1 · Wang et al. · 2015 [cited by applicant]
US 20150261847A1 · Ducott, III et al. · 2015 [cited by applicant]
US 20160019252A1 · Ducott et al. · 2016 [cited by applicant]
US 20160092491A1 · Cowling · 2016 [cited by applicant]
US 20160135014A1 · Alharayeri · 2016 [cited by examiner]
US 20160335163A1 · Teodorescu · 2016 [cited by examiner]
US 20170171060A1 · Liu · 2017 [cited by applicant]
US 20180181637A1 · Freiberg et al. · 2018 [cited by applicant]
AU 2011279270A1 · 2013 [cited by applicant]
EP 0816968A2 · 1998 [cited by applicant]
EP 1647908A2 · 2006 [cited by applicant]
EP 2911078A2 · 2015 [cited by applicant]
NL 2011642A · 2014 [cited by applicant]
WO 2008113059A1 · 2008 [cited by applicant]
WO 2011161565A1 · 2011 [cited by applicant]
WO 2012009397A2 · 2012 [cited by applicant]
Dell Latitude D600 2003, Dell Inc., http://www.dell.com/downloads/global/products/latit/en/spec_latit_d600_en- .pdf. [cited by applicant]
Dou et al., “Ontology Translaation on the Semantic Web 2005,” Springer-Verlag, Journal on Data Semantics II Lecture Notes in Computer Science, vol. 3350, pp. 35-37. [cited by applicant]
Fidge, Colin J., “Timestamps in Message-Passing Systems,” K. Raymond (Ed.) Proc. of the 11th Australian Computer Science Conference (ACSC 1988), pp. 56-66. [cited by applicant]
Holliday, JoAnne, “Replicated Database Recovery using Multicast Communication,” IEEE 2002, pp. 11. [cited by applicant]
Lamport, “Time, Clocks and the Ordering of Events in a Distributed System,” Communications of the ACM, Jul. 1978, vol. 21, No. 7, pp. 558-565. [cited by applicant]
Loeliger, Jon, “Version Control with Git,” O'Reilly, May 2009, pp. 330. [cited by applicant]
Mattern, F., “Virtual Time and Global States of Distributed Systems,” Cosnard, M., Proc. Workshop on Parallel and Distributed Algorithms, Chateau de Bonas, France:Elsevier, 1989, pp. 215-226. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 13/657,684 dated Mar. 2, 2015. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/156,208 dated Feb. 12, 2016. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/286,485 dated Jul. 29, 2015. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/334,232 dated Nov. 10, 2015. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015. [cited by applicant]
Official Communication for Canadian Patent Application No. 2806954 dated Jan. 15, 2016. [cited by applicant]
Official Communication for European Patent Application No. 14159175.0 dated Feb. 4, 2016. [cited by applicant]
Official Communication for European Patent Application No. 15155845.9 dated Oct. 6, 2015. [cited by applicant]
Official Communication for European Patent Application No. 15156004.2 dated Aug. 24, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/657,684 dated Aug. 28, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 14/076,385 dated Jan. 22, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/076,385 dated Jun. 2, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/076,385 dated Jan. 25, 2016. [cited by applicant]
Official Communication for U.S. Appl. No. 14/156,208 dated Mar. 9, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/156,208 dated Aug. 11, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/156,208 dated Sep. 17, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/286,485 dated Mar. 12, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/286,485 dated Apr. 30, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/334,232 dated Jul. 10, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/518,757 dated Apr. 2, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/518,757 dated Jul. 20, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/518,757 dated Dec. 1, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 15/456,256 dated Aug. 28, 2017. [cited by applicant]
Official Communication for U.S. Appl. No. 15/456,256 dated Jun. 16, 2017. [cited by applicant]
Official Communication for U.S. Appl. No. 15/456,256 dated Mar. 22, 2018. [cited by applicant]
O'Sullivan, Bryan, “Making Sense of Revision Control Systems,” Communications of the ACM, Sep. 2009, vol. 52, No. 9, pp. 57-62. [cited by applicant]
OWL Web Ontology Language Reference Feb. 4, W3C, http://www.w3.org/TR/owl-ref/. [cited by applicant]
Parker, Jr. et al., “Detection of Mutual Inconsistency in Distributed Systems,” IEEE Transactions in Software Engineering, May 1983, vol. SE-9, No. 3, pp. 241-247. [cited by applicant]
Symantec Corporation, “E-Security Begins with Sound Security Policies,” Announcement Symantec, Jun. 14, 2001. [cited by applicant]
Summons to attend oral proceedings for EP Application 17204503.1 dated Apr. 16, 2021, 8 pages. [cited by applicant]
Extended European Search Report dated Feb. 16, 2018, issued in related European Patent Application No. 17204503.1 (8 pages). [cited by applicant]
Examination Report dated Jan. 21, 2020, issued in related European Patent Application No. 17204503.1 (5 pages). [cited by applicant]
Yasushi Saito et al., “Optimistic Replication”, ACM Computing Surveys, vol. 37, No. 1, Mar. 1, 2005, pp. 42-81. [cited by applicant]
Extended European Search Report dated Jul. 15, 2022, issued in related European Patent Application No. 21214439.8 (12 pages). [cited by applicant]
Non-Final Office Action dated Dec. 23, 2022, issued in related U.S. Appl. No. 17/517,481 (24 pages). [cited by applicant]
Summons to Attend Oral Proceedings dated Mar. 17, 2025, issued in related European Patent Application No. 21214439.8 (20 pages). [cited by applicant]
Rivka Ladin et al., “Providing High Availability Using Lazy Replication,” ACM Transactions on Computer Systems, vol. 10, No. 4, New York, US, Nov. 1992, pp. 360-391. [cited by applicant]
Rivka Ladin et al., “Lazy Replication: Exploiting the Semantics of Distributed Services,” Principles of Distributed Computing, ACM, New York, US, Aug. 1, 1990, pp. 43-57. [cited by applicant]