# US 2018/0321990 A1 · Coalescing events framework

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

- Number: US 2018/0321990 A1
- Document ID: US20180321990A1
- Status: Published application
- Kind: A1
- Application number: 15/585,071
- Filed: 2017-05-02
- Published: 2018-11-08
- Earliest claimed: 2017-05-02
- Assignees: Facebook, Inc.
- Applicants: Facebook, Inc.
- Inventors: Andrew Lankes Street
- Web page: https://patentgrep.com/patent/US20180321990A1

## CPC

- G06F 9/542: {Event management; Broadcasting; Multicasting; Notifications}
- G06F 3/04883: for inputting data by handwriting, e.g. gesture or text
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Coalescing of events associated with an action is disclosed. In particular, the systems and methods can coalesce one or more events associated with an action to optimize processing and reduce jitters. The system first determines if the action can be coalesced. The system then determines a list of events associated with the action that can be coalesced. From that list, the system determines the optimum set(s) of events that are coalesced to minimize jitters. The optimum set(s) of events are then associated with the action, and executed. As a result, the processing of events triggered by an action is optimized and jitters in the resulting user-experience of the user are minimized.

## Claims

### Claim 1

A computer-readable storage medium storing instructions that, when executed by a computing system, cause the computing system to perform operations for coalescing events associated with an action, the operations comprising:
determining whether the action can be coalesced; and
in response to determining that the action can be coalesced:
determining list of events associated with the action, wherein the list of events includes events that can be coalesced;
determining a set of optimum events that can be coalesced, from the list of events associated with the action, to avoid jitters; and
associating the set of optimum events with the action.

### Claim 2 (depends on 1)

The computer-readable storage medium of claim 1 wherein the operations further comprising:
executing the set of optimum events associated with the action.

### Claim 3 (depends on 1)

The computer-readable storage medium of claim 1 wherein the action is associated with a tag indicating that it can be coalesced.

### Claim 4 (depends on 1)

The computer-readable storage medium of claim 1 wherein the action is in a list of actions that can be coalesced.

### Claim 5 (depends on 1)

The computer-readable storage medium of claim 1 wherein the determining whether the action can be coalesced is based on processing of one or more prior actions.

### Claim 6 (depends on 1)

The computer-readable storage medium of claim 1 wherein at least one event in the list of events is associated with a tag indicating that it can be coalesced.

### Claim 7

A method performed by a computing system having memory and a processor for coalescing events associated with an action, comprising:
determining whether the action can be coalesced; and
in response to determining that the action can be coalesced:
determining list of events associated with the action, wherein the list of events includes events that can be coalesced;
determining a set of optimum events that can be coalesced, from the list of events associated with the action, to avoid jitters; and
associating the set of optimum events with the action.

### Claim 8 (depends on 7)

The method of claim 7 wherein further comprising:
executing the set of optimum events associated with the action.

### Claim 9 (depends on 7)

The method of claim 7 wherein the action is associated with a tag indicating that it can be coalesced.

### Claim 10 (depends on 7)

The method of claim 7 wherein the action is in a list of actions that can be coalesced.

### Claim 11 (depends on 7)

The method of claim 7 wherein the determining whether the action can be coalesced is based on processing of one or more prior actions.

### Claim 12 (depends on 7)

The method of claim 7 wherein at least one event in the list of events is associated with a tag indicating that it can be coalesced.

### Claim 13 (depends on 7)

The method of claim 7 wherein the set of optimum events is based on a predetermined parameter.

### Claim 14

A system for coalescing events associated with an action, comprising:
at least one hardware processor coupled to a network; and,
a memory configured to store processor-executable components, wherein the processor-executable components further comprises:
a component for determining whether the action can be coalesced; and
in response to determining that the action can be coalesced:
a component for determining list of events associated with the action, wherein the list of events includes events that can be coalesced;
a component for determining a set of optimum events that can be coalesced, from the list of events associated with the action, to avoid jitters; and
a component for associating the set of optimum events with the action.

### Claim 15 (depends on 14)

The system of claim 14 wherein the processor-executable components further comprises:
a component for executing the set of optimum events associated with the action.

### Claim 16 (depends on 14)

The system of claim 14 wherein the action is associated with a tag indicating that it can be coalesced.

### Claim 17 (depends on 14)

The system of claim 14 wherein the action is in a list of actions that can be coalesced.

### Claim 18 (depends on 14)

The system of claim 14 wherein the determining whether the action can be coalesced is based on processing of one or more prior actions.

### Claim 19 (depends on 14)

The system of claim 14 wherein at least one event in the list of events is associated with a tag indicating that it can be coalesced.

### Claim 20 (depends on 14)

The system of claim 14 wherein the set of optimum events is based on a predetermined parameter.