-
公开(公告)号:US20210099543A1
公开(公告)日:2021-04-01
申请号:US16587125
申请日:2019-09-30
Applicant: Citrix Systems, Inc.
Inventor: Michael Cooney , Gaurav Saraf , Shashank Choudhary
IPC: H04L29/08
Abstract: A system, method and program product for synchronizing client-based data with data in a shared resource. A system is provided that receives data from a plurality of client devices, the data being indicative of at least one action associated with a shared resource accessible by the plurality of client devices, and inserts a plurality of actions indicated by the data as nodes into a polytree queue, wherein actions that do not depend on other actions in the polytree queue are inserted as root level nodes, and actions that depend on other actions in the polytree queue are inserted as child nodes. The system further executes the nodes in the polytree queue to synchronize the data from the plurality of client devices with the shared resource, wherein root level nodes are scheduled for immediate concurrent execution, and execution of child nodes is delayed until parent nodes of an associated child node are executed.
-
公开(公告)号:US11316951B2
公开(公告)日:2022-04-26
申请号:US16587125
申请日:2019-09-30
Applicant: Citrix Systems, Inc.
Inventor: Michael Cooney , Gaurav Saraf , Shashank Choudhary
Abstract: A system, method and program product for synchronizing client-based data with data in a shared resource. A system is provided that receives data from a plurality of client devices, the data being indicative of at least one action associated with a shared resource accessible by the plurality of client devices, and inserts a plurality of actions indicated by the data as nodes into a polytree queue, wherein actions that do not depend on other actions in the polytree queue are inserted as root level nodes, and actions that depend on other actions in the polytree queue are inserted as child nodes. The system further executes the nodes in the polytree queue to synchronize the data from the plurality of client devices with the shared resource, wherein root level nodes are scheduled for immediate concurrent execution, and execution of child nodes is delayed until parent nodes of an associated child node are executed.
-