18418257. DISTRIBUTED DATABASE CONFIGURATION simplified abstract (Google LLC)

From WikiPatents
Jump to navigation Jump to search

DISTRIBUTED DATABASE CONFIGURATION

Organization Name

Google LLC

Inventor(s)

Alexander Shraer of Stanford CA (US)

Artyom Sharov of Haifa (IL)

Arif Abdulhusein Merchant of Los Altos CA (US)

Brian F. Cooper of San Jose CA (US)

DISTRIBUTED DATABASE CONFIGURATION - A simplified explanation of the abstract

This abstract first appeared for US patent application 18418257 titled 'DISTRIBUTED DATABASE CONFIGURATION

Simplified Explanation

The abstract of the patent application describes a method for selecting a leader from candidate computing clusters in a distributed network based on workload prediction and monitoring.

  • The method involves selecting a leader from candidate computing clusters in a distributed network.
  • An activity monitor predicts or monitors the workload of clients in the network.
  • Different activities of the workload are assigned corresponding weights.
  • The delay in performing requested activities, modified by these weights, is calculated.
  • The candidate leader with the lowest weighted delay is selected as the leader.

Potential Applications

This technology could be applied in large-scale distributed systems where selecting a leader is crucial for efficient operation.

Problems Solved

This technology solves the problem of efficiently selecting a leader in a distributed network based on workload prediction and monitoring.

Benefits

The benefits of this technology include improved efficiency in selecting a leader, optimized workload distribution, and enhanced performance in distributed systems.

Potential Commercial Applications

A potential commercial application of this technology could be in cloud computing environments where efficient leader selection is essential for optimal resource utilization.

Possible Prior Art

One possible prior art for this technology could be existing methods for leader election in distributed systems based on different criteria such as network latency or node capabilities.

Unanswered Questions

How does the activity monitor accurately predict or monitor the workload of clients in the network?

The abstract does not provide specific details on the mechanisms used by the activity monitor to predict or monitor the workload of clients.

What are the specific weights assigned to different activities of the workload and how are they determined?

The abstract does not elaborate on the exact weights assigned to different activities of the workload or the methodology for determining these weights.


Original Abstract Submitted

Replicas are selected in a large distributed network, and the roles for these replicas are identified. In one example, a leader is selected from among candidate computing clusters. To make this selection, an activity monitor predicts or monitors the workload of one or more clients. Different activities of the workload are given corresponding weights. The delay in performing requested activities, modified by these weights is found, and the candidate leader with the lowest weighted delay is selected as the leader.