US6021118A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Synchronization methods for distributed processing systems having replicated data
Assignee: Nokia of America Corp
•
Filing: 1997-02-10
•
Granted: 2000-02-01
•
Expires: 2017-02-10
Abstract
Abstract A data synchronization system, which in one embodiment, uses a ShuffleNet topology requiring an even number, N=2m, of nodes in the system. These nodes are organized into two sets, X=x 0 , . . . , x m-1 and Y=y 0 , . . . , y m-1 , wherein the subscripts are always to be taken modulo m. Each "round" of communication entails simultaneously synchronizing the nodes in X with nodes in Y according to a matching between the two sets. The rounds are grouped into two "batches," batch B j which consists of rounds R 2j-1 and R 2j-2 for j≧1. During each odd batch B 2j-1 , each x i synchronizes with y 2i+2j-2 and with y 2i+2j-1 . In another embodiment, the data synchronization is based on a hypercube scheme, wherein each node is labeled by a binary string and any two nodes with their labels differing by one bit are connected by an edge and only adjacent nodes, i.e. those nodes connected by an edge, can communicate and exchange data directly according to an update schedule. In a third embodiment, a hypercube scheme is used, but the number of nodes is assumed to be a power of 2 or N=2 m . This embodiment, like the second embodiment, uses the labeling of nodes by their binary representation, but the matchings of nodes used to determine the update schedule is not confined to the hypercube edges. Instead, a general cyclic matching scheme is used.
Inventors
- 👤 David J. Houck
- 👤 Kin K. Leung
- 👤 Peter M. Winkler
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 02:39
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17356; G06F15/17368; G06F15/17381
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
137 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a ShuffleNet topology to control the flow of new data among the computing nodes, wherein there are an even number, N=2m, of nodes in the network; organizing the computing nodes into two sets, X=x 0 , . . . , x m-1 and Y=y 0 , . . . , y m-1 , wherein the subscripts are always to be taken modulo m and x and y are used as set designations; synchronizing simultaneously the nodes in X with nodes in Y according to a matching between the two sets wherein rounds of communication are grouped into two batches.
Claim 2
Dependent Claim
137 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a ShuffleNet topology to control the flow of new data among the computing nodes, wherein there are an even number, N=2m, of nodes in the network; organizing the computing nodes into two sets, X=x 0 , . . . , x m-1 and Y=y 0 , . . . , y m-1 , wherein the subscripts are always to be taken modulo m and x and y are used as set designations; synchronizing simultaneously the nodes in X with nodes in Y according to a matching between the two sets wherein rounds of communication are grouped into two batches.
Claim 3
Dependent Claim
65 words
The method of claim 1 wherein each batch consists of rounds, R 2j-1 R 2j for j≧1, and in each odd batch, B 2j-1 , each x i synchronizes with y 2i+2j-2 and with y 2i+2j-1 and in even batches, B 2j , each y i synchronizes with x 2i+2j-2 and x 2i+2j-1 , i and j designate different integers corresponding to different nodes designations.
Claim 4
Dependent Claim
23 words
The method of claim 1 wherein a timer based schedule is utilized to synchronize the nodes in X with the nodes in Y.
Claim 5
Dependent Claim
24 words
The method of claim 1 wherein a precedence relationship based schedule is utilized to synchronize the nodes in X with the nodes in Y.
Claim 6
Dependent Claim
23 words
The method of claim 1 wherein a continuously repeating schedule is utilized to synchronize the nodes in X with the nodes in Y.
Claim 7
Dependent Claim
13 words
The method of claim 1 wherein the data files are global data files.
Claim 8
Dependent Claim
18 words
The method of claim 1 wherein the data files are a mixture of global and non-global data files.
Claim 9
Dependent Claim
100 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a hypercube topology to control the flow of new data among the computing nodes, wherein each node is labeled by a binary string and any two nodes which have their label differing by one bit are connected by an edge and only adjacent nodes can communicate and exchange data directly, wherein a timer based schedule is utilized to synchronize the computing nodes.
Claim 10
Dependent Claim
100 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a hypercube topology to control the flow of new data among the computing nodes, wherein each node is labeled by a binary string and any two nodes which have their label differing by one bit are connected by an edge and only adjacent nodes can communicate and exchange data directly, wherein a timer based schedule is utilized to synchronize the computing nodes.
Claim 11
Dependent Claim
38 words
The method of claim 8 wherein edges in round, R n , connect nodes with labels differing in their n th bit numbered in predetermined fashion and each round of connectivity corresponds to one round of synchronization sessions.
Claim 12
Dependent Claim
85 words
The method of claim 8 further comprising the steps of: labeling each of the N nodes by a binary string where the bits starting from the right are indexed by 0, 1, 2, . . . N; establishing rounds of the connection topology by connecting nodes with labels differing only in the i-bit position at each round R i where i=0, .left brkt-top.log 2 N.right brkt-top.-1; establishing one round of updates where each pair of adjacent nodes in the corresponding round of connectivity synchronize data.
Claim 13
Dependent Claim
101 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a hypercube topology to control the flow of new data among the computing nodes, wherein each node is labeled by a binary string and any two nodes which have their label differing by one bit are connected by an edge and only adjacent nodes can communicate and exchange data directly, wherein a precedence relationship based schedule is utilized to synchronize the computing nodes.
Claim 14
Dependent Claim
101 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a hypercube topology to control the flow of new data among the computing nodes, wherein each node is labeled by a binary string and any two nodes which have their label differing by one bit are connected by an edge and only adjacent nodes can communicate and exchange data directly, wherein a precedence relationship based schedule is utilized to synchronize the computing nodes.
Claim 15
Dependent Claim
100 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a hypercube topology to control the flow of new data among the computing nodes, wherein each node is labeled by a binary string and any two nodes which have their label differing by one bit are connected by an edge and only adjacent nodes can communicate and exchange data directly, wherein a continuously repeating schedule is utilized to synchronize the computing nodes.
Claim 16
Dependent Claim
100 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a hypercube topology to control the flow of new data among the computing nodes, wherein each node is labeled by a binary string and any two nodes which have their label differing by one bit are connected by an edge and only adjacent nodes can communicate and exchange data directly, wherein a continuously repeating schedule is utilized to synchronize the computing nodes.
Claim 17
Dependent Claim
123 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a generalized hypercube like topology to control the flow of data files among the computing nodes, wherein each node is labeled by a binary string and any two nodes labels x=(x 1 , . . . , x m ) which have a non-zero binary vector and pairs are matched such that a matching of pairs, M x , pairs a node labeled u with a node labeled x+u wherein the addition is coordinatewise and modulo 2, so that x+u+u=x and pair matching is symmetric.
Claim 18
Dependent Claim
123 words
A synchronization method for distributed processing systems having replicated data comprising the steps of: establishing a network of computing nodes, each node having at least one data file to be shared with at least one other node; implementing a generalized hypercube like topology to control the flow of data files among the computing nodes, wherein each node is labeled by a binary string and any two nodes labels x=(x 1 , . . . , x m ) which have a non-zero binary vector and pairs are matched such that a matching of pairs, M x , pairs a node labeled u with a node labeled x+u wherein the addition is coordinatewise and modulo 2, so that x+u+u=x and pair matching is symmetric.
Claim 19
Dependent Claim
27 words
The method of claim 13 wherein each pair of adjacent nodes in the topology can exchange data directly during a synchronized session at some point in time.
Claim 20
Dependent Claim
70 words
The method of claim 13 further comprising the step of cycling through matchings M x (1) . . . , M x (N-1), where the x(i)'s run through all the non-zero binary vectors of length m, thereby achieving a maximum update delay m if and only if for every i, the vectors x(i),x(i+1), . . . , x(i+m-1) with indices taken modulo n-1 are linearly independent over a predetermined function.
Claim 21
Dependent Claim
15 words
The method of claim 15 wherein the step of cycling utilizes a linear shift register.
Claim 22
Dependent Claim
16 words
The method of claim 13 wherein a non-global data files are updated without any intermediate nodes.
Claim 23
Dependent Claim
17 words
The method of claim 13 wherein a timer based schedule is utilized to synchronize the computing nodes.
Claim 24
Dependent Claim
18 words
The method of claim 13 wherein a precedence relationship based schedule is utilized to synchronize the computing nodes.
Claim 25
Dependent Claim
17 words
The method of claim 13 wherein a continuously repeating schedule is utilized to synchronize the computing nodes.
References Cited (Backward Citations)
US5255368A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-01-31 | 2003-08-02 | 2004-02-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-01-31 | 2007-08-02 | 2008-02-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-01-31 | 2011-08-02 | 2012-02-01 | $7700.00 | Window Closed / Lapsed |