WO2018107887A1 - 机顶盒Flash数据存储方法、系统和电子设备 - Google Patents

机顶盒Flash数据存储方法、系统和电子设备 Download PDF

Info

Publication number
WO2018107887A1
WO2018107887A1 PCT/CN2017/106575 CN2017106575W WO2018107887A1 WO 2018107887 A1 WO2018107887 A1 WO 2018107887A1 CN 2017106575 W CN2017106575 W CN 2017106575W WO 2018107887 A1 WO2018107887 A1 WO 2018107887A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
group
data unit
size
split
Prior art date
Application number
PCT/CN2017/106575
Other languages
English (en)
French (fr)
Inventor
付双琪
池骏
Original Assignee
深圳市九洲电器有限公司
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 深圳市九洲电器有限公司 filed Critical 深圳市九洲电器有限公司
Publication of WO2018107887A1 publication Critical patent/WO2018107887A1/zh

Links

Images

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/0608—Saving storage space on storage systems
    • 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/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/432—Content retrieval operation from a local storage medium, e.g. hard-disk
    • H04N21/4325—Content retrieval operation from a local storage medium, e.g. hard-disk by playing back content from the storage medium
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/433—Content storage operation, e.g. storage operation in response to a pause request, caching operations

Definitions

  • the present application relates to the field of data storage, and in particular, to a set-top box Flash data storage method, system, and electronic device.
  • the data of each module of the set-top box needs to be stored in the flash (flash memory).
  • the existing mode is to divide the Flash space into partitions, but the memory blocks of Flash are divided into one block, and each block is fixed in size (for example, 64K or 128K, etc.); The erasure must be that the entire block is completely erased, first erased and then written. In this way, in actual use, the data to be stored by the module of the set-top box is allocated a block size even if it is less than one block size, which wastes a part of the flash space, and is inconvenient when the data size of the module changes. Adjustments and updates are not conducive to the storage of set-top box data.
  • S20 configuring, for each module of the set top box, a data unit for storing data, where the data unit size is allocated according to requirements of each module;
  • S30 Get the size of each data unit, and sort them in order from small to large, and store the sorting result in an array
  • S40 dividing the data unit into multiple groups according to the order, the sum of the data unit sizes in each group does not exceed the size of one data block, and the sum of the size of each group of data units plus the size of the next data unit exceeds one The size of the data block;
  • S50 obtaining a difference between the sum of the size of each group of data units and the size of the data block, starting from the first group, and splitting the data units in the first group into groups that can be accommodated by other differences according to the difference, After the first group is split, continue to split the second group until it cannot be split;
  • step S50 is specifically: for the splitting of the first group, according to the size of the data unit in the first group, the data unit starts to be split from large to small, and the data unit can be split into other differences. In the group with the smallest difference, in the same way, after the first group is split, continue to split the next group until it can no longer be split.
  • the method further includes: if the data unit configuration information is changed, first reading the data in the original data unit into the memory, and then performing the steps S30 to S50 to allocate the newly configured data unit to the data. In the block, after the allocation is completed, the data read from the memory is stored in the new data unit.
  • the embodiment of the present application further provides a set top box Flash data storage system, including:
  • a data block dividing module configured to divide each partition into data blocks with the same storage space
  • a data unit configuration module configured to configure, for each module of the set top box, a data unit for storing data, where the data unit size is allocated according to requirements of each module;
  • a data unit sorting module configured to acquire the size of each data unit, and sort them in order from small to large, and store the sorting result in an array
  • a data unit grouping module configured to divide the data unit into a plurality of groups according to the order, the sum of the data unit sizes in each group does not exceed the size of one data block, and the sum of the size of each group of data units plus the next data The size of the unit exceeds the size of one data block;
  • Splitting module which is used to obtain the difference between the sum of the size of each group of data units and the size of the data block, Starting from the first group, according to the difference, the data units in the first group are split into groups that other differences can accommodate. After the first group is split, the second group is continued to be split until it cannot be split. ;
  • An allocation module for assigning each group after the final split to one data block.
  • the splitting module splits the first group according to the size of the data unit in the first group, and starts to split the data unit from large to small, and splits the data unit into other differences and can accommodate In the group with the smallest difference, after the first group is split in the same way, continue to split the next group until it can no longer be split.
  • system further includes: an update module, configured to: after the data unit configuration information is changed, first read the data in the original data unit into the memory, and then the data unit sorting module, the data unit grouping module, and the The sub-module performs its function separately, and allocates the newly configured data unit to the data block. After the allocation is completed, the data read from the memory is stored in the new data unit.
  • update module configured to: after the data unit configuration information is changed, first read the data in the original data unit into the memory, and then the data unit sorting module, the data unit grouping module, and the The sub-module performs its function separately, and allocates the newly configured data unit to the data block. After the allocation is completed, the data read from the memory is stored in the new data unit.
  • At least one processor and,
  • the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method as described above.
  • a non-transitory computer readable storage medium is provided by an embodiment of the present application, the computer readable storage medium storing computer executable instructions for causing a computer to perform the method as described above.
  • a computer program product provided by an embodiment of the present application, the computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, when the program instruction is executed by a computer
  • the computer is caused to perform the method as described above.
  • the method, system and electronic device of the set top box Flash data of the embodiment of the present application first divide the partition into one data block, and after configuring the data unit, sorting and grouping the data units according to the size of the data unit and the size of the data block, After the data unit is split and reorganized, the number of packets is reduced, thereby reducing the number of data blocks and reducing the occupation of Flash space. Use Flash space to avoid wasting Flash space.
  • FIG. 1 is a flow chart of a method for storing data of a set top box in an embodiment
  • FIG. 2 is a schematic diagram of grouping of data units in an embodiment
  • FIG. 3 is a schematic diagram of data unit group splitting in an embodiment
  • FIG. 4 is a structural diagram of a set top box Flash data storage system in an embodiment
  • FIG. 5 is a schematic diagram showing the hardware structure of an electronic device in an embodiment.
  • FIG. 1 is a flow chart of a method for storing data of a set top box in an embodiment. As shown in FIG. 1, the method includes the following steps:
  • each partition of the set-top box Flash space is further divided, and each partition is further divided into one set.
  • a data unit for storing data is configured for each module of the set top box, and the data unit size is allocated according to the requirements of each module.
  • each module of the set-top box stores data in the Flash
  • the size of the flash space that can be used by each module is the size of the data unit.
  • the size of the data unit is allocated according to the requirements of each module, and once it is allocated, the size cannot be changed.
  • S30 Get the size of each data unit and sort them in order of small to large, and store the sort result in an array.
  • each data unit After configuring the data unit for each module, it is next determined which data block each data unit is to be configured in.
  • the size of each data unit allocation is first obtained, and then all data units are sorted in order from small to large to obtain a sort result. For example, suppose there are 11 modules, and 11 data units are allocated, which are 3K, 2K, 3K, 4K, 6K, 4K, 5K, 7K, 6K, 7K, and 8K, and 2K, 3K, and 3K after sorting. 4K, 4K, 5K, 6K, 6K, 7K, 7K and 8K.
  • the data units are divided and grouped according to the sorting order.
  • the specific grouping rule is that the sum of the data unit sizes in each group does not exceed the size of one data block, and the size of each group of data units The sum plus the size of its next data unit exceeds the size of one block.
  • the size of the set data block is 10K, and according to the grouping rule, it is divided into 2K, 3K, 3K; 4K, 4K; 5K; 6K; 6K; 7K; 7K; Dividing into 8 groups requires 8 data blocks.
  • S50 obtaining a difference between the sum of the size of each group of data units and the size of the data block, starting from the first group, and splitting the data units in the first group into groups that can be accommodated by other differences according to the difference, After the first group is split, continue to split the second group until it cannot be split.
  • the difference between the sum of the size of each group of data units and the size of the data block is first obtained, and since the size of the data unit in the first group is the smallest, Starting from the first group, the data units of the first group are split into other groups according to the difference. After the first group is split, the second group is split until it cannot be split, so that other groups are grouped.
  • the unused space is utilized, reducing the number of blocks by reducing the number of blocks, thereby reducing the use of Flash space.
  • the step is specifically: for the splitting of the first group, according to the size of the data unit in the first group, the data unit starts to be split from large to small, and the data unit is Split into other groups that can accommodate and have the smallest difference.
  • the first group is split, continue to split the next group until it can no longer be split. For example, split as in Figure 3.
  • the data block is reduced from the original 8 to only 6, thereby reducing the occupation of Flash.
  • each group is allocated to one data block, so that the data unit of each module is allocated in the data block according to the method of occupying the least space, thereby fully utilizing the Flash. Space, reducing the occupation and waste of Flash space.
  • the method further includes: if the data unit configuration information is changed, first reading the data in the original data unit into the memory, and then performing steps S30 to S50 to allocate the newly configured data unit to the data block, and allocating After reading, the data read from the memory is stored in the new data unit. This completes the update of the data unit and data.
  • the set-top box Flash data storage method first divides the partition into one data block. After configuring the data unit, the data unit is sorted and grouped according to the size of the data unit and the size of the data block, and the grouped data unit is further split. Reorganization, reducing the number of packets, thereby reducing the number of data blocks, reducing the use of Flash space, making full use of the Flash space, avoiding the waste of Flash space.
  • the embodiment of the present application further provides a set top box Flash data storage system, as shown in FIG. 4, the system 10 is as follows:
  • the data block dividing module 100 is configured to divide each partition into pieces of data having the same storage space.
  • the flash space of the set-top box is utilized reasonably.
  • the data block dividing module 100 divides each partition of the set-top box Flash space and further divides each partition. Set data blocks for storage space one by one, and use data blocks to store data.
  • the data unit configuration module 200 is configured to configure a data unit for storing data for each module of the set top box, and the data unit size is allocated according to the requirements of each module.
  • the data unit configuration module 200 needs to configure a data unit for storing data for each module in advance, that is, how much Flash space needs to be allocated for each module in advance, which is data. unit.
  • the size of the flash space that can be used by each module is the size of the data unit. Among them, the size of the data unit is allocated according to the requirements of each module, and once it is allocated, the size cannot be changed.
  • the data unit sorting module 300 is configured to acquire the size of each data unit and sort them in order from small to large, and store the sorting result in an array.
  • the data unit sorting module 300 first acquires the size of each data unit allocation, and then sorts all the data units in order from small to large to obtain a sorting result. For example, suppose there are 11 modules, and 11 data units are allocated, which are 3K, 2K, 3K, 4K, 6K, 4K, 5K, 7K, 6K, 7K, and 8K, and 2K, 3K, and 3K after sorting. 4K, 4K, 5K, 6K, 6K, 7K, 7K and 8K.
  • the data unit grouping module 400 is configured to divide the data unit into a plurality of groups according to the order, the sum of the data unit sizes in each group does not exceed the size of one data block, and the sum of the size of each group of data units is added to the next one.
  • the size of the data unit exceeds the size of one data block.
  • the data units are divided and grouped according to the sorting order.
  • the specific grouping rule is that the sum of the data unit sizes in each group does not exceed the size of one data block, and the size of each group of data units The sum plus the size of its next data unit exceeds one data block the size of.
  • the size of the set data block is 10K, and according to the grouping rule, it is divided into 2K, 3K, 3K; 4K, 4K; 5K; 6K; 6K; 7K; 7K; Dividing into 8 groups requires 8 data blocks.
  • the splitting module 500 is configured to obtain a difference between the sum of the size of each group of data units and the size of the data block, starting from the first group, and splitting the data units in the first group into other differences according to the difference In the group that is accommodated, after the first group is split, continue to split the second group until it cannot be split.
  • the splitting module 500 first obtains the difference between the sum of the size of each group of data units and the size of the data block, due to the data unit in the first group.
  • the size is the smallest, so the first group starts.
  • the data unit of the first group is split into other groups.
  • the second group is split until it cannot be split.
  • the split module 500 splits the first group, according to the size of the data unit in the first group, starts to split the data unit from large to small, and splits the data unit.
  • the next group is continued to be split until it can no longer be split. For example, split as in Figure 3. After the splitting is completed, the data block is reduced from the original 8 to only 6, thereby reducing the occupation of Flash.
  • the distribution module 600 is configured to allocate each group after the final split into one data block.
  • the allocation module 600 allocates each packet to a data block, so that the data units of each module are allocated in the data block according to the method of occupying the least space, thereby Make full use of the Flash space, reducing the occupation and waste of Flash space.
  • system further includes: an update module, configured to: after the data unit configuration information is changed, first read data in the original data unit into the memory, and then the data unit sorting module 300, The data unit grouping module 400 and the splitting module 500 process, and allocate the newly configured data unit to the data block, and store the read data in the memory into the new data unit after the allocation. This completes the update of the data unit and data.
  • update module configured to: after the data unit configuration information is changed, first read data in the original data unit into the memory, and then the data unit sorting module 300, The data unit grouping module 400 and the splitting module 500 process, and allocate the newly configured data unit to the data block, and store the read data in the memory into the new data unit after the allocation. This completes the update of the data unit and data.
  • the set-top box Flash data storage system the data block dividing module 100 first divides the partition into one data block, and after the data unit configuration module 200 configures the data unit, according to the size of the data unit and the size of the data block, the data unit sorting module 300 and the data
  • the unit grouping module 400 sorts the data units, and the splitting module 500 splits and reassembles the grouped data units to reduce the number of groups, thereby reducing the number of data blocks, reducing the occupation of the flash space, and fully utilizing the flash space. To avoid the waste of Flash space.
  • the method and system for storing the data in the set-top box of the present application first divide the partition into one data block. After configuring the data unit, the data unit is sorted and grouped according to the size of the data unit and the size of the data block, and the data after the grouping is performed. The unit then splits and reorganizes, reducing the number of packets, thereby reducing the number of data blocks, reducing the occupation of Flash space, making full use of the Flash space, and avoiding the waste of Flash space.
  • FIG. 5 is a schematic diagram of the hardware structure of the electronic device 20 in an embodiment. As shown in FIG. 5, the electronic device 20 includes:
  • One or more processors 21 and a memory 22 are exemplified by a processor 21 in FIG.
  • the processor 21 and the memory 22 can be connected by a bus or other means, as exemplified by a bus connection in FIG.
  • the memory 22 is a non-volatile computer readable storage medium, and can be used for storing non-volatile software programs, non-volatile computer-executable programs, and modules, such as the set-top box Flash data storage method in the embodiment of the present application.
  • Program instructions/modules eg, the modules shown in Figure 4
  • the processor 21 executes various functional applications and data processing of the electronic device by executing non-volatile software programs, instructions, and modules stored in the memory 22, that is, implementing the set-top box Flash data storage method of the above method embodiment.
  • the memory 22 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may be stored according to the set top box Unlock the data created by the use of the boot system, etc. Further, the memory 22 may include a high speed random access memory, and may also include a nonvolatile memory such as at least one magnetic disk storage device, flash memory device, or other nonvolatile solid state storage device. In some embodiments, memory 22 may optionally include memory remotely located relative to processor 21, which may be connected to the set top box Flash data storage system via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • the one or more modules are stored in the memory 22, and when executed by the one or more processors 21, execute the set top box Flash data storage method in any of the above method embodiments, for example, to perform the above described diagram
  • the electronic device of the embodiments of the present application exists in various forms, such as a set top box.
  • the embodiment of the present application provides a non-transitory computer readable storage medium storing computer-executable instructions that are executed by one or more processors, such as in FIG. a processor 21, which may cause the one or more processors to execute the set top box Flash data storage method in any of the above method embodiments, for example, to perform the method steps in FIG. 1 described above and the functions of the module in FIG. .
  • the embodiment of the present application provides a computer program product, the computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions, when the program instructions are executed by a computer
  • the computer is caused to execute the set top box Flash data storage method in any of the above method embodiments, for example, to perform the method steps of FIG. 1 described above and the functions of the modules of FIG.
  • the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to implement the embodiment. The purpose of the program.
  • the storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

