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.

Date of Patent:
Jul. 13, 2021

Filed:

Feb. 06, 2019
Applicant:

Sap SE, Walldorf, DE;

Inventors:

Mandar Khadilkar, San Jose, CA (US);

Prajakta Saket Dandawate, Los Gatos, CA (US);

Mudit Srivastava, Berlin, DE;

Daniel Culp, San Jose, CA (US);

Assignee:

SAP SE, Walldorf, DE;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 9/48 (2006.01); G06F 9/50 (2006.01); G06F 9/54 (2006.01); H04B 10/27 (2013.01); H04B 10/275 (2013.01);
U.S. Cl.
CPC ...
G06F 9/4881 (2013.01); G06F 9/48 (2013.01); G06F 9/4806 (2013.01); G06F 9/4843 (2013.01); G06F 9/4856 (2013.01); G06F 9/50 (2013.01); G06F 9/5005 (2013.01); G06F 9/54 (2013.01); G06F 9/546 (2013.01); H04B 10/27 (2013.01); H04B 10/275 (2013.01); H04B 10/2755 (2013.01);
Abstract

Techniques and solutions are described for providing high-availability computing resources to service client requests. Groups of computing nodes are organized into loops, a given loop being configured to execute a particular subset of tasks, such as tasks with a hash value in a particular ranged serviced by a loop. Computing nodes within a loop can evaluate a task request to determine whether the task request conflicts with another task currently assigned to a node. If a computing node which sent out a task request determines that no conflict was identified, it can execute the task request. Communications within a loop can occur unidirectionally, such that a node which initiated a communication will receive the communication from the last loop node. Loops can be connected to form a ribbon, the ribbon providing a namespace for task execution, where hash ranges for the namespace are uniquely assigned to loops of the ribbon.


Find Patent Forward Citations

Loading…