Resource contention method and apparatus based on distributed cluster architecture

By establishing an optimistic locking table in the database, the problem of high pressure on the database due to resource contention in the distributed cluster architecture is solved. This achieves a flexible resource contention mechanism and efficient resource management, reduces the amount of table modification required, and improves modification efficiency and applicability.

CN116204583BActive Publication Date: 2026-05-29中国邮政储蓄银行股份有限公司
View PDF 2 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
中国邮政储蓄银行股份有限公司
Filing Date
2022-12-30
Publication Date
2026-05-29

AI Technical Summary

Technical Problem

In existing technologies, the resource contention mechanism of distributed cluster architecture puts a lot of pressure on the database or requires significant intrusive modification to the tables, resulting in performance impact and insufficient flexibility.

Method used

Create an optimistic locking table in the database, with records including cluster name, resource name, application address, and timestamp fields. Use these fields to identify the target record and write it to the server address when idle to compete for resources, thus avoiding intrusive modification of the database table.

Benefits of technology

It implements a flexible resource competition mechanism, reduces pressure on the database, avoids long-term occupation, supports flexible expansion of various resources, and improves transformation efficiency and applicability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116204583B_ABST
    Figure CN116204583B_ABST
Patent Text Reader

Abstract

The application provides a resource competition method and device based on a distributed cluster architecture, the method comprising: establishing an optimistic lock table in a database, the optimistic lock table comprising a plurality of records, each record comprising: a cluster name field corresponding to an optimistic lock, a resource name field, an application address field, and a timestamp field; in the case of starting the distributed cluster architecture, determining a corresponding record as a target record from the optimistic lock table according to a target resource name and a target cluster name, the target resource name being the resource name of a target resource, and the target cluster name being the cluster name of the distributed cluster architecture; determining whether a target field is empty according to the target record, the target field being the application address field in the target record; and in the case of the target field being empty, writing the address of a server into the target field and providing services externally. The application solves the problem that the competition mechanism of nodes in a cluster either has a relatively large pressure on a database or has a relatively large invasive modification on a table.
Need to check novelty before this filing date? Find Prior Art