US6003091A - Verifying a time-of-day counter - Google Patents
Verifying a time-of-day counter Download PDFInfo
- Publication number
- US6003091A US6003091A US08/831,540 US83154097A US6003091A US 6003091 A US6003091 A US 6003091A US 83154097 A US83154097 A US 83154097A US 6003091 A US6003091 A US 6003091A
- Authority
- US
- United States
- Prior art keywords
- tod
- switching element
- primary
- node
- computer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
- G06F1/04—Generating or distributing clock signals or signals derived directly therefrom
- G06F1/14—Time supervision arrangements, e.g. real time clock
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0685—Clock or time synchronisation in a node; Intranode synchronisation
Definitions
- the present invention generally relates to time-of-day counters in computer systems. More particularly, the present invention relates to distributing and verifying a time-of-day counter in a quiesced and synchronous distributed computer system.
- TOD time-of-day
- the present invention provides a way to verify the validity of TOD counters in quiesced and synchronous distributed data processing systems, as well as an article of manufacture for accomplishing same.
- the present invention provides, in a first aspect, a method of distributing and verifying a time-of-day (TOD) in a quiesced and synchronous distributed data processing system including a primary node, at least one secondary node and at least one switching element between the primary node and the at least one secondary node, wherein a primary TOD has been set for the primary node.
- the method comprises steps of: setting a TOD for the at least one switching element, based on the primary TOD; verifying the TOD of the at least one switching element; setting a TOD for the at least one secondary node based on the primary TOD; and verifying the TOD of the at least one secondary node.
- the present invention provides, in a second aspect, an article of manufacture, comprising a computer useable medium having computer readable code means embodied therein for causing the processing of data.
- the computer readable program code means in the article of manufacture comprises a computer readable program code means for causing a computer to effect, in a quiesced and synchronous distributed data processing system, including a primary node, at least one secondary node and at least one switching element between the primary node and the at least one secondary node, wherein the primary TOD has been set for the primary node, setting a TOD for the at least one switching element based on the primary TOD.
- the computer readable program code means in the article of manufacture further comprises computer readable program code means for causing a computer to effect verifying the TOD of the at least one switching element, computer readable program codes for causing a computer to effect setting a TOD for the at least one secondary node based on the primary node, and computer readable program codes means for causing a computer to effect verifying the TOD of the at least one secondary node.
- FIG. 1 is a simplified block diagram of a data processing system in which the present invention is useful.
- FIG. 2 depicts a TOD counter in the data processing system of FIG. 1.
- FIG. 3 is a conceptual block diagram of a service packet used with the present invention.
- FIG. 4 is a conceptual block diagram of another service packet used with the present invention.
- FIG. 5 is a block diagram of a switch board in the data processing system of FIG. 1.
- FIG. 6 is a block diagram of a communication adapter in the data processing system of FIG. 1.
- FIGS. 7 and 8 comprise a flow diagram for the TOD verification method of the present invention as it relates to switching elements.
- FIG. 9 is a flow diagram for the TOD verification method of the present invention as it relates to secondary nodes and their associated communication adapters.
- FIG. 10 is a flow diagram for one embodiment of a self-verifying method useful with the present invention.
- node refers to a portion of a data processing system including a processor, a node communication adapter and controlling software.
- node communication adapter refers to a portion of a node that facilitates communication between nodes in a computer network.
- switch element refers to switch chips and/or switch boards, which are the switching elements in the communication fabric of a computer network.
- communication fabric refers to switch elements, node communication adapters and links between them in a given computer network.
- switch network refers to all of the switching elements in a given computer network.
- the term “quiesced” refers to a computer network with no activity on the communication fabric (i.e., no nodes are communicating with one another). The state of being “quiesced” most often takes place at start up, but could take place at other times.
- the present invention can be included in an article of manufacture (e.g., one or more computer program products) having, for instance, computer useable media.
- the media has embodied therein, for instance, computer readable program code means for providing and facilitating the mechanisms of the present invention.
- the article of manufacture can be included as part of a computer system or alone.
- FIG. 1 is a partial block diagram of a computer system 10 useful with the present invention.
- Computer system 10 is networked and comprises a primary node 12 including a communication adapter 14, switching elements 16 and 18, and a secondary node 20 including a communication adapter 22 associated therewith. It will be understood that each node also includes controlling software.
- FIG. 2 depicts a TOD counter present in each of the switch elements and communication adapters of computer system 10 of FIG. 1.
- TOD counter 24 comprises a 63-bit monotonically increasing counter operating at 75 MHz.
- the 64th bit 26 of TOD counter 24 serves as a valid bit, used to determine if the TOD has been previously set. All of the TOD counters in computer system 10 run according to a single oscillator or clock (not shown), such that each of the TOD counters increments during each period of the oscillator, thereby causing the TOD counters to increment at the same frequency.
- a protocol using service packets will hereafter be described, the service packets being useful in synchronizing the TOD counters for the communication fabric, within an acceptable margin, with the designated primary node's TOD.
- the process used to synchronize the TOD counters in the communication fabric is a store-and-forward type process, where the primary node sets the local TOD counter on its associated communication adapter, then sets the TOD on the first switching element of the network. It then directs the first switching element to set the TOD in the adjacent switching element(s), until the entire switch network has been initialized.
- the switch network has a tree structure where a given switch element at one level is adjacent to one or more switch elements at the next lower level.
- Each of the secondary nodes sets its own TOD counter from the switch network by requesting a copy of the TOD from an adjacent switch element in response to an instruction from the primary node.
- an acknowledge is generated that includes a current TOD. The acknowledge is used to verify the TOD that has been set.
- FIG. 3 is a conceptual block diagram of a service packet 28 used by switch elements and communication adapters in system 10 for setting a TOD (herein after referred to as a "SET TOD service packet").
- SET TOD service packet 28 comprises, for byte 0 (element 30 in FIG. 3) a hexadecimal command to set the TOD.
- Bytes 1 and 2-7 (elements 32 and 34 in FIG. 3) are reserved.
- Bytes 8-14 (element 36 in FIG. 3) comprise a TOD current as of the time it is sent, inserted by the transmitting device.
- Byte 15 (element 38 in FIG. 3) comprises an offset for the calculated transmission delay time.
- the transmission delay time is a known hardware delay time, equalling the time it takes to get out of the sending element, through the transmission medium (e.g., a cable) and into the receiving element. Note, however, that without knowing the length or type of transmission medium, the time through the transmission medium must be estimated.
- the reception of a SET TOD service packet by a communication adapter does not occur when other traffic is arriving. This could cause unpredictable delays in the processing of the TOD service packet, and the subsequent synchronization of the TOD counter may not be accurate.
- the delays stem from the service packet having to wait for the processing of previously received data packets.
- FIG. 4 is a conceptual block diagram of a service packet 40 used by the communication subsystem (not shown) to generate a SET TOD service packet in a switch or adapter (hereinafter referred to as a "SEND TOD service packet").
- SEND TOD service packet Byte 0 of the SEND TOD service packet (element 42 in FIG. 4) comprises a hexadecimal command to forward a current TOD.
- Bytes 1 and 2-6 (elements 44 and 46 in FIG. 4) are reserved.
- Byte 7 identifies the output port of the switching element receiving the service packet to be used to forward the TOD.
- Bytes 8-14 (element 50 in FIG. 4) are reserved, and byte 15 (element 52 in FIG. 4) comprises an offset for the calculated transmission delay time.
- the transmission delay time is a known hardware delay time, equalling the time it takes to get out of the sending element, through the transmission medium (e.g., a cable) and into the receiving element.
- FIG. 5 is a block diagram of switch element 16 (in this case, a switch board) in FIG. 1.
- Switch element 16 comprises 8 switch chips (e.g., switch chip 54).
- Switch element 16 has 32 send ports and 32 receive ports.
- FIG. 6 is a high-level block diagram of communication adapter 14 of FIG. 1.
- a communication adapter is a means of communicating from one node to another over the communication fabric.
- a communication adapter facilitates communication between node processors (and their memories) over the switch fabric.
- the TOD is maintained in every switch element and communication adapter in the system.
- the TOD in a given communication adapter is provided as a facility to applications for synchronizing parallel processes and ordering of events and transactions.
- the TOD in a switch element is used for synchronizing the TOD in a communication adapter in an active system.
- the TOD counters throughout the communication fabric will be synchronized with the TOD of the communication adapter associated with the primary node. Synchronization could be indicated by, for example, the most significant bit in the TOD counter. This bit could be set at the primary node, before TOD initialization begins.
- a switch element will not forward the TOD if it has not been previously synchronized, rather, the switch element will report an error. This prevents the propagation of bad information.
- FIGS. 7 and 8 comprise a flow diagram for the propagation of the TOD between switch elements in system 10 of FIG. 1.
- the software at the primary node sets the TOD for the communication adapter associated with the primary node (Step 100, "SET PRIMARY NODE TOD").
- the mechanics of setting the TOD for the primary node will vary from system to system, and is not important for an understanding of the present invention.
- the primary node sends a SET TOD service packet to the first switching element (Step 102, "SET TOD SENT FROM PRIMARY NODE TO FIRST SWITCHING ELEMENT").
- the first switching element sets it TOD (Step 104, "FIRST SWITCHING ELEMENT SETS TOD").
- An acknowledgement is then sent from the first switching element to the primary node, which acknowledgment includes the TOD the first switching element just set for itself (Step 106, "ACKNOWLEDGE TOD SENT FROM FIRST SWITCHING ELEMENT TO PRIMARY NODE”).
- the primary node attempts to verify the acknowledge TOD (Inquiry 108, "VERIFIED?"). If the acknowledged TOD is not verified, the method returns to Step 102.
- the primary node sends a SEND TOD service packet to the first switching element (Step 110, "SEND TOD SENT FROM PRIMARY NODE TO FIRST SWITCHING ELEMENT”).
- the SEND TOD service packet causes the first switching element to send a SET TOD service packet to the second switching element (Step 112, "SET TOD SENT FROM FIRST SWITCHING ELEMENT TO SECOND SWITCHING ELEMENT”).
- the second switching element sets its own TOD (Step 114, "SECOND SWITCHING ELEMENT SETS TOD").
- the second switching element sends an acknowledge TOD to the primary node for verification (Step 116, "ACKNOWLEDGE TOD SENT FROM SECOND SWITCHING ELEMENT TO PRIMARY NODE”).
- the primary node then proceeds to verify the acknowledge TOD (Inquiry 118, "VERIFIED?"). If the acknowledge TOD is not verified, the method tries again, i.e., returns to step 110, until verification fails a predetermined number of times (Inquiry 119, "VERIFICATION FAILED?"), at which point an error message is produced at the primary node, indicating that initialization has failed (Step 120, "ERROR MESSAGE AT PRIMARY NODE").
- the primary node If the primary node verifies the acknowledge TOD from the second switching element, the primary node sends a SEND TOD service packet to the second switching element (Step 121, "SEND TOD SENT FROM PRIMARY NODE TO SECOND SWITCHING ELEMENT"). The method continues in this manner until all switching elements in the system have set their TOD.
- the switch network has a tree structure where a given switch element at one level is adjacent to one or more switch elements at the next lower level. The details of verification will be described below.
- FIG. 9 is a flow diagram for the propagation of the TOD to the communication adapters in system 10 of FIG. 1.
- the primary node determines and identifies "routes" to get from node to node. Once these routes are identified, the primary node instructs the secondary nodes to proceed with setting the TOD for their associated communication adapter (Step 122, "PRIMARY NODE INSTRUCTS SECONDARY NODE(S) TO SET TOD").
- the command from the primary node is serial, rather than being broadcast. However, it will be understood that other command delivery methods could be used.
- each secondary node sends a SEND TOD service packet to an adjacent switching element (Step 124, "SECONDARY NODE SENDS SEND TOD TO ADJACENT SWITCHING ELEMENT”).
- the adjacent switching element then sends the SET TOD service packet to the secondary node (Step 126, "ADJACENT SWITCHING ELEMENT SENDS SET TOD TO SECONDARY NODE”).
- the communication adapter associated with the secondary node sets the TOD therefore (Step 128, "SECONDARY NODE SETS TOD").
- the secondary node then self-verifies the TOD just set, and if not verified, returns to Step 124 (Inquiry 129, "SELF VERIFIED?").
- the self verification is attempted a predetermined number of times. If the secondary node is still unable to self verify, an error is produced at the primary node, indicating that the secondary node cannot be communicated with (Inquiry 130, "VERIFICATION FAILED?"; and Step 131, "ERROR MESSAGE AT PRIMARY NODE").
- the secondary node may self-verify its TOD
- two exemplary methods for self-verifying will be described herein.
- the first, and simplest, way for the secondary node to self-verify is simply to check the valid bit (see the description of FIG. 2 above) of the TOD sent to the secondary node by the adjacent switching element.
- This method of self-verifying is preferred where the path between the secondary node and adjacent switch is relatively short, such that the transmission delay is negligible.
- the fixed length of cable between the secondary node and the adjacent switch could be, for example, 3-5 feet in length and be considered short.
- FIG. 10 is a flow diagram for an alternative way for the secondary node to self-verify.
- the secondary node first sends a SEND TOD service packet to the adjacent switch (Step 132, "SECONDARY NODE SENDS SEND TOD TO ADJACENT SWITCH”).
- the adjacent switch sends a SET TOD service packet to the secondary node (Step 134, "ADJACENT SWITCH SENDS SET TOD TO SECONDARY NODE”).
- the secondary node then sends a SET TOD to the adjacent switch (Step 136, "SECONDARY NODE SENDS SET TOD TO ADJACENT SWITCH”).
- Step 138 the adjacent switch sends an acknowledge TOD to the primary node (Step 138, "ADJACENT SWITCH SENDS ACKNOWLEDGE TOD TO PRIMARY NODE").
- the primary node attempts to verify the acknowledge TOD (Inquiry 140, "VERIFIED BY PRIMARY?”). If the primary node is unable to verify the acknowledge TOD, preferably a predetermined number of attempts is made, i.e., the method returns to Step 134 (Inquiry 141, "VERIFICATION FAILED?") until the predetermined number of attempts has been made. If the primary node is still unable to verify, an error message is produced at the primary node (Step 142, "ERROR MESSAGE AT PRIMARY NODE”), indicating that that secondary node cannot be communicated with.
- the secondary node sends a SEND TOD service packet to the adjacent switch (Step 143, "SECONDARY NODE SENDS SEND TOD TO ADJACENT SWITCH”).
- the adjacent switch sends a SET TOD service packet to the secondary node (Step 144, "ADJACENT SWITCH SENDS SET TOD TO SECONDARY NODE”).
- the secondary node then checks the valid bit in the TOD from the adjacent switch (Inquiry 146, "VALID BIT ON?"). If the valid bit is not on, the method returns to Step 124 in FIG. 9. If the valid bit is on, the secondary node has verified the TOD.
- n is the total number of links the acknowledge TOD must traverse, where a "link” is defined as a path (e.g., a cable) from one switching element to another or from a switching element to a communication adapter.
- the variable "Dnode” is a reception delay of the primary node (i.e., a delay at the associated communication adapter).
- the variable "Dlink” is an estimated delay for a given link.
- the variable “Dswitch” is a propagation delay of an intermediate switching element between a switching element sending an acknowledge TOD to the primary node and the primary node.
- the "X" indicates multiplication.
- variable "Dgen” is a generation delay for the acknowledge TOD.
- the TOD when the primary node captures an acknowledge TOD from a switch element should equal the TOD embedded in the acknowledge TOD plus the delay time computed according to the above formula.
- systems are generally not ideal, and there must be some tolerance built in. In the present exemplary embodiment, the tolerance is three microseconds. The tolerance must be less than the minimum latency of getting the message from one node to the next, such that transaction ordering can be maintained. However, it will be understood that a greater or lesser tolerance could be adopted for a given system. Preferably, if the tolerance is not met, further attempts are made at resetting the TOD for that switch element or secondary node.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims (20)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/831,540 US6003091A (en) | 1997-04-08 | 1997-04-08 | Verifying a time-of-day counter |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/831,540 US6003091A (en) | 1997-04-08 | 1997-04-08 | Verifying a time-of-day counter |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| US6003091A true US6003091A (en) | 1999-12-14 |
Family
ID=25259285
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US08/831,540 Expired - Fee Related US6003091A (en) | 1997-04-08 | 1997-04-08 | Verifying a time-of-day counter |
Country Status (1)
| Country | Link |
|---|---|
| US (1) | US6003091A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6209106B1 (en) * | 1998-09-30 | 2001-03-27 | International Business Machines Corporation | Method and apparatus for synchronizing selected logical partitions of a partitioned information handling system to an external time reference |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4803708A (en) * | 1986-09-11 | 1989-02-07 | Nec Corporation | Time-of-day coincidence system |
| US4939753A (en) * | 1989-02-24 | 1990-07-03 | Rosemount Inc. | Time synchronization of control networks |
| US5146585A (en) * | 1988-10-25 | 1992-09-08 | International Business Machines Corporation | Synchronized fault tolerant clocks for multiprocessor systems |
| US5327468A (en) * | 1992-06-19 | 1994-07-05 | Westinghouse Electric Corp. | Synchronization of time-of-day clocks in a distributed processing network system |
| US5371733A (en) * | 1993-03-04 | 1994-12-06 | International Business Machines Corporation | Method and apparatus for centralized determination of virtual transmission delays in networks of counter-synchronized communication devices |
| US5481573A (en) * | 1992-06-26 | 1996-01-02 | International Business Machines Corporation | Synchronous clock distribution system |
| US5500897A (en) * | 1993-07-22 | 1996-03-19 | International Business Machines Corporation | Client/server based secure timekeeping system |
| US5504878A (en) * | 1991-02-04 | 1996-04-02 | International Business Machines Corporation | Method and apparatus for synchronizing plural time-of-day (TOD) clocks with a central TOD reference over non-dedicated serial links using an on-time event (OTE) character |
| US5579513A (en) * | 1991-12-18 | 1996-11-26 | Siemens Aktiengesellschaft | Method for monitoring the synchronization of clocks in computer networks |
| US5636373A (en) * | 1991-09-04 | 1997-06-03 | International Business Machines Corporation | System for synchronizing logical clock in logical partition of host processor with external time source by combining clock adjustment value with specific value of partition |
| US5870427A (en) * | 1993-04-14 | 1999-02-09 | Qualcomm Incorporated | Method for multi-mode handoff using preliminary time alignment of a mobile station operating in analog mode |
-
1997
- 1997-04-08 US US08/831,540 patent/US6003091A/en not_active Expired - Fee Related
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4803708A (en) * | 1986-09-11 | 1989-02-07 | Nec Corporation | Time-of-day coincidence system |
| US5146585A (en) * | 1988-10-25 | 1992-09-08 | International Business Machines Corporation | Synchronized fault tolerant clocks for multiprocessor systems |
| US4939753A (en) * | 1989-02-24 | 1990-07-03 | Rosemount Inc. | Time synchronization of control networks |
| US5504878A (en) * | 1991-02-04 | 1996-04-02 | International Business Machines Corporation | Method and apparatus for synchronizing plural time-of-day (TOD) clocks with a central TOD reference over non-dedicated serial links using an on-time event (OTE) character |
| US5636373A (en) * | 1991-09-04 | 1997-06-03 | International Business Machines Corporation | System for synchronizing logical clock in logical partition of host processor with external time source by combining clock adjustment value with specific value of partition |
| US5579513A (en) * | 1991-12-18 | 1996-11-26 | Siemens Aktiengesellschaft | Method for monitoring the synchronization of clocks in computer networks |
| US5327468A (en) * | 1992-06-19 | 1994-07-05 | Westinghouse Electric Corp. | Synchronization of time-of-day clocks in a distributed processing network system |
| US5481573A (en) * | 1992-06-26 | 1996-01-02 | International Business Machines Corporation | Synchronous clock distribution system |
| US5371733A (en) * | 1993-03-04 | 1994-12-06 | International Business Machines Corporation | Method and apparatus for centralized determination of virtual transmission delays in networks of counter-synchronized communication devices |
| US5870427A (en) * | 1993-04-14 | 1999-02-09 | Qualcomm Incorporated | Method for multi-mode handoff using preliminary time alignment of a mobile station operating in analog mode |
| US5500897A (en) * | 1993-07-22 | 1996-03-19 | International Business Machines Corporation | Client/server based secure timekeeping system |
Non-Patent Citations (6)
| Title |
|---|
| Andrew S. Tanenbaum; Structured Computer Organization, 2nd Edition; pp. 10 12, 1984. * |
| Andrew S. Tanenbaum; Structured Computer Organization, 2nd Edition; pp. 10-12, 1984. |
| B. Abali, C.B. Stunkel and C. Benveniste, "Clock Synchronization on a Multicomputer," Journal of Parallel and Distributed Computing, vol. 40, pp. 118-130 (1997). |
| B. Abali, C.B. Stunkel and C. Benveniste, Clock Synchronization on a Multicomputer, Journal of Parallel and Distributed Computing, vol. 40, pp. 118 130 (1997). * |
| T. Basil Smith et al.; The IBM S/390 Sysplex Timer; Fault Tolerant Computing, 1991 Int l Symposium; pp. 144 151, Jun. 1991. * |
| T. Basil Smith et al.; The IBM S/390 Sysplex Timer; Fault-Tolerant Computing, 1991 Int'l Symposium; pp. 144-151, Jun. 1991. |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6209106B1 (en) * | 1998-09-30 | 2001-03-27 | International Business Machines Corporation | Method and apparatus for synchronizing selected logical partitions of a partitioned information handling system to an external time reference |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5925107A (en) | Verifying a time-of-day counter | |
| US6351821B1 (en) | System and method for synchronizing time across a computer cluster | |
| US6526447B1 (en) | Apparatus for restarting interrupted data transfer and method therefor | |
| EP1239620A2 (en) | Relative time synchronization between three or more systems | |
| CN101595669B (en) | Method and device for exchanging information for facilitating synchronization of time network | |
| EP0303830B1 (en) | Multicast data distribution system | |
| JP5190586B2 (en) | Communication method and apparatus for efficient and secure transmission of TT Ethernet messages | |
| EP0135499B1 (en) | A method for achieving multiple processor agreement optimized for no faults | |
| Dolev et al. | Early delivery totally ordered multicast in asynchronous environments | |
| Cristian et al. | Probabilistic internal clock synchronization | |
| US7124319B2 (en) | Delay compensation for synchronous processing sets | |
| EP1215559A2 (en) | Method and system for time synchronization | |
| CN101217429B (en) | Method for Determining Initiation Relationship Between TCP Messages Based on TCP Timestamp Options | |
| US20020039370A1 (en) | Precise network time transfer | |
| Tomlinson | Selecting sequence numbers | |
| JPS6066538A (en) | Method of synchronizing clock | |
| EP0539704A1 (en) | An architecture for the accurate distribution of a network wide time reference value on a ring topology local area network | |
| US5504878A (en) | Method and apparatus for synchronizing plural time-of-day (TOD) clocks with a central TOD reference over non-dedicated serial links using an on-time event (OTE) character | |
| US6502141B1 (en) | Method and system for approximate, monotonic time synchronization for a multiple node NUMA system | |
| Baratz et al. | Reliable link initialization procedures | |
| US20030182444A1 (en) | Distributed system with an efficient atomic broadcast mechanism | |
| US6003091A (en) | Verifying a time-of-day counter | |
| AU620754B2 (en) | Improved synchronization technique | |
| Thambidurai et al. | Clock synchronization in MAFT | |
| Lukac et al. | Disruption tolerant shell |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BARTFAI, ROBERT F.;GARMIRE, DERRICK L.;HERRING, JAY R.;AND OTHERS;REEL/FRAME:008680/0105;SIGNING DATES FROM 19970604 TO 19970805 |
|
| FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
| FPAY | Fee payment |
Year of fee payment: 4 |
|
| AS | Assignment |
Owner name: CITICORP USA, INC., AS TERM C LOAN COLLATERAL AGEN Free format text: SECURITY AGREEMENT;ASSIGNOR:BREED AUTOMOTIVE TECHNOLOGY, INC.;REEL/FRAME:014428/0283 Effective date: 20030425 Owner name: CITICORP USA, INC., AS TERM C LOAN COLLATERAL AGENT AND CITICORP USA, INC. AS ADMINISTRATIVE AGENT, NEW YORK Free format text: SECURITY AGREEMENT;ASSIGNOR:BREED AUTOMOTIVE TECHNOLOGY, INC.;REEL/FRAME:014428/0283 Effective date: 20030425 |
|
| REMI | Maintenance fee reminder mailed | ||
| LAPS | Lapse for failure to pay maintenance fees | ||
| STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
| FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20071214 |