The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 01, 2000
Filed:
Feb. 10, 1997
David J Houck, Colts Neck, NJ (US);
Kin K Leung, Edison, NJ (US);
Peter M Winkler, Madison, NJ (US);
Lucent Techologies Inc., Murrray Hill, NJ (US);
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.sub.0, . . . , x.sub.m-1 and Y=y.sub.0, . . . , y.sub.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.sub.j which consists of rounds R.sub.2j-1 and R.sub.2j-2 for j.gtoreq.1. During each odd batch B.sub.2j-1, each x.sub.i synchronizes with y.sub.2i+2j-2 and with y.sub.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.sup.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.