Abstract

本申请涉及一种机顶盒Flash数据存储方法、系统和电子设备，首先将分区划分为一个个数据块，配置数据单元后，根据数据单元的大小和数据块的大小，对数据单元进行排序分组，对分组后的数据单元再进行拆分重组，减少分组的数量，从而减少数据块的数量，减少对Flash空间的占用，充分利用Flash空间，避免了Flash空间的浪费。

Description

机顶盒Flash数据存储方法、系统和电子设备 【技术领域】
本申请涉及数据存储领域，尤其涉及一种机顶盒Flash数据存储方法、系统和电子设备。
【背景技术】
目前，在机顶盒功能开发过程中，需要将机顶盒各个模块的数据存储在Flash(闪存)中。
现有模式是将Flash空间分为一个个的partition(分区)，但是由于Flash的存储块分成一个一个的block，且每个block大小固定(例如为64K或者128K等)；同时具有特性，即擦除时必须是整个block全部擦除，先擦除后写入。这样，在实际使用过程中，机顶盒的模块要存储的数据即使少于一个block大小，也要分配一个block的大小，这就会浪费一部分Flash空间，同时当该模块数据大小变化时，也不方便调整和更新，这都不利于机顶盒数据的存储。
【申请内容】
有鉴于此，有必要针对上述机顶盒的模块数据存储浪费Flash空间、不方便调整和更新的问题提供一种机顶盒Flash数据存储方法、系统和电子设备。
本申请实施例提供的一种机顶盒Flash数据存储方法，包括如下步骤：
S10：将每个分区划分成一个个存储空间相同的数据块；
S20：为机顶盒的每个模块配置用于存储数据的数据单元，所述数据单元大小根据每个模块的需求进行分配；
S30：获取每个数据单元的大小，并按照由小到大的顺序进行排序，将排序结果存储在数组中；
S40：按照排序将数据单元划分成多个组，每个组中数据单元大小的总和不超过一个数据块的大小，且每个组数据单元大小的总和加上其下一个数据单元的大小超过一个数据块的大小；
S50：获取每个组数据单元大小的总和与数据块大小的差值，由第一个组开始，根据差值，将第一组中的数据单元拆分到其他差值能够容纳的组中，第一组拆分完毕后继续拆分第二组，直至不能拆分为止；
S60：将最终拆分后的每组分别分配到一个数据块中。
进一步的，所述步骤S50具体为：对于第一组的拆分，按照第一组中数据单元的大小，由大到小的对数据单元开始拆分，将数据单元拆分到其他差值能够容纳且差值最小的分组中，采用同样的方式在第一组拆分完毕后，继续拆分下一组，直至不再能拆分。
进一步的，所述方法还包括：若数据单元配置信息更改后，则先将原数据单元中的数据读取到内存中，然后执行所述步骤S30至S50，将新配置的数据单元分配到数据块中，分配完毕后由内存中读取数据存储到新的数据单元中。
本申请实施例还提供一种机顶盒Flash数据存储系统，包括：
数据块划分模块，用于将每个分区划分成一个个存储空间相同的数据块；
数据单元配置模块，用于为机顶盒的每个模块配置用于存储数据的数据单元，所述数据单元大小根据每个模块的需求进行分配；
数据单元排序模块，用于获取每个数据单元的大小，并按照由小到大的顺序进行排序，将排序结果存储在数组中；
数据单元分组模块，用于按照排序将数据单元划分成多个组，每个组中数据单元大小的总和不超过一个数据块的大小，且每个组数据单元大小的总和加上其下一个数据单元的大小超过一个数据块的大小；
拆分模块，用于获取每个组数据单元大小的总和与数据块大小的差值， 由第一个组开始，根据差值，将第一组中的数据单元拆分到其他差值能够容纳的组中，第一组拆分完毕后继续拆分第二组，直至不能拆分为止；
分配模块，用于将最终拆分后的每组分别分配到一个数据块中。
进一步的，所述拆分模块对于第一组的拆分，按照第一组中数据单元的大小，由大到小的对数据单元开始拆分，将数据单元拆分到其他差值能够容纳且差值最小的分组中，采用同样的方式在第一组拆分完毕后，继续拆分下一组，直至不再能拆分。
进一步的，所述系统还包括：更新模块，用于若数据单元配置信息更改后，则先将原数据单元中的数据读取到内存中，然后由数据单元排序模块、数据单元分组模块、拆分模块分别执行其功能，将新配置的数据单元分配到数据块中，分配完毕后由内存中读取数据存储到新的数据单元中。
本申请实施例提供的一种电子设备，包括：
至少一个处理器；以及，
与所述至少一个处理器通信连接的存储器；其中，
所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行如上所述的方法。
本申请实施例提供的一种非易失性计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行指令，所述计算机可执行指令用于使计算机执行如上所述的方法。
本申请实施例提供的一种计算机程序产品，所述计算机程序产品包括存储在非易失性计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被计算机执行时，使所述计算机执行如上所述的方法。
本申请实施例机顶盒Flash数据存储方法、系统和电子设备，首先将分区划分为一个个数据块，配置数据单元后，根据数据单元的大小和数据块的大小，对数据单元进行排序分组，对分组后的数据单元再进行拆分重组，减少分组的数量，从而减少数据块的数量，减少对Flash空间的占用，充分利 用Flash空间，避免了Flash空间的浪费。
【附图说明】
一个或多个实施例通过与之对应的附图中的图片进行示例性说明，这些示例性说明并不构成对实施例的限定，附图中具有相同参考数字标号的元件表示为类似的元件，除非有特别申明，附图中的图不构成比例限制。
图1是一个实施例中的机顶盒Flash数据存储方法的流程图；
图2是一个实施例中的数据单元分组示意图；
图3是一个实施例中的数据单元分组拆分示意图；
图4是一个实施例中的机顶盒Flash数据存储系统的结构图；
图5是一个实施例中的电子设备的硬件结构示意图。
【具体实施方式】
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
图1是一个实施例中的机顶盒Flash数据存储方法的流程图，如图1所示，该方法包括如下步骤：
S10：将每个分区(partition)划分成一个个存储空间相同的数据块(segment)。
为方便机顶盒各个模块进行数据存储和节省机顶盒的Flash空间，合理利用机顶盒的Flash空间，该实施例中，将机顶盒Flash空间的每个分区再进行划分，将每个分区进一步划分为一个个设定存储空间的数据块，利用数据块来存储数据。
S20：为机顶盒的每个模块配置用于存储数据的数据单元(datacell)，数据单元大小根据每个模块的需求进行分配。
机顶盒的各个模块在Flash中存储数据时，需要预先为每个模块配置用于存储数据的数据单元，即要预先配置好每个模块需要分配多大的Flash空间，这即是数据单元。为各个模块配置了数据单元后，每个模块可使用的Flash空间大小即为数据单元的大小。其中，数据单元大小则根据每个模块的需求进行分配，一旦分配之后则大小固定不能更改。
S30：获取每个数据单元的大小，并按照由小到大的顺序进行排序，将排序结果存储在数组中。
在为每个模块配置了数据单元之后，接下来要确定每个数据单元要配置在哪个数据块中。该实施例中，首先获取每个数据单元分配的大小，然后按照由小到大的顺序将所有数据单元进行排序，得到排序结果。例如，假设有11个模块，则分配有11个数据单元，大小分别为3K、2K、3K、4K、6K、4K、5K、7K、6K、7K和8K，则排序之后为2K、3K、3K、4K、4K、5K、6K、6K、7K、7K和8K。
S40：按照排序将数据单元划分成多个组，每个组中数据单元大小的总和不超过一个数据块的大小，且每个组数据单元大小的总和加上其下一个数据单元的大小超过一个数据块的大小。
在将所有的数据单元排序之后，按照排序顺序对数据单元进行分割分组，具体的分组规则为，每个组中数据单元大小的总和不超过一个数据块的大小，且每个组数据单元大小的总和加上其下一个数据单元的大小超过一个数据块的大小。例如，如图2所示，设定数据块的大小为10K，则根据分组规则，则分成2K、3K、3K；4K、4K；5K；6K；6K；7K；7K；8K共8个组，分为8个组即需要8个数据块。
S50：获取每个组数据单元大小的总和与数据块大小的差值，由第一个组开始，根据差值，将第一组中的数据单元拆分到其他差值能够容纳的组中，第一组拆分完毕后继续拆分第二组，直至不能拆分为止。
在按照排序将数据单元划分成多个组后，由于每个组中数据单元大小的总和都小余数据块的大小，与数据块大小还存在一定的差值，数据块没有充 分被利用，这就会造成存储空间的浪费，故在该实施例中，首先获取每个组数据单元大小的总和与数据块大小的差值，由于第一组中数据单元的大小最小，故由第一个组开始，根据差值先将第一个组的数据单元拆分到其他分组中，第一组拆分之后再拆分第二组，直至不能拆分为止，这样就将其他分组中没有被利用的空间利用起来，减少分组即减少数据块的数量，从而减少Flash空间的占用。
为进一步的减少分组和数据块占用的数量，该步骤具体为：对于第一组的拆分，按照第一组中数据单元的大小，由大到小的对数据单元开始拆分，将数据单元拆分到其他差值能够容纳且差值最小的分组中，采用同样的方式在第一组拆分完毕后，继续拆分下一组，直至不再能拆分。例如，如图3一样的拆分。拆分完毕后，数据块由原来的8个降低到只需要6个，从而减少对Flash的占用。
S60：将最终拆分后的每组分别分配到一个数据块中。
在拆分完毕后，得到最终的分组，每个分组分别分配到一个数据块中，这样就将每个模块的数据单元根据占用最少空间的方式，在数据块中进行分配，从而充分利用了Flash空间，降低了对Flash空间的占用和浪费。
此外，该方法还包括：若数据单元配置信息更改后，则先将原数据单元中的数据读取到内存中，然后执行步骤S30至S50，将新配置的数据单元分配到数据块中，分配完毕后由内存中读取数据存储到新的数据单元中。这样就完成数据单元和数据的更新。
该机顶盒Flash数据存储方法，首先将分区划分为一个个数据块，配置数据单元后，根据数据单元的大小和数据块的大小，对数据单元进行排序分组，对分组后的数据单元再进行拆分重组，减少分组的数量，从而减少数据块的数量，减少对Flash空间的占用，充分利用Flash空间，避免了Flash空间的浪费。
同时，本申请实施例还提供一种机顶盒Flash数据存储系统，如图4所示，该系统10如下：
数据块划分模块100，用于将每个分区(partition)划分成一个个存储空间相同的数据块(segment)。
为方便机顶盒各个模块进行数据存储和节省机顶盒的Flash空间，合理利用机顶盒的Flash空间，该实施例中，数据块划分模块100将机顶盒Flash空间的每个分区再进行划分，将每个分区进一步划分为一个个设定存储空间的数据块，利用数据块来存储数据。
数据单元配置模块200，用于为机顶盒的每个模块配置用于存储数据的数据单元(datacell)，数据单元大小根据每个模块的需求进行分配。
机顶盒的各个模块在Flash中存储数据时，数据单元配置模块200需要预先为每个模块配置用于存储数据的数据单元，即要预先配置好每个模块需要分配多大的Flash空间，这即是数据单元。为各个模块配置了数据单元后，每个模块可使用的Flash空间大小即为数据单元的大小。其中，数据单元大小则根据每个模块的需求进行分配，一旦分配之后则大小固定不能更改。
数据单元排序模块300，用于获取每个数据单元的大小，并按照由小到大的顺序进行排序，将排序结果存储在数组中。
在为每个模块配置了数据单元之后，接下来要确定每个数据单元要配置在哪个数据块中。该实施例中，数据单元排序模块300首先获取每个数据单元分配的大小，然后按照由小到大的顺序将所有数据单元进行排序，得到排序结果。例如，假设有11个模块，则分配有11个数据单元，大小分别为3K、2K、3K、4K、6K、4K、5K、7K、6K、7K和8K，则排序之后为2K、3K、3K、4K、4K、5K、6K、6K、7K、7K和8K。
数据单元分组模块400，用于按照排序将数据单元划分成多个组，每个组中数据单元大小的总和不超过一个数据块的大小，且每个组数据单元大小的总和加上其下一个数据单元的大小超过一个数据块的大小。
在将所有的数据单元排序之后，按照排序顺序对数据单元进行分割分组，具体的分组规则为，每个组中数据单元大小的总和不超过一个数据块的大小，且每个组数据单元大小的总和加上其下一个数据单元的大小超过一个数据块 的大小。例如，如图2所示，设定数据块的大小为10K，则根据分组规则，则分成2K、3K、3K；4K、4K；5K；6K；6K；7K；7K；8K共8个组，分为8个组即需要8个数据块。
拆分模块500，用于获取每个组数据单元大小的总和与数据块大小的差值，由第一个组开始，根据差值，将第一组中的数据单元拆分到其他差值能够容纳的组中，第一组拆分完毕后继续拆分第二组，直至不能拆分为止。
在数据单元分组模块400按照排序将数据单元划分成多个组后，由于每个组中数据单元大小的总和都小余数据块的大小，与数据块大小还存在一定的差值，数据块没有充分被利用，这就会造成存储空间的浪费，故在该实施例中，拆分模块500首先获取每个组数据单元大小的总和与数据块大小的差值，由于第一组中数据单元的大小最小，故由第一个组开始，根据差值先将第一个组的数据单元拆分到其他分组中，第一组拆分之后再拆分第二组，直至不能拆分为止，这样就将其他分组中没有被利用的空间利用起来，减少分组即减少数据块的数量，从而减少Flash空间的占用。
为进一步的减少分组和数据块占用的数量，拆分模块500对于第一组的拆分，按照第一组中数据单元的大小，由大到小的对数据单元开始拆分，将数据单元拆分到其他差值能够容纳且差值最小的分组中，采用同样的方式在第一组拆分完毕后，继续拆分下一组，直至不再能拆分。例如，如图3一样的拆分。拆分完毕后，数据块由原来的8个降低到只需要6个，从而减少对Flash的占用。
分配模块600，用于将最终拆分后的每组分别分配到一个数据块中。
在拆分完毕后，得到最终的分组，分配模块600将每个分组分别分配到一个数据块中，这样就将每个模块的数据单元根据占用最少空间的方式，在数据块中进行分配，从而充分利用了Flash空间，降低了对Flash空间的占用和浪费。
此外，该系统还包括：更新模块，其用于若数据单元配置信息更改后，则先将原数据单元中的数据读取到内存中，然后由数据单元排序模块300、 数据单元分组模块400和拆分模块500处理，将新配置的数据单元分配到数据块中，分配完毕后由内存中读取数据存储到新的数据单元中。这样就完成数据单元和数据的更新。
该机顶盒Flash数据存储系统，数据块划分模块100首先将分区划分为一个个数据块，数据单元配置模块200配置数据单元后，根据数据单元的大小和数据块的大小，数据单元排序模块300和数据单元分组模块400对数据单元进行排序分组，拆分模块500对分组后的数据单元再进行拆分重组，减少分组的数量，从而减少数据块的数量，减少对Flash空间的占用，充分利用Flash空间，避免了Flash空间的浪费。
本申请实施例机顶盒Flash数据存储方法及系统，首先将分区划分为一个个数据块，配置数据单元后，根据数据单元的大小和数据块的大小，对数据单元进行排序分组，对分组后的数据单元再进行拆分重组，减少分组的数量，从而减少数据块的数量，减少对Flash空间的占用，充分利用Flash空间，避免了Flash空间的浪费。
图5是一个实施例中的电子设备20的硬件结构示意图，如图5所示，该电子设备20包括：
一个或多个处理器21以及存储器22，图5中以一个处理器21为例。
处理器21和存储器22可以通过总线或者其他方式连接，图5中以通过总线连接为例。
存储器22作为一种非易失性计算机可读存储介质，可用于存储非易失性软件程序、非易失性计算机可执行程序以及模块，如本申请实施例中的机顶盒Flash数据存储方法对应的程序指令/模块(例如，附图4所示的模块)。处理器21通过运行存储在存储器22中的非易失性软件程序、指令以及模块，从而执行电子设备的各种功能应用以及数据处理，即实现上述方法实施例机顶盒Flash数据存储方法。
存储器22可以包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需要的应用程序；存储数据区可存储根据机顶盒 解锁开机系统的使用所创建的数据等。此外，存储器22可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实施例中，存储器22可选包括相对于处理器21远程设置的存储器，这些远程存储器可以通过网络连接至机顶盒Flash数据存储系统。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
所述一个或者多个模块存储在所述存储器22中，当被所述一个或者多个处理器21执行时，执行上述任意方法实施例中的机顶盒Flash数据存储方法，例如，执行以上描述的图1中的方法步骤和图4中的模块的功能。
上述产品可执行本申请实施例所提供的方法，具备执行方法相应的功能模块和有益效果。未在本实施例中详尽描述的技术细节，可参见本申请实施例所提供的方法。
本申请实施例的电子设备以多种形式存在，例如机顶盒。
本申请实施例提供了一种非易失性计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行指令，该计算机可执行指令被一个或多个处理器执行，例如图5中的一个处理器21，可使得上述一个或多个处理器可执行上述任意方法实施例中的机顶盒Flash数据存储方法，例如，执行以上描述的图1中的方法步骤和图4中的模块的功能。
本申请实施例提供了一种计算机程序产品，所述计算机程序产品包括存储在非易失性计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被计算机执行时，使所述计算机执行上述任意方法实施例中的机顶盒Flash数据存储方法，例如，执行以上描述的图1中的方法步骤和图4中的模块的功能。
以上所描述的装置实施例仅仅是示意性的，其中所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例 方案的目的。
通过以上的实施方式的描述，本领域普通技术人员可以清楚地了解到各实施方式可借助软件加通用硬件平台的方式来实现，当然也可以通过硬件。本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程是可以通过计算机程序来指令相关的硬件来完成，所述的程序可存储于一计算机可读取存储介质中，该程序在执行时，可包括如上述各方法的实施例的流程。其中，所述的存储介质可为磁碟、光盘、只读存储记忆体(Read-Only Memory,ROM)或随机存储记忆体(Random Access Memory,RAM)等。
最后应说明的是：以上实施例仅用以说明本申请的技术方案，而非对其限制；在本申请的思路下，以上实施例或者不同实施例中的技术特征之间也可以进行组合，步骤可以以任意顺序实现，并存在如上所述的本申请的不同方面的许多其它变化，为了简明，它们没有在细节中提供；尽管参照前述实施例对本申请进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本申请各实施例技术方案的范围。
以上仅为本申请的较佳实施例而已，并不用以限制本申请，凡在本申请的精神和原则之内所作的任何修改、等同替换和改进等，均应包含在本申请的保护范围之内。

