Google patents method to balance data workloads across servers
This patent describes a system that automatically moves chunks of data between computers to prevent any single machine from becoming overloaded. It works by identifying the busiest computer, copying its data to a less busy one, and then splitting the work between them before removing the copy.
In the filing’s own words
Methods, systems, and apparatus for automatic sharding and load balancing in a distributed data processing system. In one aspect, a method includes determining workload distribution for an application across worker computers and in response to determining a load balancing operation is required: selecting a first worker computer having a highest load measure relative to respective load measure of the other work computers; determining one or more move operations for a partition of data assigned to the first worker computer and a weight for each move operation; and selecting the move operation with a highest weight the selected move operation.
What exactly they claim (claim 1)
1. A computer-implemented method executed by data processing hardware that causes the data processing hardware to perform operations comprising: partitioning a data set for an application job into a plurality of partitions based on a key; assigning, to each worker computer in a set of worker computers, one or more partitions of the plurality of partitions; receiving, from each respective worker computer in the set of worker computers, a respective load measure indicating a computational load of the respective worker computer; selecting, based on the respective load measure of each respective worker computer, a first worker computer in the set of worker computers for a replication operation for replicating at least one partition from the first worker computer to a second worker computer in the set of worker computers; replicating, the at least one partition from the first worker computer to the second worker computer; after replicating the at least one partition from the first worker computer to the second worker computer, distributing requests for a workload associated with the at least one partition between the first worker computer and the second worker computer such that the first worker computer and the second worker computer share the workload for the at least one partition; and in response to distributing the requests for the workload associated with the at least one partition between the first worker computer and the second worker computer, de-replicating the at least one partition from the second worker computer by deleting the at least one partition from the second worker computer.
Facts
- Company
- Google (Google LLC)
- Official title
- Weighted auto-sharding
- Patent number
- US12748633B2
- Application number
- 18500966
- Filed
- Nov 2, 2023
- Granted
- Sep 29, 2026
- Inventors
- 5
- Claims
- 20
Classified under
G06F 9/5066 Physics & computingG06F 9/5083 Physics & computingG06F 9/5088 Physics & computingG06F 16/00 Physics & computingG06F 16/278 Physics & computingH04L 67/1001 Electricity & electronicsMore from Google in AI & software
- Google patents video search that answers questions using AI descriptions Sep 15, 2026
- Google patents photo tool that removes people and their gear Sep 15, 2026
- Google patents AI that writes live meeting notes and summaries Sep 15, 2026
- Google patents AI tool that turns messy emergency notes into clear messages Sep 3, 2026
- Google patents AI that clicks through apps to finish tasks for you Sep 24, 2026
Summaries are simplified from the filing’s own abstract and first claim. A patent filing is not a product announcement.
Patent data and drawings: U.S. Patent and Trademark Office (USPTO). Nebula is not affiliated with or endorsed by the USPTO.