# US 2018/0321706 A1 · Timestamp Alignment Across a Plurality Of Computing Devices

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0321706 A1
- Document ID: US20180321706A1
- Status: Published application
- Kind: A1
- Application number: 16/036,634
- Filed: 2018-07-16
- Published: 2018-11-08
- Earliest claimed: 2015-12-09
- Assignees: Red Hat, Inc.
- Applicants: Red Hat, Inc.
- Inventors: Gary Peter Brown
- Web page: https://patentgrep.com/patent/US20180321706A1

## CPC

- G06F 1/14: Time supervision arrangements, e.g. real time clock
- H04J 3/0638: {Clock or time synchronisation among nodes; Internode synchronisation (synchronization for ring networks H04L12/422; data switching networks with synchronous transmission H04L12/43)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)

## Abstract

Methods, systems, and computer program products are included for aligning timestamps of activities. A method includes receiving a first entry from a first server, the first entry corresponding to an activity, wherein the first entry includes a first timestamp corresponding to the activity. The method further includes receiving a second entry from a second serve, the second entry including a second entry corresponding to the activity, wherein the second entry includes a second timestamp corresponding to the activity. The method further includes determining an aligned timestamp of the activity by adjusting the first timestamp or the second timestamp by an offset.

## Claims

### Claim 1

A computer-implemented method, the method comprising:
receiving a first entry from a first server, the first entry corresponding to an activity, wherein the first entry includes a first timestamp corresponding to the activity;
receiving a second entry from a second server, the second entry including a second entry corresponding to the activity, wherein the second entry includes a second timestamp corresponding to the activity; and
determining an aligned timestamp of the activity by adjusting the first timestamp or the second timestamp by an offset.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the adjusting includes incrementing the first timestamp by the offset.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, further comprising a first time duration corresponding to a first activity and a second time duration corresponding to a second activity, and wherein the offset is equal to one-half of a difference between the first time duration and the second time duration.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, the method further comprising:
querying a data store that includes one or more offsets, wherein an input of the query includes a first server identifier corresponding to the first server and a second server identifier corresponding to the second server.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein the first server identifier comprises at least one identifier selected from the group consisting of: (1) a geographic location identifier and (2) an internet address identifier.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, further comprising:
updating the aligned timestamp by adjusting one or more other timestamps corresponding to activities performed on one or more servers by the offset.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the first timestamp corresponds to a start time of the activity.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, where the third data structure is a tree data structure.

### Claim 9

A non-transitory computer-readable medium comprising computer-readable instructions executable by a processor to cause the processor to:
receive a first set of entries from a first server based on a first criterion and a second set of entries from a second server based on a second criterion, wherein each entry in the first set of entries and the second set of entries includes a corresponding identifier and a corresponding timestamp;
identify a first entry including a first timestamp and a first identifier in the first set of entries and a second entry including a second timestamp and a second identifier in the second set of entries, wherein the first identifier matches with the second identifier; and
determine an aligned timestamp for the first entry or the second entry.

### Claim 10 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the determining the aligned timestamp includes incrementing the first timestamp by an offset.

### Claim 11 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein the offset is equal to one-half of a difference between the first timestamp and the second timestamp.

### Claim 12 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the offset is determined based on a query of a data store.

### Claim 13 (depends on 12)

The non-transitory computer-readable medium of claim 12, wherein the query includes an input of at least one identifier corresponding to a computing device from which the first data structure or the second data structure is received, the at least one identifier selected from the group consisting of: a geographic location identifier and an internet address identifier.

### Claim 14 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein a transaction application receives the first set of entries and the second set of entries.

### Claim 15

A system comprising:
a processor and a non-transitory computer-readable storage medium;
a data structure stored in the non-transitory computer-readable storage medium, the data structure including a first entry received from a first computing device and a second entry received from a second computing device,
wherein the first entry includes a first node corresponding to an activity, the first node comprising a first identifier and a first timestamp corresponding to the activity,
wherein the second entry includes a second node corresponding to the activity, the second node comprising a second identifier and a second timestamp corresponding to the activity, the second timestamp being different than the first timestamp, and
wherein the processor assigns a new timestamp, the new timestamp being incremented by an offset from the first timestamp.

### Claim 16 (depends on 15)

The system of claim 15, the processor further to receive the one or more offsets from a cache.

### Claim 17 (depends on 15)

The system of claim 15, the processor further to receive the one or more offsets from a data store.

### Claim 18 (depends on 15)

The system of claim 15, wherein the offset is half the difference between the first timestamp and the second timestamp.

### Claim 19 (depends on 15)

The system of claim 15, further comprising a server including an application which aggregates one or more distributed transactions into an aligned transaction, the one or more distributed transactions corresponding to the activity.

### Claim 20 (depends on 15)

The system of claim 15, wherein the one or more distributed transactions include one or more requests.