Claims (9)

  1. 一种机顶盒Flash数据存储方法，其特征在于，包括如下步骤：
    S10：将每个分区划分成一个个存储空间相同的数据块；
    S20：为机顶盒的每个模块配置用于存储数据的数据单元，所述数据单元大小根据每个模块的需求进行分配；
    S30：获取每个数据单元的大小，并按照由小到大的顺序进行排序，将排序结果存储在数组中；
    S40：按照排序将数据单元划分成多个组，每个组中数据单元大小的总和不超过一个数据块的大小，且每个组数据单元大小的总和加上其下一个数据单元的大小超过一个数据块的大小；
    S50：获取每个组数据单元大小的总和与数据块大小的差值，由第一个组开始，根据差值，将第一组中的数据单元拆分到其他差值能够容纳的组中，第一组拆分完毕后继续拆分第二组，直至不能拆分为止；
    S60：将最终拆分后的每组分别分配到一个数据块中。
  2. 根据权利要求1所述的机顶盒Flash数据存储方法，其特征在于，所述步骤S50具体为：对于第一组的拆分，按照第一组中数据单元的大小，由大到小的对数据单元开始拆分，将数据单元拆分到其他差值能够容纳且差值最小的分组中，采用同样的方式在第一组拆分完毕后，继续拆分下一组，直至不再能拆分。
  3. 根据权利要求1所述的机顶盒Flash数据存储方法，其特征在于，所述方法还包括：若数据单元配置信息更改后，则先将原数据单元中的数据读取到内存中，然后执行所述步骤S30至S50，将新配置的数据单元分配到数据块中，分配完毕后由内存中读取数据存储到新的数据单元中。
  4. 一种机顶盒Flash数据存储系统，其特征在于，包括：
    数据块划分模块，用于将每个分区划分成一个个存储空间相同的数据块；
    数据单元配置模块，用于为机顶盒的每个模块配置用于存储数据的数据 单元，所述数据单元大小根据每个模块的需求进行分配；
    数据单元排序模块，用于获取每个数据单元的大小，并按照由小到大的顺序进行排序，将排序结果存储在数组中；
    数据单元分组模块，用于按照排序将数据单元划分成多个组，每个组中数据单元大小的总和不超过一个数据块的大小，且每个组数据单元大小的总和加上其下一个数据单元的大小超过一个数据块的大小；
    拆分模块，用于获取每个组数据单元大小的总和与数据块大小的差值，由第一个组开始，根据差值，将第一组中的数据单元拆分到其他差值能够容纳的组中，第一组拆分完毕后继续拆分第二组，直至不能拆分为止；
    分配模块，用于将最终拆分后的每组分别分配到一个数据块中。
  5. 根据权利要求4所述的机顶盒Flash数据存储系统，其特征在于，所述拆分模块对于第一组的拆分，按照第一组中数据单元的大小，由大到小的对数据单元开始拆分，将数据单元拆分到其他差值能够容纳且差值最小的分组中，采用同样的方式在第一组拆分完毕后，继续拆分下一组，直至不再能拆分。
  6. 根据权利要求4所述的机顶盒Flash数据存储系统，其特征在于，所述系统还包括：更新模块，用于若数据单元配置信息更改后，则先将原数据单元中的数据读取到内存中，然后由数据单元排序模块、数据单元分组模块、拆分模块分别执行其功能，将新配置的数据单元分配到数据块中，分配完毕后由内存中读取数据存储到新的数据单元中。
  7. 一种电子设备，其特征在于，包括：
    至少一个处理器；以及，
    与所述至少一个处理器通信连接的存储器；其中，
    所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行权利要求1-3任一项所述的方法。
  8. 一种非易失性计算机可读存储介质，其特征在于，所述计算机可读存 储介质存储有计算机可执行指令，所述计算机可执行指令用于使计算机执行权利要求1-3任一项所述的方法。
  9. 一种计算机程序产品，其特征在于，所述计算机程序产品包括存储在非易失性计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被计算机执行时，使所述计算机执行权利要求1-3任一项所述的方法。
