IP Library Granted Patent US 11,086,689
Granted Patent B2
US 11,086,689 · App. 16/312,968 · Granted Aug 10, 2021

Method for automatically and dynamically assigning the responsibility for tasks to the available computing components in a highly distributed data-processing system

Inventors: Michael Glässel (Berlin, DE); Jens-Peter Haack (Berlin, DE); Felix Schmid (Berlin, DE); Gernot Sänger (Berlin, DE)
Assignee: ATOS CONVERGENCE CREATORS GMBH
G06F9/5083G06F9/4881G06F9/5027G06F9/5072G06F16/2246
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,086,689
App. No.
16/312,968
Granted
Aug 10, 2021
Kind
B2
Abstract

The invention relates to a method for automatically and dynamically assigning the responsibility for tasks to the available computing components in a highly distributed data-processing system. The invention relates to a method by means of which the assignment of the responsibility for certain tasks (partitions) is adapted in a highly distributed data-processing system.

Claims (7)

1. A method for assigning tasks to available target computing components in a highly distributed data-processing system, comprising:

splitting a given task as required, by a source component which is handling said given task and assigning a part of the subtasks thus obtained to the target computing components, and

assigning a characteristic value to each task and carrying out the assignment to a computing component based on said characteristic value,

wherein a binary representation of the characteristic value is used as a basis for searching for a responsible target computing component, a given task being assigned to a given computing component if the binary representation of the characteristic value of said given task falls within a defined value range of characteristic values assigned to said given component; and

wherein starting with the most significant bit of the characteristic value the entry for the responsible computing component is searched for in a binary tree structure that supports the partitioning of subtasks by replacing one partition entry in the binary tree structure by two new entries whose prefix has been extended by one bit.

2. The method as claimed in claim 1 , wherein the need to partition a task is determined based on the utilization of the available computing components of the system.

3. The method as claimed in claim 1 , wherein one computing component handles a plurality of tasks.

Assignments (3)
MERGER Recorded Feb 10, 2023
From: ATOS CONVERGENCE CREATORS GMBH
To: ATOS IT SOLUTIONS AND SERVICES GMBH
Reel/Frame 062651/0830 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 6, 2022
From: ATOS IT SOLUTIONS AND SERVICES GMBH
To: BULL SAS
Reel/Frame 061620/0515 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 29, 2019
From: GLÄSSEL, MICHAEL; SÄNGER, GERNOT; HAACK, JENS-PETER; SCHMID, FELIX
To: ATOS CONVERGENCE CREATORS GMBH
Reel/Frame 049302/0565 →
Priority Claims (1)
AT A 50566/2016 · Jun 22, 2016 · national
Continuity (1)
Related Publication 20190227852A1 · Jul 25, 2019