CN110941564B - Storage space allocation method and device, electronic equipment and storage medium - Google Patents
Storage space allocation method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN110941564B CN110941564B CN201811114548.3A CN201811114548A CN110941564B CN 110941564 B CN110941564 B CN 110941564B CN 201811114548 A CN201811114548 A CN 201811114548A CN 110941564 B CN110941564 B CN 110941564B
- Authority
- CN
- China
- Prior art keywords
- storage space
- data
- path
- current frame
- target
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Memory System (AREA)
Abstract
The embodiment of the invention provides a storage space allocation method, a storage space allocation device, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring current data of a first path of data stream in a plurality of paths of data streams; monitoring whether the data volume of the current frame data exceeds a first maximum storage data volume; when the data volume of the current frame data exceeds the first maximum storage data volume, the storage space which is allocated to the multi-channel data stream in the target storage space is released, and the storage space is allocated to the multi-channel data stream again from the second end of the two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space which is originally allocated to the multi-channel data stream. The storage space is saved on the premise that no storage space fragment is generated.
Description
Technical Field
The present invention relates to the field of computer application technologies, and in particular, to a storage space allocation method and apparatus, an electronic device, and a storage medium.
Background
In the technical field of video image processing, a hard disk video recorder can process multiple paths of video streams simultaneously. When the hard disk video recorder performs unloading, playback or other processing on the video stream, it is necessary to allocate a corresponding storage space for each path of video stream to buffer the image data of the path of video stream. The storage space allocated for each path of video stream can buffer one frame of image data of the path of video stream.
Since the data amount of each frame of image data is not fixed, the storage space allocated to each video stream is guaranteed to be capable of storing the maximum data amount of the single frame of image data in the video stream. Since the maximum amount of data is unknown, the maximum amount of storage data of the actually allocated storage space is generally larger than the maximum amount of data. Thereby causing a waste of storage space.
Disclosure of Invention
The embodiment of the invention aims to provide a storage space allocation method, a storage space allocation device, electronic equipment and a storage medium, so that the storage space is saved on the premise of not generating storage space fragments. The specific technical scheme is as follows:
in order to achieve the above object, an embodiment of the present invention provides a storage space allocation method, where the method includes:
acquiring current frame data of a first path of data stream in a plurality of paths of data streams; monitoring whether the data volume of the current frame data exceeds a first maximum storage data volume; the first maximum storage data size is the maximum storage data size of a storage space allocated to the first path of data stream in a target storage space, the target storage space includes a storage space allocated to each path of data stream, and the storage space allocated to each path of data stream is a continuous storage space located at a first end of two ends of the target storage space;
when the data volume of the current frame data exceeds the first maximum storage data volume, the storage space allocated to the multiple data streams in the target storage space is released, and the storage space is allocated to the multiple data streams again from the second end of the two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space allocated to the multiple data streams.
Optionally, the step of releasing the storage space allocated to the multiple data streams in the target storage space, and allocating storage spaces for the multiple data streams again from a second end of the two ends of the target storage space according to the data size of the current frame data and the maximum storage data size of the storage space originally allocated to the multiple data streams includes:
releasing the storage space allocated to the first path of data flow in the target storage space; according to the data volume of the current frame data, starting from a second end of the two ends of the target storage space, allocating an unoccupied storage space for the first path of data flow again;
and sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from the second end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream.
Optionally, the step of allocating a storage space for the first data stream again from a second end of the two ends of the target storage space according to the data volume of the current frame data includes:
judging whether an available storage space exists in the target storage space, wherein the available storage space is as follows: the maximum storage data volume is greater than or equal to the data volume of the current frame data and is an unoccupied continuous storage space;
and if so, allocating unoccupied storage space for the first path of data flow from the second end of the target storage space again according to the data volume of the current frame data.
Optionally, the method further includes:
if the available storage space does not exist in the target storage space, allocating a temporary storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data;
sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from a third end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream; the third end is the same as the first end, or the third end is the same as the second end;
and releasing the temporary storage space, and allocating an unoccupied storage space for the first path of data flow from a third end of the target storage space again according to the data volume of the current frame data.
Optionally, the step of releasing the temporary storage space and allocating an unoccupied storage space for the first data flow from a third end of the target storage space again according to the data volume of the current frame data includes:
judging whether the maximum storage data volume of the unoccupied storage space in the target storage space exceeds the data volume of the current frame data;
and if so, releasing the temporary storage space, and starting from a third end of the target storage space, and allocating an unoccupied storage space for the first path of data flow again.
Optionally, the method further includes:
and if the maximum storage data volume of the unoccupied storage space in the target storage space does not exceed the data volume of the current frame data, determining the temporary storage space as a permanent storage space.
Optionally, after determining the temporary storage space as a permanent storage space, the method further includes:
re-acquiring current frame data of the first data stream;
monitoring whether the data volume of the current frame data obtained again exceeds the maximum storage data volume of the permanent storage space;
and if so, releasing the permanent storage space, and reallocating the permanent storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data acquired again.
In order to achieve the above object, an embodiment of the present invention further provides a storage space allocation apparatus, where the apparatus includes:
the acquisition module is used for acquiring current frame data of a first path of data stream in the multi-path data stream;
the monitoring module is used for monitoring whether the data volume of the current frame data exceeds a first maximum storage data volume; the first maximum storage data size is the maximum storage data size of a storage space allocated to the first path of data stream in a target storage space, the target storage space includes a storage space allocated to each path of data stream, and the storage space allocated to each path of data stream is a continuous storage space located at a first end of two ends of the target storage space;
and the allocation module is used for releasing the storage space allocated to the multiple paths of data streams in the target storage space when the data volume of the current frame data exceeds the first maximum storage data volume, and reallocating the storage space for the multiple paths of data streams from the second end of the two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space allocated to the multiple paths of data streams.
Optionally, the allocation module is specifically configured to:
releasing the storage space allocated to the first path of data flow in the target storage space; according to the data volume of the current frame data, starting from a second end of the two ends of the target storage space, allocating an unoccupied storage space for the first path of data flow again;
and sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from the second end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream.
Optionally, the allocation module is specifically configured to:
judging whether an available storage space exists in the target storage space, wherein the available storage space is as follows: the maximum storage data volume is greater than or equal to the data volume of the current frame data and is an unoccupied continuous storage space;
and if so, allocating unoccupied storage space for the first path of data flow from the second end of the target storage space again according to the data volume of the current frame data.
Optionally, the allocation module is specifically configured to:
if the available storage space does not exist in the target storage space, allocating a temporary storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data;
sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from a third end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream; the third end is the same as the first end, or the third end is the same as the second end;
and releasing the temporary storage space, and allocating an unoccupied storage space for the first path of data flow from a third end of the target storage space again according to the data volume of the current frame data.
Optionally, the allocation module is specifically configured to:
judging whether the maximum storage data volume of the unoccupied storage space in the target storage space exceeds the data volume of the current frame data;
and if so, releasing the temporary storage space, and starting from a third end of the target storage space, and allocating an unoccupied storage space for the first path of data flow again.
Optionally, the allocation module is specifically configured to:
and if the maximum storage data volume of the unoccupied storage space in the target storage space does not exceed the data volume of the current frame data, determining the temporary storage space as a permanent storage space.
Optionally, the apparatus further comprises:
the acquisition module is used for acquiring the current frame data of the first data stream again;
the monitoring module is used for monitoring whether the data volume of the current frame data obtained again exceeds the maximum storage data volume of the permanent storage space;
and the allocation module is used for releasing the permanent storage space when the monitoring result of the monitoring module is yes, and reallocating the permanent storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data acquired again.
To achieve the above object, an embodiment of the present invention further provides an electronic device, including a processor and a machine-readable storage medium, where the machine-readable storage medium stores machine-executable instructions executable by the processor, and the processor is caused by the machine-executable instructions to: implementing any of the above method steps.
To achieve the above object, an embodiment of the present invention further provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements any of the above method steps.
The storage space allocation method, the device, the electronic device and the storage medium provided by the embodiments of the present invention can acquire current frame data of a first path of data stream in a plurality of paths of data streams, when it is monitored that the data volume of the current frame data exceeds a first maximum storage data volume, release the storage space allocated to the plurality of paths of data streams in a target storage space, and reallocate the storage space for the plurality of paths of data streams from a second end of two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space originally allocated to the plurality of paths of data streams.
Therefore, in the embodiment of the present invention, the storage space is allocated to the multiple data streams according to the data amount of the current frame data of each data stream and the maximum storage data amount of the storage space that has been originally allocated to the multiple data streams, that is, the storage space is allocated as needed, so that the waste of the storage space is not generated, and the storage space is saved. In addition, each time the storage space is changed, the storage space previously allocated to each data stream is released, and then the storage space is allocated to the data streams from one end of the target storage space again, and the allocated storage spaces are still continuous, so that the generation of storage space fragments is avoided.
Of course, it is not necessary for any product or method of practicing the invention to achieve all of the above-described advantages at the same time.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a storage space allocation method according to an embodiment of the present invention;
FIG. 2 is a first exemplary diagram of a storage space allocation provided by an embodiment of the present invention;
FIG. 3 is a second exemplary diagram of a storage space allocation provided by an embodiment of the present invention;
FIG. 4 is a third exemplary diagram of a storage space allocation provided by an embodiment of the present invention;
FIG. 5 is a fourth exemplary diagram of a storage space allocation provided by the embodiment of the invention;
FIG. 6 is a fifth exemplary diagram of a storage space allocation provided by an embodiment of the present invention;
FIG. 7 is a diagram illustrating a sixth exemplary allocation of storage space according to an embodiment of the present invention;
FIG. 8 is a seventh exemplary diagram of a storage space allocation provided by the embodiment of the invention;
FIG. 9 is an eighth exemplary diagram of a storage space allocation provided by an embodiment of the present invention;
FIG. 10 is a diagram illustrating a ninth exemplary allocation of storage space according to an embodiment of the present invention;
FIG. 11 is a diagram illustrating a tenth exemplary allocation of storage space according to an embodiment of the present invention;
FIG. 12 is an eleventh exemplary diagram of storage allocation according to the embodiment of the present invention;
FIG. 13 is a schematic structural diagram of a storage space allocation apparatus according to an embodiment of the present invention;
fig. 14 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
At present, when a hard disk video recorder processes multiple data streams simultaneously, it is necessary to allocate a storage space for each data stream to buffer single-frame data in the data stream. Since the data amount of each frame of data is not fixed, the storage space allocated to each data stream should ensure that the maximum data amount of the single frame of data in the data stream can be stored. However, the maximum data amount of the single-frame data in each data flow is unknown, so the user sets a predetermined maximum data amount of the single-frame data for each data flow, which is usually larger than the real maximum data amount of the single-frame data in the data flow.
For example, if the maximum data amount of actual single frame data in a certain data stream is 0.6M, since the value of the maximum data amount is unknown, the maximum data amount of preset single frame data set by the user for the data stream may be 0.7M, so that a storage space of 0.7M is allocated for the data stream, which would result in a waste of the storage space.
In order to solve the problem of the foregoing memory space waste, an embodiment of the present invention provides a memory space allocation method.
For ease of understanding, the following description will be made of an application scenario of the embodiment of the present invention.
The embodiment of the invention is applied to a scene in which multiple storage services are simultaneously carried out. For example, when a hard disk video recorder processes multiple data streams, it is necessary to allocate a corresponding storage space for each data stream to buffer single-frame data in the data stream. The storage space allocation method provided by the embodiment of the invention can be applied to a hard disk video recorder or electronic equipment connected with the hard disk video recorder. The embodiment of the present invention does not limit this.
The storage service includes, but is not limited to, playback, video transmission, IPC (IP camera) preview, and the like. The data stream corresponding to the storage service includes: playback data stream, transport code stream, IPC previewed video stream, etc.
The following describes the storage space allocation method provided by the embodiment of the present invention in detail by taking an execution subject as an electronic device connected to a hard disk recorder, and the hard disk recorder playing back multiple data streams simultaneously as an example.
Each path of playback data stream is composed of data of one frame and one frame, so that when the hard disk video recorder performs multi-path playback simultaneously, a storage space needs to be allocated for each path of playback data stream to buffer single-frame data of the path of playback data stream.
For convenience of description, in the embodiment of the present invention, allocating a storage space for a certain playback is equivalent to allocating a storage space for a data stream of the playback.
Referring to fig. 1, fig. 1 is a flowchart of a storage space allocation method according to an embodiment of the present invention, where the method includes the following steps:
s101: and acquiring current frame data of a first path of data stream in the multi-path data stream.
The method for allocating storage space provided in the embodiment of the present invention is the same for each data stream, and here, only the first data stream in the multiple data streams is taken as an example for description, and is not limited.
S102: monitoring whether the data volume of the current frame data exceeds a first maximum storage data volume.
The first maximum storage data size is the maximum storage data size of the storage space allocated to the first path of data flow in the target storage space. The target storage space includes a storage space allocated to each data stream, and the storage space allocated to each data stream is a continuous storage space located at a first end of the two ends of the target storage space. In the embodiment of the present invention, the maximum storage data amount of the target storage space is also set by the user, and since the storage space is allocated to each data stream according to the requirement in the embodiment of the present invention, the preset target storage space does not need to be too large, and the maximum storage data amount of the target storage space is smaller than the sum of the maximum data amounts of the preset single frame data of each data stream.
The following is described in connection with an example of memory allocation shown in fig. 2. In the embodiment of the present invention, if the maximum data size of the preset single frame data set by the user for each data stream is 0.7M, and if there are four playback data streams, in the embodiment of the present invention, the maximum storage data size of the target storage space set by the user may be less than 4 × 0.7 — 2.8M, as shown in fig. 2, a 2M target storage space is allocated for the four playback data streams, and then the maximum storage data size of the target storage space is 2M.
The target storage space includes a storage space allocated to each data stream, as shown in fig. 2, each data stream is allocated with 0.2M of storage space, the allocated storage space is from the a end of the target storage space, and the storage spaces allocated to the data streams are continuous. It can be seen that there is 1.2M of unoccupied storage space in the target storage space at this time.
S103: when the data volume of the current frame data exceeds the first maximum storage data volume, the storage space which is allocated to the multi-channel data stream in the target storage space is released, and the storage space is allocated to the multi-channel data stream again from the second end of the two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space which is originally allocated to the multi-channel data stream.
For example, as shown in fig. 2, the size of the storage space allocated to the data stream of playback 1 is 0.2M. When the data volume of the current frame data of the data stream of the playback 1 is detected to be 0.5M, wherein 0.5M is more than 0.2M, the storage space of the target storage space, which is already allocated to the data streams of the playback 1-4, is released, and the storage space is allocated to the data streams of the playback 1-4 again from the B end of the target storage space. When the storage space is allocated, the storage space for the data stream of playback 1 is allocated according to the data amount of the current frame data in the data stream of playback 1, that is, 0.5M of storage space is allocated for the data stream of playback 1. The storage space for the playback 2-4 data streams is allocated according to the maximum storage data amount of the storage space previously allocated to the playback, that is, the playback 2-4 data streams are respectively allocated with 0.2M storage space. See in particular the schematic diagram of the memory allocation shown in fig. 3.
The storage space allocation method provided by the embodiment of the invention can acquire the current frame data of the first path of data stream in the multiple paths of data streams, when the data volume of the current frame data is monitored to exceed the first maximum storage data volume, the storage space allocated to the multiple paths of data streams in the target storage space is released, and the storage space is allocated to the multiple paths of data streams again from the second end of the two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space allocated to the multiple paths of data streams originally.
Therefore, in the embodiment of the invention, the storage space is allocated to the multiple paths of data streams according to the data volume of the current frame data of each path of data stream, that is, the storage space is allocated as required, and the waste of the storage space is not generated. In addition, each time the storage space is changed, the storage space previously allocated to each data stream is released, and then the storage space is allocated to the data streams from one end of the target storage space again, and the allocated storage spaces are still continuous, so that the generation of storage space fragments is avoided.
In the embodiment of the present invention, the step S103 may specifically include the following refinement steps.
Step S1031: when the data volume of the current frame data exceeds a first maximum storage data volume, releasing the storage space allocated to the first path of data flow in the target storage space; and according to the data volume of the current frame data, starting from the second end of the two ends of the target storage space, and allocating the unoccupied storage space for the first path of data flow again.
For example, as shown in fig. 2, when it is monitored that the data amount of the current frame data in the data stream of playback 1 is 0.5M, the storage space allocated to the data stream of playback 1 in the target storage space may be released first, and then from the B end of the target storage space, the unoccupied storage space may be allocated again to the data stream of playback 1, where the maximum storage data amount of the storage space is 0.5M, as shown in fig. 4.
Step S1032: and sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating the unoccupied storage spaces for all the data streams except the first path of data stream from the second end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream.
After the storage space is allocated to the first path of data flow, the storage space already allocated to other paths of data flows may be sequentially released, and then the unoccupied storage space may be reallocated to other paths of data flows.
The embodiment of the invention does not limit the sequence of allocating the storage space to other data streams. In order to reduce the influence on the other paths of data streams, the idle time of the other paths of data streams can be used for reallocation. For example, at a certain time, the storage space of playback 2 and playback 3 is being used for buffering the current frame data of the data stream played back by the way, and is in an operating state. And the current frame data of the data stream of the playback 4 is already buffered and sent to the next processing unit, and the next frame data does not reach the storage space allocated to the playback 4 yet, so that the storage space allocated to the playback 4 at the current time is in an idle state, the storage space allocated to the playback 4 can be released first, and the storage space is reallocated to the playback 4. The specific process is as follows: as shown in fig. 4, after allocating a storage space for playback 1, the storage space already allocated to playback 4 is released, and from the B-side of the target storage space, the unoccupied storage space is reallocated for playback 4, as shown in fig. 5, the maximum storage data amount of the reallocated storage space and the storage space previously allocated to playback 4 are the same, and are both 0.2M.
When the storage space of playback 3 or playback 2 is in an idle state, the storage space is allocated again in turn. When the re-allocation of the storage space of playback 3 or playback 2 is completed, the respective storage spaces are continuous again, as can be seen in fig. 3.
In an implementation manner of the present invention, the step of allocating an unoccupied storage space for the first data stream again from the second end of the two ends of the target storage space according to the data volume of the current frame data may specifically include:
judging whether an available storage space exists in the target storage space, wherein the available storage space is as follows: the maximum storage data amount is larger than the data amount equal to the current frame data and the unoccupied continuous storage space.
And if the available storage space exists in the target storage space, allocating the unoccupied storage space for the first path of data flow again from the second end of the target storage space according to the data volume of the current frame data.
In one implementation of the present invention, if there is no available storage space in the target storage space, the following steps are performed.
And 11, distributing a temporary storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data.
Now, with reference to fig. 6, assuming that the storage spaces allocated to playback 1, playback 2, playback 3, and playback 4 at the current time are 0.4M, 0.5M, and 0.2M, respectively, the maximum storable data amount of the unoccupied storage space in the current target storage space is 0.5M. If the data volume of the current frame data of the data stream of playback 1 is 0.6M and is greater than the storage space currently allocated to playback 1, the storage space needs to be reallocated to playback 1.
When the storage space is reallocated for playback 1, it is first determined whether an available storage space exists in the target storage space, and the data volume of the current frame data of the data stream of playback 1 is 0.6M, then the maximum storage data volume of the available storage space needs to be greater than or equal to 0.6M, and the available storage space must be an unoccupied and continuous storage space. As can be seen from fig. 6, if there is no available storage space in the current target storage space, a temporary storage space with a maximum storable data amount of 0.6M may be allocated for playback 1 outside the target storage space, as shown in fig. 7.
Step 12, sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from a third end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream; the third end is the same as the first end, or the third end is the same as the second end.
After allocating the temporary storage space for playback 1, the storage space allocated to the data streams in the target storage space may be reordered. The rearrangement may be from the end A of the target storage space or from the end B of the target storage space.
Now, the description will be given with reference to fig. 7 and 8. In the schematic diagram of the storage space allocation shown in fig. 8, the storage space is reallocated from the a end of the target storage space to the data streams played back 2, 3 and 4. The specific process is as follows: releasing the storage space with the maximum storage data volume of 0.2M previously allocated for the playback 4, and from the end A of the target storage space, allocating the unoccupied storage space with the maximum storage data volume of 0.2M for the playback 4 again; releasing the storage space with the maximum storage data volume of 0.5M previously allocated for the playback 3, and from the end A of the target storage space, allocating the unoccupied storage space with the maximum storage data volume of 0.5M for the playback 3 again; the storage space with the maximum storage data amount of 0.4M previously allocated for playback 2 is released, and from the a end of the target storage space, the unoccupied storage space with the maximum storage data amount of 0.4M is newly allocated for playback 2.
In the embodiment of the invention, the storage space can be redistributed by utilizing the free time of each playback path.
After the storage space is reallocated for playback 2, 3, 4, the storage space occupied by playback 4, playback 3, playback 2 is continuous starting from the a end of the target storage space, and can be seen from the schematic diagram of storage space allocation shown in fig. 8.
Of course, when the storage space is reallocated for playback 2, 3, 4, it is also possible to start from the B-side of the target storage space.
In an implementation manner of the present invention, if the storage space originally allocated to the first path of data stream is located between the storage spaces allocated to the other two paths of data streams, after allocating a temporary storage space to the first path of data stream, when rearranging the other data streams except the first path of data stream, it is not necessary to reallocate a storage space to each path of data stream. Referring to fig. 9, since the storage space originally allocated for playback 1 is located between the storage spaces of playback 3 and playback 4, after allocating the temporary storage space for playback 1, the storage space rearrangement can be completed only by reallocating the storage space of playback 4. Specifically, the 0.2M memory space originally allocated for playback 4 may be released, and from the a end of the target memory space, the unoccupied 0.2M memory space may be allocated for playback 4 again.
And step 13, releasing the temporary storage space, and allocating the unoccupied storage space for the first path of data flow again from the third end of the target storage space according to the data volume of the current frame data.
Following step 12 above, in this step, the temporary storage space allocated for playback 1 is released, and from the a end of the target storage space, the unoccupied storage space is allocated again for playback 1, as can be seen in fig. 11.
In an implementation manner of the present invention, it may also be determined whether the maximum storage data amount of the unoccupied storage space in the target storage space exceeds the data amount of the current frame data;
and if so, releasing the temporary storage space, and starting from a third end of the target storage space, and allocating the unoccupied storage space for the first path of data flow again.
In the embodiment shown in fig. 9, after the unoccupied storage space is reallocated for playback 2, playback 3, and playback 4, the maximum storage data amount of the unoccupied storage space in the current target storage space is 0.9M, as can be seen in fig. 10. If the data amount of the current frame data in playback 1 does not exceed 0.6M, the temporary storage space may be released, and an unoccupied storage space may be newly allocated for playback 1 in the target storage space. After allocating the storage space for playback 1 again, as can be seen from fig. 11, it can be seen that the storage space occupied by playback 1 is returned to the target storage space again.
In one implementation of the present invention, the temporary storage space is determined as the permanent storage space if the maximum storage data amount of the unoccupied storage space in the target storage space does not exceed the data amount of the current frame data.
After the unoccupied storage space is reallocated for playback 2, playback 3, and playback 4, the maximum storage data amount of the unoccupied storage space in the current target storage space is 0.9M, and if the data amount of the current frame data of playback 1 is 1M, the memory cannot be reallocated for playback 1 in the target storage space. The temporary storage space is determined as a permanent storage space. I.e. playback 1 will always occupy storage space outside the target storage space.
In one implementation manner of the present invention, after determining the temporary storage space as the permanent storage space, the method may further include:
re-acquiring current frame data of the first data stream; monitoring whether the data volume of the current frame data obtained again exceeds the maximum storage data volume of the permanent storage space; and if so, releasing the permanent storage space, and reallocating the permanent storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data acquired again.
As shown in fig. 12, if the data amount of the current frame data of the data stream in playback 1 obtained again is 1.1M, and exceeds the maximum storage data amount 1M of the current permanent storage space, the storage space needs to be allocated again for playback 1. The specific process is to release the current persistent storage space and reallocate the persistent storage space for playback 1 outside the target storage space, wherein the maximum storage data volume of the reallocated persistent storage space is 1.1M.
It can be seen that, in the storage space allocation method provided in the embodiment of the present invention, a target storage space may be allocated to multiple data streams in advance, where the target storage space includes a storage space allocated to each data stream, and when it is monitored that the storage space allocated to a certain data stream is not enough to cache current frame data in the data stream, the storage space may be reallocated to the data stream from the other end of the target storage space, and then the storage spaces of other data streams except the data stream are reallocated, so that the storage spaces of the data streams after reallocation are continuous and still located at one end of the target storage space.
In view of the above, in the embodiment of the present invention, the storage space is allocated to the multiple data streams according to the data amount of the current frame data of each data stream, that is, the storage space is allocated as needed, and thus, waste of the storage space is not generated. In addition, each time the storage space is changed, the storage space previously allocated to each data stream is released, and then the storage space is allocated to the data streams from one end of the target storage space again, and the allocated storage spaces are still continuous, so that the generation of storage space fragments is avoided.
Based on the same inventive concept, according to the above embodiment of the storage space allocation method, an embodiment of the present invention further provides a storage space allocation apparatus, referring to fig. 13, which may include the following modules:
an obtaining module 1301, configured to obtain current frame data of a first data stream in the multiple data streams;
a monitoring module 1302, configured to monitor whether a data amount of current frame data exceeds a first maximum storage data amount; the first maximum storage data volume is the maximum storage data volume of the storage space allocated to the first path of data flow in the target storage space, the target storage space comprises the storage space allocated to each path of data flow, and the storage space allocated to each path of data flow is a continuous storage space at the first end of two ends of the target storage space;
and the allocating module 1303, configured to release the storage space allocated to the multiple data streams in the target storage space when it is monitored that the data amount of the current frame data exceeds the first maximum storage data amount, and reallocate the storage space for the multiple data streams from the second end of the two ends of the target storage space according to the data amount of the current frame data and the maximum storage data amount of the storage space originally allocated to the multiple data streams.
In this embodiment of the present invention, the allocating module 1303 is specifically configured to:
releasing the storage space allocated to the first path of data flow in the target storage space; according to the data volume of the current frame data, starting from a second end of two ends of the target storage space, allocating an unoccupied storage space for the first path of data flow again;
and sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating the unoccupied storage spaces for all the data streams except the first path of data stream from the second end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream.
In this embodiment of the present invention, the allocating module 1303 is specifically configured to:
judging whether an available storage space exists in the target storage space, wherein the available storage space is as follows: the maximum storage data volume is larger than or equal to the data volume of the current frame data and is not occupied continuous storage space;
and if so, allocating unoccupied storage space for the first path of data flow again from the second end of the target storage space according to the data volume of the current frame data.
In this embodiment of the present invention, the allocating module 1303 is specifically configured to:
if the target storage space does not have available storage space, distributing a temporary storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data;
sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from a third end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream; the third end is the same as the first end, or the third end is the same as the second end;
and releasing the temporary storage space, and allocating the unoccupied storage space for the first path of data flow from the third end of the target storage space again according to the data volume of the current frame data.
In this embodiment of the present invention, the allocating module 1303 is specifically configured to:
judging whether the maximum storage data volume of the unoccupied storage space in the target storage space exceeds the data volume of the current frame data;
and if so, releasing the temporary storage space, and starting from a third end of the target storage space, and allocating the unoccupied storage space for the first path of data flow again.
In this embodiment of the present invention, the allocating module 1303 is specifically configured to:
and if the maximum storage data amount of the unoccupied storage space in the target storage space does not exceed the data amount of the current frame data, determining the temporary storage space as a permanent storage space.
In this embodiment of the present invention, the obtaining module may be further configured to obtain current frame data of the first data stream again;
the monitoring module can be further used for monitoring whether the data volume of the current frame data obtained again exceeds the maximum storage data volume of the permanent storage space;
the allocation module may be further configured to release the permanent storage space when the monitoring result of the monitoring module is yes, and reallocate the permanent storage space for the first path of data flow outside the target storage space according to the data amount of the current frame data that is reacquired.
It can be seen that, in the storage space allocation apparatus provided in the embodiment of the present invention, a target storage space may be allocated to multiple paths of data streams in advance, where the target storage space includes a storage space allocated to each path of data stream, and when it is monitored that the storage space allocated to a certain path of data stream is not enough to cache current frame data in the path of data stream, the storage space may be reallocated to the path of data stream from the other end of the target storage space, and then the storage spaces of other data streams except the path of data stream are reallocated, so that the storage spaces of each path of data stream after reallocation are continuous and still located at one end of the target storage space.
In view of the above, in the embodiment of the present invention, the storage space is allocated to the multiple data streams according to the data amount of the current frame data of each data stream, that is, the storage space is allocated as needed, and thus, waste of the storage space is not generated. In addition, each time the storage space is changed, the storage space previously allocated to each data stream is released, and then the storage space is allocated to the data streams from one end of the target storage space again, and the allocated storage spaces are still continuous, so that the generation of storage space fragments is avoided.
Based on the same inventive concept, according to the above embodiment of the memory space allocation method, an embodiment of the present invention further provides an electronic device, as shown in fig. 14, including a processor 1401, a communication interface 1402, a memory 1403, and a communication bus 1404, where the processor 1401, the communication interface 1402, and the memory 1403 are communicated with each other via the communication bus 1404,
a memory 1403 for storing a computer program;
the processor 1401 is configured to implement the above-described embodiment of the memory space allocation method when executing the program stored in the memory 1403. The storage space allocation method comprises the following steps:
acquiring current frame data of a first path of data stream in a plurality of paths of data streams;
monitoring whether the data volume of the current frame data exceeds a first maximum storage data volume; the first maximum storage data volume is the maximum storage data volume of the storage space allocated to the first path of data flow in the target storage space, the target storage space comprises the storage space allocated to each path of data flow, and the storage space allocated to each path of data flow is a continuous storage space at the first end of two ends of the target storage space;
when the data volume of the current frame data exceeds the first maximum storage data volume, the storage space which is allocated to the multi-channel data stream in the target storage space is released, and the storage space is allocated to the multi-channel data stream again from the second end of the two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space which is originally allocated to the multi-channel data stream.
The embodiment of the invention allocates the storage space for the multi-path data stream according to the data volume of the current frame data of each path of data stream, namely allocates the storage space as required, thereby avoiding the waste of the storage space. In addition, each time the storage space is changed, the storage space previously allocated to each data stream is released, and then the storage space is allocated to the data streams from one end of the target storage space again, and the allocated storage spaces are still continuous, so that the generation of storage space fragments is avoided.
The communication bus 1404 may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus 1404 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 14, but this is not intended to represent only one bus or type of bus.
The communication interface 1402 is used for communication between the above-described electronic apparatus and other apparatuses.
The Memory 1403 may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Alternatively, the memory 1403 can also be at least one storage device located remotely from the processor.
The Processor 1401 may be a general-purpose Processor including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
Based on the same inventive concept, according to the above embodiment of the storage space allocation method, in a further embodiment provided by the present invention, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program is executed by a processor to implement any of the above steps of the storage space allocation method.
It is noted that, herein, relational terms such as first and second, and the like may be 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. Also, 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 an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the apparatus embodiment, the electronic device embodiment and the computer-readable storage medium embodiment, since they are substantially similar to the method embodiment, the description is relatively simple, and the relevant points can be referred to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.
Claims (16)
1. A method for allocating storage space, the method comprising:
acquiring current frame data of a first path of data stream in a plurality of paths of data streams;
monitoring whether the data volume of the current frame data exceeds a first maximum storage data volume; the first maximum storage data size is the maximum storage data size of a storage space allocated to the first path of data stream in a target storage space, the target storage space includes a storage space allocated to each path of data stream, and the storage space allocated to each path of data stream is a continuous storage space located at a first end of two ends of the target storage space;
when the data volume of the current frame data exceeds the first maximum storage data volume, the storage space allocated to the multiple data streams in the target storage space is released, and the storage space is allocated to the multiple data streams again from the second end of the two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space allocated to the multiple data streams.
2. The method according to claim 1, wherein the step of releasing the storage space allocated to the multiple data streams in the target storage space and reallocating the storage space to the multiple data streams from the second end of the two ends of the target storage space according to the data size of the current frame data and the maximum storage data size of the storage space allocated to the multiple data streams comprises:
releasing the storage space allocated to the first path of data flow in the target storage space; according to the data volume of the current frame data, starting from a second end of the two ends of the target storage space, allocating an unoccupied storage space for the first path of data flow again;
and sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from the second end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream.
3. The method according to claim 2, wherein the step of reallocating the storage space for the first data stream from the second end of the two ends of the target storage space according to the data amount of the current frame data comprises:
judging whether an available storage space exists in the target storage space, wherein the available storage space is as follows: the maximum storage data volume is greater than or equal to the data volume of the current frame data and is an unoccupied continuous storage space;
and if so, allocating unoccupied storage space for the first path of data flow from the second end of the target storage space again according to the data volume of the current frame data.
4. The method of claim 3, further comprising:
if the available storage space does not exist in the target storage space, allocating a temporary storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data;
sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from a third end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream; the third end is the same as the first end, or the third end is the same as the second end;
and releasing the temporary storage space, and allocating an unoccupied storage space for the first path of data flow from a third end of the target storage space again according to the data volume of the current frame data.
5. The method according to claim 4, wherein the step of releasing the temporary storage space and allocating the unoccupied storage space for the first data flow again from the third end of the target storage space according to the data amount of the current frame data comprises:
judging whether the maximum storage data volume of the unoccupied storage space in the target storage space exceeds the data volume of the current frame data;
and if so, releasing the temporary storage space, and starting from a third end of the target storage space, and allocating an unoccupied storage space for the first path of data flow again.
6. The method of claim 5, further comprising:
and if the maximum storage data volume of the unoccupied storage space in the target storage space does not exceed the data volume of the current frame data, determining the temporary storage space as a permanent storage space.
7. The method of claim 6, further comprising, after determining the temporary storage space as a permanent storage space:
re-acquiring current frame data of the first path of data stream;
monitoring whether the data volume of the current frame data obtained again exceeds the maximum storage data volume of the permanent storage space;
and if so, releasing the permanent storage space, and reallocating the permanent storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data acquired again.
8. A storage space allocation apparatus, the apparatus comprising:
the acquisition module is used for acquiring current frame data of a first path of data stream in the multi-path data stream;
the monitoring module is used for monitoring whether the data volume of the current frame data exceeds a first maximum storage data volume; the first maximum storage data size is the maximum storage data size of a storage space allocated to the first path of data stream in a target storage space, the target storage space includes a storage space allocated to each path of data stream, and the storage space allocated to each path of data stream is a continuous storage space located at a first end of two ends of the target storage space;
and the allocation module is used for releasing the storage space allocated to the multiple paths of data streams in the target storage space when the data volume of the current frame data exceeds the first maximum storage data volume, and reallocating the storage space for the multiple paths of data streams from the second end of the two ends of the target storage space according to the data volume of the current frame data and the maximum storage data volume of the storage space allocated to the multiple paths of data streams.
9. The apparatus of claim 8, wherein the assignment module is specifically configured to:
releasing the storage space allocated to the first path of data flow in the target storage space; according to the data volume of the current frame data, starting from a second end of the two ends of the target storage space, allocating an unoccupied storage space for the first path of data flow again;
and sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from the second end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream.
10. The apparatus according to claim 9, wherein the allocation module is specifically configured to:
judging whether an available storage space exists in the target storage space, wherein the available storage space is as follows: the maximum storage data volume is greater than or equal to the data volume of the current frame data and is an unoccupied continuous storage space;
and if so, allocating unoccupied storage space for the first path of data flow from the second end of the target storage space again according to the data volume of the current frame data.
11. The apparatus according to claim 10, wherein the allocation module is specifically configured to:
if the available storage space does not exist in the target storage space, allocating a temporary storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data;
sequentially releasing the storage spaces allocated to all the data streams except the first path of data stream in the target storage space, and reallocating unoccupied storage spaces for all the data streams except the first path of data stream from a third end of the target storage space according to the maximum storage data amount of the storage spaces of all the data streams except the first path of data stream; the third end is the same as the first end, or the third end is the same as the second end;
and releasing the temporary storage space, and allocating an unoccupied storage space for the first path of data flow from a third end of the target storage space again according to the data volume of the current frame data.
12. The apparatus according to claim 11, wherein the allocation module is specifically configured to:
judging whether the maximum storage data volume of the unoccupied storage space in the target storage space exceeds the data volume of the current frame data;
and if so, releasing the temporary storage space, and starting from a third end of the target storage space, and allocating an unoccupied storage space for the first path of data flow again.
13. The apparatus according to claim 12, wherein the allocation module is specifically configured to:
and if the maximum storage data volume of the unoccupied storage space in the target storage space does not exceed the data volume of the current frame data, determining the temporary storage space as a permanent storage space.
14. The apparatus of claim 13, further comprising:
the acquisition module is used for acquiring the current frame data of the first path of data flow again;
the monitoring module is used for monitoring whether the data volume of the current frame data obtained again exceeds the maximum storage data volume of the permanent storage space;
and the allocation module is used for releasing the permanent storage space when the monitoring result of the monitoring module is yes, and reallocating the permanent storage space for the first path of data flow outside the target storage space according to the data volume of the current frame data acquired again.
15. An electronic device comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: carrying out the method steps of any one of claims 1 to 7.
16. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811114548.3A CN110941564B (en) | 2018-09-25 | 2018-09-25 | Storage space allocation method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811114548.3A CN110941564B (en) | 2018-09-25 | 2018-09-25 | Storage space allocation method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110941564A CN110941564A (en) | 2020-03-31 |
| CN110941564B true CN110941564B (en) | 2022-03-04 |
Family
ID=69905378
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811114548.3A Active CN110941564B (en) | 2018-09-25 | 2018-09-25 | Storage space allocation method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110941564B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1553344A (en) * | 2003-06-04 | 2004-12-08 | 中兴通讯股份有限公司 | Method for dynamic distributing memory in multiple queue process realize |
| CN102135943A (en) * | 2011-03-23 | 2011-07-27 | 华为终端有限公司 | Storing and accessing method of flash memory data and device thereof |
| CN103970671A (en) * | 2013-02-01 | 2014-08-06 | 国际商业机器公司 | Allocating Additional Requested Storage Space For A Data Set In A First Managed Space In A Second Managed Space |
| CN104199781A (en) * | 2014-08-14 | 2014-12-10 | 深圳百科信息技术有限公司 | Memory fragment allocation method and device based on shared memory |
| CN106469123A (en) * | 2015-08-10 | 2017-03-01 | 北京忆恒创源科技有限公司 | A kind of write buffer distribution based on NVDIMM, method for releasing and its device |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6230247B1 (en) * | 1997-10-29 | 2001-05-08 | International Business Machines Corporation | Method and apparatus for adaptive storage space allocation |
| JP4080809B2 (en) * | 2002-08-01 | 2008-04-23 | 松下電器産業株式会社 | Compiler apparatus and arrangement determining method for determining arrangement of data in storage area |
| US8161168B2 (en) * | 2006-03-18 | 2012-04-17 | Metafluent, Llc | JMS provider with plug-able business logic |
| CN101674444B (en) * | 2009-10-15 | 2011-01-05 | 杭州华三通信技术有限公司 | Storage method of video data, system and encoder thereof |
| CN104090848B (en) * | 2014-07-16 | 2017-03-08 | 云南大学 | EMS memory management process and device that a kind of periodicity big data is processed |
| CN104102735A (en) * | 2014-07-28 | 2014-10-15 | 三星电子（中国）研发中心 | File system optimizing method and file system optimizing device aiming at database files |
-
2018
- 2018-09-25 CN CN201811114548.3A patent/CN110941564B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1553344A (en) * | 2003-06-04 | 2004-12-08 | 中兴通讯股份有限公司 | Method for dynamic distributing memory in multiple queue process realize |
| CN102135943A (en) * | 2011-03-23 | 2011-07-27 | 华为终端有限公司 | Storing and accessing method of flash memory data and device thereof |
| CN103970671A (en) * | 2013-02-01 | 2014-08-06 | 国际商业机器公司 | Allocating Additional Requested Storage Space For A Data Set In A First Managed Space In A Second Managed Space |
| CN104199781A (en) * | 2014-08-14 | 2014-12-10 | 深圳百科信息技术有限公司 | Memory fragment allocation method and device based on shared memory |
| CN106469123A (en) * | 2015-08-10 | 2017-03-01 | 北京忆恒创源科技有限公司 | A kind of write buffer distribution based on NVDIMM, method for releasing and its device |
Non-Patent Citations (1)
| Title |
|---|
| 基于TMS320DM642的视频图像处理技术研究;张磊;《中国优秀硕士论文电子期刊网 信息科技辑》;20100715;第I136-181页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110941564A (en) | 2020-03-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109462726B (en) | Camera control method and device | |
| CN110599148B (en) | Cluster data processing method and device, computer cluster and readable storage medium | |
| CN110691282B (en) | Video processing method and device, storage medium and electronic equipment | |
| US20150134846A1 (en) | Method and apparatus for media segment request retry control | |
| CN111093099A (en) | Streaming media service scheduling method, device and system | |
| CA2891915A1 (en) | Queue management method and apparatus | |
| CN108777810B (en) | Video data storage method, device, equipment and storage medium | |
| CN110941564B (en) | Storage space allocation method and device, electronic equipment and storage medium | |
| CN112565886A (en) | Video frame extraction method and device, electronic equipment and readable storage medium | |
| CN110891033B (en) | Network resource processing method, device, gateway, controller and storage medium | |
| CN110187957B (en) | Queuing method and device for downloading tasks and electronic equipment | |
| CN115129470A (en) | Encoding and decoding resource allocation method and device and electronic equipment | |
| CN111092922B (en) | Information sending method and device | |
| CN106790466A (en) | For the method, server and the terminal device that push | |
| CN113554458B (en) | Object pushing method and device, electronic equipment and storage medium | |
| CN112860432A (en) | Process management method, device and server | |
| CN112099956A (en) | Resource allocation method, device and equipment | |
| CN110896564B (en) | Resource allocation method and device | |
| CN113127064A (en) | Method and related device for concurrently scheduling and executing time sequence data | |
| JP2016036103A (en) | Image distribution server and image distribution method | |
| CN110764707A (en) | Data processing method and device | |
| CN109743521B (en) | Video data transmission method and device, electronic equipment and storage medium | |
| CN109284188A (en) | A kind of buffer number group maintenance method, apparatus, terminal and readable medium | |
| CN115174948B (en) | Scheduling method and device based on transcoding resources | |
| CN115514916B (en) | Image group processing method and device, communication device and storage 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 |