PCT/CN2017/106575 2016-12-16 2017-10-17 机顶盒Flash数据存储方法、系统和电子设备 WO2018107887A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201611169411.9 2016-12-16
CN201611169411.9A CN106604111A (zh) 2016-12-16 2016-12-16 机顶盒Flash数据存储方法及系统

Publications (1)

Publication Number Publication Date
WO2018107887A1 true WO2018107887A1 (zh) 2018-06-21

Family

ID=58600815

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/106575 WO2018107887A1 (zh) 2016-12-16 2017-10-17 机顶盒Flash数据存储方法、系统和电子设备

Country Status (2)

Country Link
CN (1) CN106604111A (zh)
WO (1) WO2018107887A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106604111A (zh) * 2016-12-16 2017-04-26 深圳市九洲电器有限公司 机顶盒Flash数据存储方法及系统
CN107566904B (zh) * 2017-08-31 2020-12-29 海信电子科技（深圳）有限公司 一种资源数据更新方法及机顶盒设备
CN110069219B (zh) * 2019-04-23 2022-08-09 深信服科技股份有限公司 一种数据存储方法、系统及电子设备和存储介质
CN113111014B (zh) * 2021-04-07 2023-01-06 山东英信计算机技术有限公司 缓存中非热点数据的清理方法、装置、设备及存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101286136A (zh) * 2008-04-24 2008-10-15 北京中星微电子有限公司 在电可擦写可编程只读存储器中存储数据的方法及装置
TW201243591A (en) * 2011-04-22 2012-11-01 Silicon Motion Inc Data selection method for flash memory and data storage device
CN103440205A (zh) * 2013-08-21 2013-12-11 深圳市九洲电器有限公司 一种机顶盒数据存储方法及装置
CN103699492A (zh) * 2012-09-27 2014-04-02 擎泰科技股份有限公司 非易失性存储器的数据收集方法
CN105589811A (zh) * 2014-11-10 2016-05-18 慧荣科技股份有限公司 数据储存装置与操作方法
CN106604111A (zh) * 2016-12-16 2017-04-26 深圳市九洲电器有限公司 机顶盒Flash数据存储方法及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7610383B2 (en) * 2006-08-11 2009-10-27 Hewlett-Packard Development Company, L.P. Data-object-related-request routing in a dynamic, distributed data-storage system
GB2517688A (en) * 2013-08-26 2015-03-04 Ibm Storage system and method for data object storage managing in a storage system
CN103500224B (zh) * 2013-10-18 2016-03-16 税友软件集团股份有限公司 一种数据写入方法及装置、数据读取方法及装置
CN105630413B (zh) * 2015-12-23 2018-09-28 中国科学院深圳先进技术研究院 一种磁盘数据的同步回写方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101286136A (zh) * 2008-04-24 2008-10-15 北京中星微电子有限公司 在电可擦写可编程只读存储器中存储数据的方法及装置
TW201243591A (en) * 2011-04-22 2012-11-01 Silicon Motion Inc Data selection method for flash memory and data storage device
CN103699492A (zh) * 2012-09-27 2014-04-02 擎泰科技股份有限公司 非易失性存储器的数据收集方法
CN103440205A (zh) * 2013-08-21 2013-12-11 深圳市九洲电器有限公司 一种机顶盒数据存储方法及装置
CN105589811A (zh) * 2014-11-10 2016-05-18 慧荣科技股份有限公司 数据储存装置与操作方法
CN106604111A (zh) * 2016-12-16 2017-04-26 深圳市九洲电器有限公司 机顶盒Flash数据存储方法及系统

Also Published As

Publication number Publication date
CN106604111A (zh) 2017-04-26

Similar Documents

Publication Publication Date Title
WO2018107887A1 (zh) 机顶盒Flash数据存储方法、系统和电子设备
US10331468B2 (en) Techniques for routing service chain flow packets between virtual machines
US10884637B2 (en) Workload based storage optimization
CN111052149A (zh) 用于确定网络中的内存需求的方法和装置
CN105843819B (zh) 一种数据导出方法及装置
van Kempen et al. MEC-ConPaaS: An experimental single-board based mobile edge cloud
WO2017050064A1 (zh) 共享内存数据库的内存管理方法及装置
WO2023160033A1 (zh) 虚拟网卡资源的配置方法、装置、计算机设备及介质
CN111105006A (zh) 一种深度学习网络训练系统及方法
US20160012083A1 (en) Index updates using parallel and hybrid execution
CN104679592A (zh) 一种微控制单元mcu中资源动态分配的方法和系统
CN106126731A (zh) 一种获取Elasticsearch分页数据的方法及装置
KR20200070116A (ko) 대형 그래프 처리를 위한 그래프 데이터 분할
CN104932986A (zh) 一种数据重分布方法及装置
US20200379796A1 (en) Cluster expansion method and apparatus, electronic device and storage medium
CN111414422B (zh) 一种数据分布方法、装置、设备和存储介质
CN106341498A (zh) 基于网络地址的定位、ip分段数据的存储方法及装置
CN110891033B (zh) 网络资源处理方法、装置、网关、控制器及存储介质
CN111857972A (zh) 虚拟化网络功能vnf的部署方法、部署装置、部署设备
US20150347409A1 (en) Convert Command Into a BULK Load Operation
US11893407B2 (en) Overlay container storage driver for microservice workloads
CN116048377A (zh) 固态硬盘的数据处理方法及相关设备
CN114661668A (zh) 文件管理方法及相关装置
US11169996B2 (en) Query optimizer injection for dynamically provisioned database containers
CN112988383A (zh) 一种资源分配方法、装置、设备以及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17879771

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17879771

Country of ref document: EP

Kind code of ref document: A1