CN116594758B - Password module call optimization system and optimization method - Google Patents
Password module call optimization system and optimization method Download PDFInfo
- Publication number
- CN116594758B CN116594758B CN202310879150.3A CN202310879150A CN116594758B CN 116594758 B CN116594758 B CN 116594758B CN 202310879150 A CN202310879150 A CN 202310879150A CN 116594758 B CN116594758 B CN 116594758B
- Authority
- CN
- China
- Prior art keywords
- data block
- data
- state
- application program
- response
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 26
- 238000000034 method Methods 0.000 title claims abstract description 15
- 230000004044 response Effects 0.000 claims abstract description 73
- 238000013480 data collection Methods 0.000 claims abstract description 13
- 230000002618 waking effect Effects 0.000 claims description 6
- 238000012544 monitoring process Methods 0.000 claims description 3
- 238000004806 packaging method and process Methods 0.000 claims description 3
- 238000012546 transfer Methods 0.000 claims description 2
- 230000003139 buffering effect Effects 0.000 claims 2
- 230000005540 biological transmission Effects 0.000 abstract description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
- G06F21/45—Structures or tools for the administration of authentication
- G06F21/46—Structures or tools for the administration of authentication by designing passwords or checking the strength of passwords
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The invention relates to the technical field of information transmission, in particular to a cryptographic module calling optimization system and an optimization method, wherein the system comprises the following components: the system comprises a data collection module, a first service program and a second service program; the data collection module comprises a data block state table and a plurality of data blocks; the data block temporarily stores request data sent by the application program and response data returned by the password module; the data block state table records and updates the state of each data block and the thread ID of the application program; traversing a data block state table by a first service program, and copying request data in a data block meeting the state requirement to a password module data queue; the second service program circularly monitors the data queue of the password module, copies the response data to the corresponding data block when the password module returns the response data, and wakes up the application program under the corresponding thread ID to read the response data. The invention can reduce the CPU occupation rate of the system and can exert the performance of the password card.
Description
Technical Field
The invention relates to the technical field of information transmission, in particular to a cryptographic module calling optimization system and an optimization method.
Background
At present, the cryptographic module is widely applied to the fields of securities, big data, cloud storage and the like. High performance cryptographic modules typically employ a full duplex mode of operation, with request and response channels comprising at least one data queue. When the application program calls the password module, request data are transmitted to the data queue, then the state of the data queue is checked through polling, and when the password module returns response data, polling is finished, and the response data are read.
However, there are certain drawbacks to this call mode. When the application program polls and checks the state of the data queue, the CPU is continuously occupied by the application program, so that the CPU occupancy rate is too high, and the operation of other programs of the system is influenced. For example: in an 8-core CPU environment, the CPU occupancy rate reaches 800% by calling the cryptographic module through 8 threads, namely, all cores of the CPU are in a full-load working state, and other programs cannot acquire CPU resources and cannot run or run slowly.
Disclosure of Invention
In view of this, the invention provides a cryptographic module call optimization system and optimization method, which can reduce the CPU occupancy rate of the system and can exert the performance of the cryptographic card.
In order to achieve the above purpose, the present invention adopts the following technical scheme.
In a first aspect, the present invention provides a cryptographic module invocation optimization system, comprising: the system comprises a data collection module, a first service program and a second service program;
the data collection module comprises a data block state table and a plurality of data blocks; the data block is used for temporarily storing request data sent by the application program and response data returned by the password module; the data block state table is used for recording and updating the state of each data block and the thread ID of the application program;
the first service program is used for traversing the data block state table and copying request data in the data block meeting the state requirement to a cryptographic module data queue;
the second service program is used for circularly monitoring the data queue of the password module, copying the response data to the corresponding data block when the password module returns the response data, and waking up the application program under the corresponding thread ID to read the response data.
Further, one of the data blocks is composed of a request data block and a response data block, the request data block is used for temporarily storing the request data sent by the application program, and the response data block is used for temporarily storing the response data returned by the password module.
Further, the state of the data block is an idle state, an occupied state, a ready state or a finished state; wherein the "idle" state indicates that the data block content is empty and not allocated to the application program; the "busy" state indicates that the data block has been allocated to an application and that the data block state table has recorded an application thread ID; the "ready" state indicates that the application has filled in the data block with the requested data, and when there is a data block in the "ready" state, the first service is awakened; the "done" state indicates that the cryptographic module has completed responding to which response data has been saved to the data block.
Further, the data block state record table is further used for updating the data block state to be in an idle state when the application program finishes running but the corresponding data block is in a non-idle state.
Further, the first service program is configured to transfer the request data in the data block in the "ready" state to the cryptographic module data queue.
Further, the first service program and the second service program are in a sleep state when all data blocks are in an idle state.
Further, the data collection module further includes: a message description unit;
the message description unit is used for polling and checking the data block state table, searching idle state data blocks, establishing indexes, and packaging the idle state data block indexes, request data block addresses and response data block addresses into message descriptors; the application program is used for filling the request data into the corresponding request data block according to the message descriptor, reading the response data in the corresponding response data block according to the message descriptor after the response data is returned by the password module, and releasing the message descriptor.
In a second aspect, the present invention provides a cryptographic module call optimization method, which is applicable to the above cryptographic module call optimization system, and includes the following steps:
after the application program initiates a call request, temporarily storing request data sent by the application program in an idle state data block; the data block state table updates the data block state to be occupied, and records the application program thread ID;
after the application program fills the request data into the corresponding data block, the application program enters a sleep state and waits to be awakened by the second service program, and at the moment, the data block state table updates the corresponding data block into a ready state;
traversing the data block state table by the first service program, copying request data in the data block in the 'ready' state to a data queue of the cryptographic module, and waking up the second service program;
the second service program monitors the state of the data queue of the password module, when the password module returns response data, the response data is copied to the corresponding data block, the data block state table updates the data block state to a 'complete' state, and the corresponding application program is awakened;
after the corresponding application program is awakened, the response data in the corresponding data block is read, and the data block state table updates the data block state into an idle state.
Further, one data block consists of a request data block and a response data block, wherein the request data block temporarily stores the request data sent by the application program, and the response data block temporarily stores the response data returned by the password module.
Further, the method further comprises:
after an application program initiates a call request, applying for a message descriptor, a message description unit polls a check data block state table, searches an idle state data block to establish an index, and packages the idle state data block index, a request data block address and a response data block address into the message descriptor; and the application program fills the request data into the corresponding request data block according to the message descriptor, reads the response data in the corresponding response data block according to the message descriptor after the response data is returned by the password module, and releases the message descriptor.
Compared with the prior art, the invention discloses a password module call optimization system and an optimization method, wherein the message collection module is used for collecting request data sent by an application program and response data returned by the password module, the first service program is used for sequentially transmitting the request data to the password module, and the second service program is used for replacing the application program to poll the data queue state, so that the CPU occupancy rate is reduced, and the performance of the password module can be exerted.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present invention, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a data collection module according to the present invention;
FIG. 2 is a flow chart of a cryptographic module call optimization method provided by the invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
As shown in fig. 1, an embodiment of the present invention discloses a cryptographic module call optimization system, including: the system comprises a data collection module, a first service program and a second service program;
the data collection module comprises a data block state table and a plurality of data blocks; the data block is used for temporarily storing request data sent by the application program and response data returned by the password module; the data block state table is used for recording and updating the state of each data block and the thread ID of the application program;
the first service program is used for traversing the data block state table and copying request data in the data block meeting the state requirement to the data queue of the cryptographic module;
the second service program is used for circularly monitoring the data queue of the password module, copying the response data to the corresponding data block when the password module returns the response data, and waking up the application program under the corresponding thread ID to read the response data.
In one embodiment, as shown in fig. 1, a data block is composed of a request data block and a response data block, where the request data block is used to temporarily store the request data sent by the application program, and the response data block is used to temporarily store the response data returned by the cryptographic module. The data collection module contains M data blocks, M=2N, N is the request number supported by the data queue of the cryptographic module. In the 8-core CPU environment, the cryptographic module is called by 8 threads, and at this time, the data block state table contains 16 data blocks, and the data block state table contains 16 entries corresponding to 16 data blocks.
In one particular embodiment, the state of the data block is an "idle" state, an "occupied" state, a "ready" state, or a "completed" state; wherein the "idle" state indicates that the data block content is empty and not allocated to the application program; the "busy" state indicates that the data block has been allocated to the application and that the data block state table has recorded an application thread ID; the "ready" state indicates that the application has filled in the data block with the requested data, and when there is a data block in the "ready" state, the first service is awakened; the "done" state indicates that the cryptographic module has completed responding to which response data has been saved to the data block.
When an application program initiates a call request, searching an idle state data block, updating the state of the idle state data block into occupied state, filling request data into the data block, and updating the state of the data block into ready state;
the first service program transfers the request data in the data block in the "ready" state to the cryptographic module data queue.
And the second service program circularly and sequentially inquires the state of the data queue of the password module, copies the response data of the password module into the corresponding response data block when the password module returns the response data, updates the data block to be 'completed', and wakes up the corresponding application program.
More advantageously, the data block state record table monitors the running state of the application program, and updates the state of the data block to be in an idle state when the application program finishes running but the corresponding data block is in a non-idle state, so as to avoid abnormal exit of the application program, and avoid invalid occupation of the message block and influence on system performance.
Advantageously, the first service program and the second service program are in a sleep state when all the data blocks are in an idle state, and do not occupy CPU resources.
In other embodiments, the data collection module further comprises: a message description unit;
the message description unit is used for polling the check data block state table, searching the idle state data block, establishing an index, and packaging the idle state data block index, the request data block address and the response data block address into a message descriptor; the application program is used for filling the request data into the corresponding request data block according to the message descriptor, and after the response data is returned by the password module, the response data in the corresponding response data block is read according to the message descriptor, and the message descriptor is released.
As shown in fig. 2, the embodiment of the present invention further provides a cryptographic module call optimization method, which is applicable to the above cryptographic module call optimization system, and includes the following steps:
the application program initiates a call request, applies for a message descriptor, and the message description unit polls a check data block state table, searches an idle state data block to establish an index, and encapsulates the idle state data block index, a request data block address and a response data block address into the message descriptor; the data block state table updates the data block state to be occupied, and records the application program thread ID;
the application program fills the request data into the corresponding data blocks (namely, requests the data blocks) according to the message descriptors, then enters a sleep state and waits to be awakened by the second service program, and at the moment, the data block state table updates the corresponding data blocks into a ready state;
traversing the data block state table by the first service program, copying request data in the data block in the 'ready' state to a data queue of the cryptographic module, and waking up the second service program;
the second service program monitors the state of the data queue of the password module, when the password module returns response data, the response data is copied to a corresponding data block (response data block), the data block state table updates the data block to a 'complete' state, and a corresponding application program is awakened;
after the corresponding application program is awakened, checking the state of the data block according to the message descriptor, if the data block is completed, reading response data in the corresponding data block, otherwise, reentering the sleep state;
the application releases the message descriptor, the data block state table updates the data block state to an "idle" state, and clears the request data block and the response data block.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (7)
1. A cryptographic module invocation optimization system, comprising: the system comprises a data collection module, a first service program and a second service program;
the data collection module comprises a data block state table and a plurality of data blocks; the data block is used for temporarily storing request data sent by the application program and response data returned by the password module; the data block state table is used for recording and updating the state of each data block and the thread ID of the application program;
the state of the data block is an idle state, an occupied state, a ready state or a finished state; wherein the "idle" state indicates that the data block content is empty and not allocated to the application program; the "busy" state indicates that the data block has been allocated to an application and that the data block state table has recorded an application thread ID; the "ready" state indicates that the application has filled in the data block with the requested data, and when there is a data block in the "ready" state, the first service is awakened; the "complete" state indicates that the cryptographic module has completed responding to which response data has been saved to the data block;
the first service program is used for traversing the data block state table and copying request data in the data block meeting the state requirement to a cryptographic module data queue;
the second service program is used for circularly monitoring the data queue of the password module, copying the response data to the corresponding data block when the password module returns the response data, and waking up the application program under the corresponding thread ID to read the response data;
the data collection module further comprises: a message description unit;
the message description unit is used for polling and checking the data block state table, searching idle state data blocks, establishing indexes, and packaging the idle state data block indexes, request data block addresses and response data block addresses into message descriptors; the application program is used for filling the request data into the corresponding request data block according to the message descriptor, reading the response data in the corresponding response data block according to the message descriptor after the response data is returned by the password module, and releasing the message descriptor.
2. The cryptographic module call optimization system of claim 1, wherein one of the data blocks is comprised of a request data block for buffering the request data sent by the application and a response data block for buffering the response data returned by the cryptographic module.
3. The cryptographic module call optimization system of claim 1, wherein the data block state record table is further configured to update the data block state to an "idle" state when the application program is running but the corresponding data block is in a non-idle state.
4. The cryptographic module call optimization system of claim 1, wherein the first service is configured to transfer request data in a data block in a "ready" state to a cryptographic module data queue.
5. The cryptographic module invocation optimization system of claim 4, wherein the first service and the second service are in a sleep state when all data blocks are in an "idle" state.
6. A cryptographic module call optimization method, characterized in that it is adapted to a cryptographic module call optimization system according to any one of claims 1-5, comprising the steps of:
after the application program initiates a call request, searching an idle state data block, updating the state of the data block into occupied state by a data block state table, and recording the thread ID of the application program;
after the application program fills the request data into the corresponding data block, the application program enters a sleep state and waits to be awakened by the second service program, and at the moment, the data block state table updates the corresponding data block into a ready state;
traversing the data block state table by the first service program, copying request data in the data block in the 'ready' state to a data queue of the cryptographic module, and waking up the second service program;
the second service program monitors the state of the data queue of the password module, when the password module returns response data, the response data is copied to the corresponding data block, the data block state table updates the data block state to a 'complete' state, and the corresponding application program is awakened;
after the corresponding application program is awakened, reading response data in the corresponding data block, updating the data block state into an idle state by the data block state table, and clearing the corresponding data block;
wherein the "idle" state indicates that the data block content is empty and not allocated to the application program; the "busy" state indicates that the data block has been allocated to an application and that the data block state table has recorded an application thread ID; the "ready" state indicates that the application has filled in the data block with the requested data, and when there is a data block in the "ready" state, the first service is awakened; the "complete" state indicates that the cryptographic module has completed responding to which response data has been saved to the data block;
the method further comprises the steps of:
after an application program initiates a call request, applying for a message descriptor, a message description unit polls a check data block state table, searches an idle state data block to establish an index, and packages the idle state data block index, a request data block address and a response data block address into the message descriptor; and the application program fills the request data into the corresponding request data block according to the message descriptor, reads the response data in the corresponding response data block according to the message descriptor after the response data is returned by the password module, and releases the message descriptor.
7. The method of claim 6, wherein one of the data blocks comprises a request data block and a response data block, the request data block temporarily storing the request data sent by the application, the response data block temporarily storing the response data returned by the cryptographic module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310879150.3A CN116594758B (en) | 2023-07-18 | 2023-07-18 | Password module call optimization system and optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310879150.3A CN116594758B (en) | 2023-07-18 | 2023-07-18 | Password module call optimization system and optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116594758A CN116594758A (en) | 2023-08-15 |
| CN116594758B true CN116594758B (en) | 2023-09-26 |
Family
ID=87590357
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310879150.3A Active CN116594758B (en) | 2023-07-18 | 2023-07-18 | Password module call optimization system and optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116594758B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4387427A (en) * | 1978-12-21 | 1983-06-07 | Intel Corporation | Hardware scheduler/dispatcher for data processing system |
| CN101582756A (en) * | 2008-05-14 | 2009-11-18 | 北京中电华大电子设计有限责任公司 | Method for realizing immediate block reply mechanism of wireless local area network |
| GB201017752D0 (en) * | 2010-10-21 | 2010-12-01 | Bluwireless Tech Ltd | Data processing systems |
| US8510538B1 (en) * | 2009-04-13 | 2013-08-13 | Google Inc. | System and method for limiting the impact of stragglers in large-scale parallel data processing |
| CN110830561A (en) * | 2019-10-25 | 2020-02-21 | 华中科技大学 | Multi-user ORAM access system and method under asynchronous network environment |
| CN111767159A (en) * | 2020-06-24 | 2020-10-13 | 浙江大学 | Asynchronous system calling system based on coroutine |
| CN113127416A (en) * | 2020-01-15 | 2021-07-16 | 北京沃东天骏信息技术有限公司 | Data query method and device |
| CN113986513A (en) * | 2021-11-10 | 2022-01-28 | 眸芯科技（上海）有限公司 | Master-slave core communication method and system of master-slave architecture chip |
| CN114095153A (en) * | 2020-08-05 | 2022-02-25 | 迈络思科技有限公司 | Cipher data communication device |
| CN114443526A (en) * | 2021-12-24 | 2022-05-06 | 荣耀终端有限公司 | Data read/write control method and electronic equipment |
| CN115113977A (en) * | 2022-06-30 | 2022-09-27 | 深圳云豹智能有限公司 | Descriptor reading apparatus and device, method and integrated circuit |
| CN115237597A (en) * | 2022-07-19 | 2022-10-25 | 北京达佳互联信息技术有限公司 | Data processing method, device, system, equipment and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102609378B (en) * | 2012-01-18 | 2016-03-30 | 中国科学院计算技术研究所 | A kind of message type internal storage access device and access method thereof |
| IN2013CH04449A (en) * | 2013-09-30 | 2015-04-03 | Empire Technology Dev Llc | |
| US9652287B2 (en) * | 2015-01-05 | 2017-05-16 | Miosoft Corporation | Using databases for both transactions and analysis |
-
2023
- 2023-07-18 CN CN202310879150.3A patent/CN116594758B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4387427A (en) * | 1978-12-21 | 1983-06-07 | Intel Corporation | Hardware scheduler/dispatcher for data processing system |
| CN101582756A (en) * | 2008-05-14 | 2009-11-18 | 北京中电华大电子设计有限责任公司 | Method for realizing immediate block reply mechanism of wireless local area network |
| US8510538B1 (en) * | 2009-04-13 | 2013-08-13 | Google Inc. | System and method for limiting the impact of stragglers in large-scale parallel data processing |
| GB201017752D0 (en) * | 2010-10-21 | 2010-12-01 | Bluwireless Tech Ltd | Data processing systems |
| CN110830561A (en) * | 2019-10-25 | 2020-02-21 | 华中科技大学 | Multi-user ORAM access system and method under asynchronous network environment |
| CN113127416A (en) * | 2020-01-15 | 2021-07-16 | 北京沃东天骏信息技术有限公司 | Data query method and device |
| CN111767159A (en) * | 2020-06-24 | 2020-10-13 | 浙江大学 | Asynchronous system calling system based on coroutine |
| CN114095153A (en) * | 2020-08-05 | 2022-02-25 | 迈络思科技有限公司 | Cipher data communication device |
| CN113986513A (en) * | 2021-11-10 | 2022-01-28 | 眸芯科技（上海）有限公司 | Master-slave core communication method and system of master-slave architecture chip |
| CN114443526A (en) * | 2021-12-24 | 2022-05-06 | 荣耀终端有限公司 | Data read/write control method and electronic equipment |
| CN115113977A (en) * | 2022-06-30 | 2022-09-27 | 深圳云豹智能有限公司 | Descriptor reading apparatus and device, method and integrated circuit |
| CN115237597A (en) * | 2022-07-19 | 2022-10-25 | 北京达佳互联信息技术有限公司 | Data processing method, device, system, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 一种基于Radix树的数据库前端缓存;熊慕舟;;华中科技大学学报(自然科学版)(第S2期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116594758A (en) | 2023-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6801927B1 (en) | Network adaptor card with reverse proxy and cache and method implemented therewith | |
| CN104935648B (en) | The CDN system and file of a kind of high performance-price ratio push away in advance, the method for fragment cache memory | |
| WO2010072083A1 (en) | Web application based database system and data management method therof | |
| WO2022016861A1 (en) | Hotspot data caching method and system, and related device | |
| WO2021258881A1 (en) | Data management method and system for application, and computer device | |
| WO2023098050A1 (en) | Remote data access method and apparatus | |
| CN111930305A (en) | Data storage method and device, storage medium and electronic device | |
| CN116594758B (en) | Password module call optimization system and optimization method | |
| WO2021164560A1 (en) | Multi-core chip and scheduling method therefor | |
| JPH07239808A (en) | Distributed data managing system | |
| JP4176933B2 (en) | RECORDING MEDIUM RECORDING EXTERNAL STORAGE DEVICE DRIVER PROGRAM AND COMPUTER HAVING EXTERNAL STORAGE DEVICE ACCESS FUNCTION | |
| CN111897496A (en) | Method for improving network IO read-write performance in distributed system | |
| CN112445590A (en) | Computing resource access and scheduling system and method | |
| CN114691382A (en) | RDMA-based communication method, node, system and medium | |
| CN114519013A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN111866093B (en) | Service data distribution method and device | |
| CN112199205B (en) | Program communication method between heterogeneous platforms | |
| US20240129251A1 (en) | Data processing method and apparatus, computer device, and readable storage medium | |
| CN101453386A (en) | Network package extracting method | |
| CN117407159A (en) | Memory space management method and device, equipment and storage medium | |
| US20210365416A1 (en) | Mount parameter in file systems | |
| WO2002035366A1 (en) | System and method for managing connections between clients and a server using cache memory to store server responses | |
| CN117370129A (en) | Thread state recording method and computing device | |
| CN115883495A (en) | Method and device for acquiring switch state information, electronic equipment and storage medium | |
| CN113220212A (en) | Storage node scheduling method and device, storage node, equipment and readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |