CN117075793A - Data storage space processing method, device, equipment and readable storage medium - Google Patents

Data storage space processing method, device, equipment and readable storage medium Download PDF

Info

Publication number
CN117075793A
CN117075793A CN202210497928.XA CN202210497928A CN117075793A CN 117075793 A CN117075793 A CN 117075793A CN 202210497928 A CN202210497928 A CN 202210497928A CN 117075793 A CN117075793 A CN 117075793A
Authority
CN
China
Prior art keywords
storage space
data
data storage
target
queue
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.)
Pending
Application number
CN202210497928.XA
Other languages
Chinese (zh)
Inventor
席宗虎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Rockwell Technology Co Ltd
Original Assignee
Beijing Rockwell Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Rockwell Technology Co Ltd filed Critical Beijing Rockwell Technology Co Ltd
Priority to CN202210497928.XA priority Critical patent/CN117075793A/en
Publication of CN117075793A publication Critical patent/CN117075793A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061—Improving I/O performance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/0644—Management of space entities, e.g. partitions, extents, pools
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The present disclosure relates to a data storage space processing method, apparatus, device, and readable storage medium, the method comprising: responding to a user request, and creating a data storage space; checking whether a storage space queue in a target execution unit is full, wherein the target execution unit is used for executing a user request and storing target data corresponding to the user request into the data storage space; if the storage space queues in the target execution unit are full, checking whether the public storage space queues are full; and if the public storage space queue is not fully loaded, inserting the data storage space into the public storage space queue. The method solves the problem that the storage space queue in the target execution unit is possibly fully loaded by introducing the public storage space queue, avoids the problem that the user request cannot be processed in time due to the fact that the storage space queue in the target execution unit is fully loaded, and improves the efficiency and the flexibility of the data storage space processing method.

Description

Data storage space processing method, device, equipment and readable storage medium
Technical Field
The disclosure relates to the field of computer technology, and in particular, to a data storage space processing method, a device, equipment and a readable storage medium.
Background
For new energy automobiles, if the operating system cannot timely acquire and process related data, normal running of the automobile is affected.
The new energy automobile operating systems are all operated in a central processing unit (Central Processing Unit, CPU), and respond to the data reading request of a user, and the operating systems execute the data reading operation through a core in the management CPU so as to obtain various corresponding data.
However, when the CPU core reads data, the CPU core processes the data reading tasks in sequence in the data reading task queue corresponding to the CPU core, and when the data reading task queue is full, a new data reading task cannot enter the queue, and thus cannot be processed, which causes interruption or error of the data reading process and seriously affects the efficiency of the operating system for acquiring data.
Disclosure of Invention
In order to solve the technical problems, the present disclosure provides a data storage space processing method, a device, an apparatus and a readable storage medium, so as to avoid the problem that a user request cannot be processed in time due to full loading of a storage space queue in a target execution unit, thereby improving the efficiency and flexibility of the data storage space processing method.
In a first aspect, an embodiment of the present disclosure provides a data storage space processing method, including:
responding to a user request, and creating a data storage space;
checking whether a storage space queue in a target execution unit is full, wherein the target execution unit is used for executing a user request and storing target data corresponding to the user request into the data storage space;
if the storage space queues in the target execution unit are full, checking whether the public storage space queues are full;
and if the public storage space queue is not fully loaded, inserting the data storage space into the public storage space queue.
In some embodiments, in response to a user request, after creating the data storage space, the method further comprises:
acquiring a request serial number according to the user request;
and determining a target execution unit in a plurality of execution units in the central processing unit according to the request sequence number.
In some embodiments, the method further comprises:
and if the common storage space queue is full, determining the adjacent execution units of the target execution unit, and inserting the data storage space into the storage space queue in the adjacent execution units.
In some embodiments, the method further comprises:
checking whether a data storage space exists in a storage space queue in the target execution unit;
if the data storage space does not exist in the target execution unit storage space queue, checking whether the data storage space exists in the public storage space queue;
and if the data storage space exists in the public storage space queue, acquiring the data storage space.
In some embodiments, the method further comprises:
if the data storage space does not exist in the public storage space queue, determining an adjacent execution unit of the target execution unit, and checking whether the data storage space exists in the storage space queue in the adjacent execution unit;
and if the data storage space exists in the memory space queue in the adjacent execution unit, acquiring the data storage space.
In some embodiments, after the data storage space is acquired, the method further comprises:
acquiring an identification of target data corresponding to the data storage space, the size of the target data and a target storage position of the target data;
and reading the target data to the target storage position based on the identification of the target data, wherein the target storage position is positioned in the data storage space.
In some embodiments, based on the identification of the target data, prior to reading the target data to the target storage location, the method further comprises:
determining a data frame matched with the data storage space based on the size of the target data;
binding the data storage space with the data frame to obtain a data frame of the bound data storage space;
and placing the data frame of the bound data storage space into a working data frame queue.
In a second aspect, an embodiment of the present disclosure provides a data storage space processing apparatus, including:
the creation module is used for responding to the user request and creating a data storage space;
the first checking module is used for checking whether a storage space queue in the target execution unit is full or not, and the target execution unit is used for executing a user request and storing target data corresponding to the user request into the data storage space;
the second checking module is used for checking whether the public storage space queue is full or not under the condition that the storage space queue in the target execution unit is full;
and the inserting module is used for inserting the data storage space into the public storage space queue under the condition that the public storage space queue is not fully loaded.
In a third aspect, an embodiment of the present disclosure provides an electronic device, including:
a memory;
a processor; and
a computer program;
wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method according to the first aspect.
In a fourth aspect, embodiments of the present disclosure provide a computer-readable storage medium having stored thereon a computer program for execution by a processor to implement the method of the first aspect.
In a fifth aspect, the disclosed embodiments also provide a computer program product comprising a computer program or instructions which, when executed by a processor, implement a data storage space processing method as described above.
According to the data storage space processing method, device and equipment and the readable storage medium, the problem that the storage space queue in the target execution unit is possibly fully loaded is solved by introducing the public storage space queue, the problem that the user request cannot be processed in time due to the fact that the storage space queue in the target execution unit is fully loaded is avoided, and the efficiency and the flexibility of the data storage space processing method are improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure.
In order to more clearly illustrate the embodiments of the present disclosure or the solutions in the prior art, the drawings that are required for the description of the embodiments or the prior art will be briefly described below, and it will be obvious to those skilled in the art that other drawings can be obtained from these drawings without inventive effort.
FIG. 1 is a flowchart of a method for processing a data storage space according to an embodiment of the present disclosure;
fig. 2 is a schematic diagram of an application scenario provided in an embodiment of the present disclosure;
FIG. 3 is a flowchart of a method for processing a data storage space according to another embodiment of the present disclosure;
FIG. 4 is a flowchart of a method for processing a data storage space according to another embodiment of the present disclosure;
FIG. 5 is a schematic diagram of a data storage space processing apparatus according to an embodiment of the disclosure;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure.
Detailed Description
In order that the above objects, features and advantages of the present disclosure may be more clearly understood, a further description of aspects of the present disclosure will be provided below. It should be noted that, without conflict, the embodiments of the present disclosure and features in the embodiments may be combined with each other.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure, but the present disclosure may be practiced otherwise than as described herein; it will be apparent that the embodiments in the specification are only some, but not all, embodiments of the disclosure.
The embodiments of the present disclosure provide a data storage space processing method, which is described below with reference to specific embodiments.
Fig. 1 is a flowchart of a data storage space processing method according to an embodiment of the present disclosure. The data storage space processing method may be performed by an electronic device comprising a CPU running an operating system, and the method may be performed in particular by the CPU. The method may be applied to the application scenario shown in fig. 2, which includes the data storage space 21 created in response to a user request, at least an execution unit, a common storage space queue 26, a data frame pool 27, data frames 28 of the bound data storage space, and a work data frame queue 29. Each execution unit includes a CORE (CORE) of a multi-CORE CPU and a memory queue corresponding to the CORE, for example, in the scenario shown in fig. 2, the CORE 22 and the memory queue 23 form one execution unit, and the CORE 24 and the memory 25 form another execution unit. It can be appreciated that the data storage space processing method provided by the embodiment of the present disclosure may also be applied in other scenarios.
The method for processing the data storage space shown in fig. 1 is described below in conjunction with the application scenario shown in fig. 2, and includes the following specific steps:
s101, responding to a user request, and creating a data storage space.
The user invokes the operating system interface to initiate the user request. The user request may be any request such as a data query request, which requires the CPU to perform a data reading operation. After receiving the user request, the CPU running the operating system creates a corresponding data storage space for the CPU, and the data storage space is used for storing target data corresponding to the user request.
S102, checking whether a storage space queue in the target execution unit is full.
The target execution unit is used for executing a user request and storing target data corresponding to the user request into the data storage space.
The target execution unit consists of one core of the multi-core CPU and a corresponding storage space queue. The storage space queue can store a preset number of data storage spaces. The memory space queues follow the rule of 'first in first out', and the corresponding cores process the data memory spaces in the memory space queues in sequence.
And S103, if the storage space queue in the target execution unit is full, checking whether the public storage space queue is full.
S104, if the public storage space queue is not fully loaded, inserting the data storage space into the public storage space queue.
The common memory space queue can store a preset number of data memory spaces for storing the newly created data memory spaces when the memory space queue in the target execution unit is full. Because the number of the storage space queues in the target execution unit which can accommodate the data storage space at most is limited, if the number of the data storage spaces waiting for processing stored in the storage space queues is equal to the number of the storage space queues in the target execution unit which can accommodate the data storage space at most, the storage space queues are full, and new data storage spaces cannot be stored temporarily. At this time, the public storage space queue is checked, and if the public storage space queue is not fully loaded, the data storage space which needs to be stored currently is stored in the public storage space queue, and the subsequent processing is waited.
The disclosed embodiments create a data storage space by responding to a user request; checking whether a storage space queue in the target execution unit is full; if the storage space queues in the target execution unit are full, checking whether the public storage space queues are full; if the public storage space queue is not fully loaded, the data storage space is inserted into the public storage space queue, and the public storage space queue is introduced to solve the problem that the storage space queue in the target execution unit is possibly fully loaded, so that the problem that the user request cannot be processed in time due to the fact that the storage space queue in the target execution unit is fully loaded is avoided, and the efficiency and the flexibility of the data storage space processing method are improved.
Fig. 3 is a flowchart of a data storage space processing method according to another embodiment of the present disclosure. As shown in fig. 3, the method comprises the following steps:
s301, responding to a user request, and creating a data storage space.
Specifically, the implementation process and principle of S301 and S101 are identical, and will not be described herein.
S302, acquiring a request serial number according to the user request.
S303, determining a target execution unit in a plurality of execution units in the central processing unit according to the request sequence number.
There may be multiple execution units in the operating system, each execution unit corresponding to a unique number. The CPU can determine a target execution unit in the plurality of execution units according to the received user request serial number, and further control the target execution unit to execute the corresponding user request. For example, the target execution unit may be determined according to the following formula:
x＝uid(modcnmax)
wherein x is the number of the target execution unit, uid is the user request serial number, cnmax is the number of execution units in the operating system.
S304, judging whether the storage space queue in the target execution unit is full. If yes, executing S306; if not, S305 is performed.
S305, inserting the data storage space into a storage space queue in the target execution unit.
If the number of the data storage spaces stored in the storage space queue in the target execution unit is smaller than the number of the data storage spaces which can be accommodated at most, the storage space queue in the target execution unit is not fully loaded and can accommodate the new data storage spaces, and the data storage spaces which need to be stored are inserted into the storage space queue in the target execution unit.
S306, judging whether the public storage space queue is full. If yes, executing S308; if not, S307 is performed.
S307, the data storage space is inserted into a public storage space queue.
If the number of data storage spaces stored in the storage space queue in the target execution unit is equal to the number of data storage spaces which can be contained at most, the storage space queue in the target execution unit is fully loaded, new data storage spaces cannot be stored temporarily, and whether the public storage space queue is fully loaded is checked at the moment. And if the public storage space queue is not fully loaded, namely the number of the data storage spaces stored in the public storage space queue is smaller than the number of the data storage spaces which can be accommodated at most, inserting the data storage spaces which need to be stored into the public storage space queue.
S308, determining adjacent execution units of the target execution unit, and inserting the data storage space into a storage space queue in the adjacent execution units.
If the number of the data storage spaces stored in the common storage space queue is equal to the number of the data storage spaces which can be contained in the common storage space queue, the common storage space queue is fully loaded at the moment, and new data storage spaces cannot be stored temporarily. The neighboring execution units of the target execution unit may be determined at this time by the following formula:
y＝x+1(modcnmax)
wherein x is the number of the target execution unit, y is the number of the adjacent execution unit, cnmax is the number of the execution units existing in the operating system.
It is to be appreciated that the adjacent execution unit may be any execution unit other than the target execution unit among the plurality of execution units in the operating system, and the user may use other manners of determining the adjacent execution unit according to the actual situation, which is not limited in the embodiments of the present disclosure.
According to the embodiment of the disclosure, by introducing the adjacent execution units, when the storage space queue in the target execution unit and the public storage space queue are fully loaded, the newly added data storage space can be inserted into the storage space queue in the adjacent execution unit, so that the problem that the system cannot process the user request in time due to the full loading of the storage space queue when the user request amount is large is further avoided, and the flexibility of the data storage space processing method is greatly improved.
Fig. 4 is a flowchart of a data storage space processing method according to another embodiment of the present disclosure, as shown in fig. 4, where the method includes the following steps based on the above embodiment:
s401, acquiring a data storage space.
Because the storage space queues all follow the rule of 'first in first out', namely, the newly added data storage space is inserted into the tail part of the storage space queues, and when the data storage space in the newly added data storage space is processed, the data storage space is acquired from the head part of the storage space queues. Specifically, a storage space queue in the target execution unit is checked, and if a data storage space exists in the storage space queue in the target execution unit, a data storage space is taken out from the head of the storage space queue in the target execution unit; if the storage space queue in the target execution unit does not have the data storage space, checking whether the common storage space queue has the data storage space. If the data storage space exists in the public storage space queue, taking out a data storage space from the head of the public storage space queue; if the data storage space does not exist in the common storage space queue, the storage space queues in the adjacent execution units are checked. And if the data storage space exists in the storage space queue in the adjacent execution unit, taking out one data storage space from the head of the storage space queue in the adjacent execution unit.
S402, obtaining an identification of target data corresponding to the data storage space, the size of the target data and a target storage position of the target data.
After receiving the user request, the operating system analyzes the request and obtains the unique identifier of the target data corresponding to the user request in the system, the size of the target data and the target storage position where the target data is to be stored.
S403, determining the data frame matched with the data storage space based on the size of the target data.
The data frame is used for loading the data storage space object and is divided into three states of idle state, ready state and use state, if the data frame is in the data frame pool 27, the idle state is the data frame; if the data frame is taken out from the data frame pool but is not participated in the data loading operation temporarily, the data frame is in a ready state; if the data frame is participating in the data loading operation, the data frame is in a use state. There is a pool of data frames 27 in the system that can hold a preset number of data frames in an idle state. The size of each data frame which can accommodate the data at most is preset by a user, the size of each data frame which can accommodate the data at most can be different, and the data frames are orderly arranged in the data frame pool according to the size of the data which can accommodate. A binary search is used to find a data frame in the data frame pool 27, so that the data frame can accommodate at most the data size closest to the size of the target data corresponding to the data storage space 21 and slightly larger than the size of the target data corresponding to the data storage space 21.
S404, binding the data storage space with the data frame, and obtaining the data frame of the bound data storage space.
The data frame matched with the data storage space 21 is taken out of the data frame pool 27 and bound with the data storage space 21 to obtain a data frame 28 of the bound data storage space. The state of the data frame is the ready state at this time.
S405, placing the data frame of the bound data storage space into a working data frame queue.
The working data frame queue 29 is used to store data frames of bound data storage space for multiple ready states, again following a "first in first out" rule. Binding the data frame which is most matched with the data storage space 21 to obtain the data frame 28 of the bound data storage space, and inserting the data frame 28 of the bound data storage space into the tail of the work data frame queue.
S406, acquiring the data frame of the bound data storage space from the work data frame queue.
S407, reading the target data based on the identification of the target data, and storing the target data in a target storage position in a data frame of the bound data storage space.
The data frames of the bound data storage space are sequentially fetched from the head of the work data frame queue 26, and the data frames of the bound data storage space are set to the work state. According to the identification of the target data corresponding to the data storage space, the operating system can find the corresponding target data in the system, control the data reading core to read the target data for the data frame of the bound data storage space, and store the data to the corresponding position according to the target storage position of the target data.
Specifically, if the size of the stored data in the data frame of the bound data storage space is smaller than the size of the target data within the preset time, the data frame of the bound data storage space is put into the working data frame queue again.
The execution unit needs a preset time for executing one data reading operation, and the preset time can be adjusted by a user according to actual needs. If the size of the stored data in the data frame of the bound data storage space is smaller than the size of the target data within the preset time, the data reading operation does not read all the target data. Because a single execution unit can only read data for a data frame of a bound data storage space at the same time, in order to avoid that target data is too large, the same execution unit reads data for the data frame of the same bound data storage space for a long time to cause the single execution unit to block, the data frame of the bound data storage space, which fails to acquire all target data in a preset time, is reinserted into the tail part of the working data frame queue 29, and the rest of target data is waited to be read for the data frame of the bound data storage space continuously next time.
If the size of the stored data in the data frame of the bound data storage space is not smaller than the size of the target data, then all the target data are stored in the data frame of the bound data storage space, the data frame state is set to be an idle state, the data frame is recycled into the data frame pool 27, the data storage space is waited for being called next time, and the data storage space storing the target data is returned through the system thread, namely the target data is fed back to the user.
According to the embodiment of the disclosure, the working data frame queue is introduced, so that the data frames of the bound data storage space with larger target data volume are read for multiple times, the problem that a single core is blocked due to the fact that a single core loads data for the data frames of the same bound data storage space for a long time in a CPU, and the data frames of the bound data storage space corresponding to other user requests cannot be processed in time is avoided, and the efficiency of the data storage space processing method is further improved.
Fig. 5 is a schematic structural diagram of a data storage space processing device according to an embodiment of the disclosure. The data storage space processing apparatus may be a CPU running an operating system as described in the above embodiments, or the data storage space processing apparatus may be a part or component in the CPU. The data storage space processing apparatus provided in the embodiment of the present disclosure may execute the processing flow provided in the embodiment of the data storage space processing method, as shown in fig. 5, the data storage space processing apparatus 50 includes: a creation module 51, a first viewing module 52, a second viewing module 53, an insertion module 54; wherein, the creation module 51 is configured to create a data storage space in response to a user request; the first checking module 52 is configured to check whether a storage space queue in a target execution unit is full, where the target execution unit is configured to execute a user request, and store target data corresponding to the user request into the data storage space; the second checking module 54 is configured to check whether the common storage space queue is full in a case that the storage space queue in the target execution unit is full; the inserting module 54 is configured to insert the data storage space into the common storage space queue if the common storage space queue is not fully loaded.
Optionally, the data storage space processing device 50 further includes a request processing module 55, configured to obtain a request serial number according to the user request; and determining a target execution unit in a plurality of execution units in the central processing unit according to the request sequence number.
Optionally, the inserting module 54 is further configured to determine an adjacent execution unit of the target execution unit, and insert the data storage space into a storage space queue in the adjacent execution unit when the common storage space queue is full.
Optionally, the first checking module 52 is further configured to check whether a data storage space exists in the target execution unit storage space queue; the second checking module 53 is further configured to check, if there is no data storage space in the target execution unit storage space queue, whether there is a data storage space in the common storage space queue; the request processing module 55 is further configured to obtain the data storage space if the data storage space exists in the common storage space queue.
Optionally, the request processing module 55 is further configured to determine an adjacent execution unit of the target execution unit if the data storage space does not exist in the common storage space queue, and check whether the data storage space exists in the storage space queue in the adjacent execution unit; and if the data storage space exists in the memory space queue in the adjacent execution unit, acquiring the data storage space.
Optionally, the request processing module 55 is further configured to obtain an identifier of target data corresponding to the data storage space, a size of the target data, and a target storage location of the target data; and reading the target data to the target storage position based on the identification of the target data, wherein the target storage position is positioned in the data storage space.
Optionally, the request processing module 55 is further configured to determine, based on the size of the target data, a data frame that matches the data storage space; binding the data storage space with the data frame to obtain a data frame of the bound data storage space; and placing the data frame of the bound data storage space into a working data frame queue.
The data storage space processing device of the embodiment shown in fig. 5 may be used to implement the technical solution of the above method embodiment, and its implementation principle and technical effects are similar, and are not described herein again.
Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the disclosure. The electronic device may be an electronic device as described in the above method embodiments. The electronic device provided in the embodiment of the present disclosure may execute the processing flow provided in the embodiment of the data storage space processing method, as shown in fig. 6, the electronic device 60 includes: a memory 61, a processor 62, computer programs and a communication interface 63; wherein the computer program is stored in the memory 61 and configured to be executed by the processor 62 for the data storage space processing method as described above. The processor 62 may be, in particular, a CPU running an operating system as described above.
In addition, the embodiment of the present disclosure also provides a computer-readable storage medium having stored thereon a computer program that is executed by a processor to implement the data storage space processing method described in the above embodiment.
Furthermore, the disclosed embodiments also provide a computer program product comprising a computer program or instructions which, when executed by a processor, implement a data storage space processing method as described above.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
It should be noted that in this document, relational terms such as "first" and "second" and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The foregoing is merely a specific embodiment of the disclosure to enable one skilled in the art to understand or practice the disclosure. 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 disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown and described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (10)

1. A method of data storage space processing, the method comprising:
responding to a user request, and creating a data storage space;
checking whether a storage space queue in a target execution unit is full, wherein the target execution unit is used for executing a user request and storing target data corresponding to the user request into the data storage space;
if the storage space queues in the target execution unit are full, checking whether the public storage space queues are full;
and if the public storage space queue is not fully loaded, inserting the data storage space into the public storage space queue.
2. The method of claim 1, wherein, in response to a user request, after creating the data storage space, the method further comprises:
acquiring a request serial number according to the user request;
and determining a target execution unit in a plurality of execution units in the central processing unit according to the request sequence number.
3. The method according to claim 1, wherein the method further comprises:
and if the common storage space queue is full, determining the adjacent execution units of the target execution unit, and inserting the data storage space into the storage space queue in the adjacent execution units.
4. The method according to claim 1, wherein the method further comprises:
checking whether a data storage space exists in a storage space queue in the target execution unit;
if the data storage space does not exist in the target execution unit storage space queue, checking whether the data storage space exists in the public storage space queue;
and if the data storage space exists in the public storage space queue, acquiring the data storage space.
5. The method according to claim 4, wherein the method further comprises:
if the data storage space does not exist in the public storage space queue, determining an adjacent execution unit of the target execution unit, and checking whether the data storage space exists in the storage space queue in the adjacent execution unit;
and if the data storage space exists in the memory space queue in the adjacent execution unit, acquiring the data storage space.
6. The method of claim 5, wherein after the data storage space is acquired, the method further comprises:
acquiring an identification of target data corresponding to the data storage space, the size of the target data and a target storage position of the target data;
and reading the target data to the target storage position based on the identification of the target data, wherein the target storage position is positioned in the data storage space.
7. The method of claim 6, wherein prior to reading the target data to the target storage location based on the identification of the target data, the method further comprises:
determining a data frame matched with the data storage space based on the size of the target data;
binding the data storage space with the data frame to obtain a data frame of the bound data storage space;
and placing the data frame of the bound data storage space into a working data frame queue.
8. A data storage space processing apparatus, the apparatus comprising:
the creation module is used for responding to the user request and creating a data storage space;
the first checking module is used for checking whether a storage space queue in the target execution unit is full or not, and the target execution unit is used for executing a user request and storing target data corresponding to the user request into the data storage space;
the second checking module is used for checking whether the public storage space queue is full or not under the condition that the storage space queue in the target execution unit is full;
and the inserting module is used for inserting the data storage space into the public storage space queue under the condition that the public storage space queue is not fully loaded.
9. An electronic device, comprising:
a memory;
a processor; and
a computer program;
wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method of any of claims 1-7.
10. A computer readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, implements the method according to any of claims 1-7.
CN202210497928.XA 2022-05-09 2022-05-09 Data storage space processing method, device, equipment and readable storage medium Pending CN117075793A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210497928.XA CN117075793A (en) 2022-05-09 2022-05-09 Data storage space processing method, device, equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210497928.XA CN117075793A (en) 2022-05-09 2022-05-09 Data storage space processing method, device, equipment and readable storage medium

Publications (1)

Publication Number Publication Date
CN117075793A true CN117075793A (en) 2023-11-17

Family

ID=88706634

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210497928.XA Pending CN117075793A (en) 2022-05-09 2022-05-09 Data storage space processing method, device, equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN117075793A (en)

Similar Documents

Publication Publication Date Title
US20160004542A1 (en) Booting method for computer system with multiple central processing units
US11204813B2 (en) System and method for multidimensional search with a resource pool in a computing environment
CN108572876B (en) Method and device for realizing read-write lock
CN102667714B (en) Support the method and system that the function provided by the resource outside operating system environment is provided
KR20190120041A (en) METHOD FOR HANDLING COMMAND ID CONFLICT SCENARIO IN NON-VOLATILE MEMORY EXPRESS(NVMe) BASED SOLID STATE DRIVE (SSD) CONTROLLER
CN103329102A (en) Multiprocessor system
US10313477B2 (en) System and method for use of a non-blocking process with a resource pool in a computing environment
CN102999423A (en) Multi-core testing method and device
CN113010265A (en) Pod scheduling method, scheduler, memory plug-in and system
US20110093663A1 (en) Atomic compare and write memory
CN115878333A (en) Method, device and equipment for judging consistency between process groups
CN117075793A (en) Data storage space processing method, device, equipment and readable storage medium
US20110191775A1 (en) Array-based thread countdown
US9639636B1 (en) Algorithmically driven selection of parallelization technique for running model simulation
CN109062702B (en) Computing resource allocation method, related device and readable storage medium
CN112764897B (en) Task request processing method, device and system and computer readable storage medium
CN115220908A (en) Resource scheduling method, device, electronic equipment and storage medium
US9619277B2 (en) Computer with plurality of processors sharing process queue, and process dispatch processing method
CN110618794B (en) Method and system for accessing NandFlash by SSD firmware
CN113034048A (en) Task processing method, device, server and storage medium
CN111708631A (en) Data processing method based on multi-path server, intelligent terminal and storage medium
CN117075792A (en) Data reading method, device, equipment and computer readable storage medium
JP2020086807A (en) Vehicle control device and program execution method
US9384046B2 (en) Information processing apparatus, computer product, and information processing method for multi-thread process
CN113687930B (en) Task management method, device, equipment and storage medium supporting automatic promotion

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