WO2010142196A1 - Procédé et appareil de conservation de données - Google Patents

Procédé et appareil de conservation de données Download PDF

Info

Publication number
WO2010142196A1
WO2010142196A1 PCT/CN2010/073078 CN2010073078W WO2010142196A1 WO 2010142196 A1 WO2010142196 A1 WO 2010142196A1 CN 2010073078 W CN2010073078 W CN 2010073078W WO 2010142196 A1 WO2010142196 A1 WO 2010142196A1
Authority
WO
WIPO (PCT)
Prior art keywords
sheep
address
file
program
save
Prior art date
Application number
PCT/CN2010/073078
Other languages
English (en)
Chinese (zh)
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 WO2010142196A1 publication Critical patent/WO2010142196A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation
    • G06F11/1402—Saving, restoring, recovering or retrying
    • G06F11/1415—Saving, restoring, recovering or retrying at system level
    • G06F11/1441—Resetting or repowering
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14—Error detection or correction of the data by redundancy in operation
    • G06F11/1402—Saving, restoring, recovering or retrying
    • G06F11/1415—Saving, restoring, recovering or retrying at system level
    • G06F11/1443—Transmit or communication errors

Definitions

  • the wood to be solved by the Institute is a method and device for providing God's preservation, and the internal line is effectively saved and convenient.
  • the book provides a method for saving the gods, including the seat program in the memory to store the pre-inner, the inner sheep, the at least the size and the sheep meta-religion, and at least the sheep to map the sheep paper and the number of sheep.
  • Nene inside includes the address index, the index of the sheep in the memory of the address of the sheep including the address of the goat
  • the steps of mapping include
  • the steps of saving the inside and the sheep in the file include saving the information contained in the file to the file, and then saving the sheep to the file in turn.
  • the size of the information in the information the address index table containing the address and
  • the file depends on the end of the table in turn, updating the address.
  • the sheep are included in the sheep, and the sheep are stored in order.
  • the seat program will be stored in the middle of the need, the sheep or the sheep will be allocated, or the sheep will be stored in the sheep, the medium or the sheep.
  • the inside includes the former one,
  • the steps to assign a sheep intermediary or multiple sheep include
  • the sheep will take out the assigned sheep, return the assigned sheep's address and the sheep or
  • the sheep's epidermis has a well-distributed sheep, and the memory is introduced to the tail of the inner table. Before the renewal, the tail of the same sheep and sheep table is taken, and the sheep are taken out of the allocated sheep, the address of the assigned sheep and the sheep.
  • this book provides a device for God to save, including internal and internal storage.
  • the sheep including at least the sheep and the sheep and the sheep are mapped to the address and the address of the sheep .
  • the interface for saving the program for use in the program in the program that needs to be saved, the information contained in the program is saved to the file, and the inside includes the address index, to index the address of the sheep in the memory, and the representation of the sheep includes the address of the sheep.
  • the device includes an internal interface for internal connection and internal program, an information stored in the program file and stored in the file, and the core information is sequentially indexed.
  • the sheep are stored in the file in the following way.
  • the size of the message, including the address and address of the address index table in the file depends on the end of the table, updating the address index. Inside, including sheep and sheep, in order to save the sheep file internal force, force the program interface,
  • the in-use program needs to be saved, assigned to the sheep or more sheep, or
  • the sheep and the sheep find the address of the sheep in the middle of the sheep.
  • the sheep will take out the assigned sheep , return the assigned sheep 's address and the sheep or
  • the sheep do not have enough sheep to be allocated, then the memory intermediary To the end of the inner table, before the update, with the tail of the sheep and sheep table, the sheep are taken out of the assigned sheep, the address of the assigned sheep and the sheep meta-teaching.
  • the internal wood files are combined, and the internal numbers are stored in the file, and the internal numbers are mapped into the files, so that the numbers are saved in the form of files on the permanent storage medium. , and the permanent storage of files in the media into memory, and the solution in the multiple. Overview
  • the file is stored in the stored program and stored as a file.
  • the method of saving memory in this including
  • each medium is fixed and fixed within the file, that is, within each medium (ie, referenced in the program), and the size of the sheep is also fixed and fixed. That is to say, the size and size of the sheep are fixed and cannot be more.
  • Each of the contents in the file is stored in the file.
  • the internal management of the kernel common program file including the internal, address mapping, and internal, is due to the importance of the nuclear commonality and needs to be stored in the file.
  • the information of the nuclear common department is stored in the file.
  • the mapping of addresses can be mapped, and the sheep and the sheep are also mapped to the internal addresses of the sheep and the sheep.
  • each of the sheep contained in each medium is fixed, the size of the sheep is also fixed, and the sheep are sorted, for example, the sheep in the first medium is 0 99, and the second is the sheep 00-199. You can get the address of the sheep (also known as Yang Yusuke) and the sheep, in the way
  • % means dividing the sheep of the sheep.
  • FIG. 5 it is a schematic diagram of the internal address mapping, including the inner, address index, and presentation of the decision table. It can be seen that the address is indexed by the index, and the address stored in the memory is stored in the sheep in the order of the sheep and the sheep.
  • step 230 will be executed 290 return failure information, flow.
  • the sheep will be the sheep and sheep.
  • the sheep and the sheep are found in the address of the sheep, but in the sheep.
  • the sheep In the inner wood, the sheep is different from the past, and there are no more pointers such as ex pev, but 32 integers, which contain the number of sheep and 5 sheep.
  • the save process that is, the file stored in the file, and then the order of the sheep, in turn, save the sheep to the file.
  • the address index table is shown in 1.
  • step 340 If there is a near or not in the file, then go back to step 340 to execute, otherwise the process.
  • the device 400 includes the inner 410 stored in sequence, the inner 410, the inner 430, and the inner file 430, including the file.
  • Save 420 the interface for the program, the program in the seat needs to save the file to the file in the file system 4201, first save the file 4101 in the file, and then the order of the sheep will be Sheep, save to file
  • the interface for the program, the program in the program needs to transfer the files in the file system 4201 to the file 4101, the information in the file of the family file 4101, the total information depends on the size, the address index table, the sheep file In the middle of each, the end of the table, update the address index
  • the file of 410 is connected to 4101, which is needed in the program.
  • sheep, sheep or sheep are operating before, this is no longer.
  • the above-mentioned devices stored in the memory can be similarly stored in the 420, and the 430 is saved within 420.
  • the number of the file is stored in the file, and the internal file is mapped to the file, so that the file is saved on the permanent storage medium, and the number of files in the permanent storage medium is stored in the memory, and the solution is solved.
  • the file is saved on the permanent storage medium, and the number of files in the permanent storage medium is stored in the memory, and the solution is solved.
  • the file is in memory, and the solution is in the same way.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Memory System (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention porte sur un procédé et un appareil de conservation de données. Le procédé comprend les étapes suivantes : un programme d'application préconstruit une structure de mémoire avec l'unité de cellules de bloc intra-bloc destinée à conserver des données dans la mémoire; la structure de mémoire comprend au moins des dimensions de bloc et le nombre de cellules de bloc dans chaque bloc, et la structure de cellules de bloc comprend au moins une identification de cellules de bloc; le mappage de l'identification de cellules de bloc et le nombre des cellules de bloc dans chaque bloc afin de bloquer des adresses des cellules et des adresses intra-bloc; lorsqu'il est nécessaire de conserver des données dans la cellule de bloc, le programme d'application conserve la structure de mémoire dans un fichier et, conserve les données de la cellule de bloc dans le fichier à la suite de l'identification de cellules de bloc, de façon à réaliser une conservation de données dans la mémoire. La présente invention résout des problèmes auxquels on fait face lors d'un redémarrage durant le transfert de données avec une structure de données complexes entre des tâches multiples.
PCT/CN2010/073078 2009-06-12 2010-05-21 Procédé et appareil de conservation de données WO2010142196A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2009102037724A CN101582092B (zh) 2009-06-12 2009-06-12 一种实现保存内存中的数据的方法及装置
CN200910203772.4 2009-06-12

Publications (1)

Publication Number Publication Date
WO2010142196A1 true WO2010142196A1 (fr) 2010-12-16

Family

ID=41364238

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/073078 WO2010142196A1 (fr) 2009-06-12 2010-05-21 Procédé et appareil de conservation de données

Country Status (2)

Country Link
CN (1) CN101582092B (fr)
WO (1) WO2010142196A1 (fr)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582092B (zh) * 2009-06-12 2011-04-20 中兴通讯股份有限公司 一种实现保存内存中的数据的方法及装置
CN103136104B (zh) * 2011-11-24 2016-04-06 深圳市快播科技有限公司 一种内存管理方法和系统
CN103164490B (zh) * 2011-12-19 2016-02-17 北京新媒传信科技有限公司 一种不固定长度数据的高效存储实现方法和装置
CN102999581B (zh) * 2012-11-14 2016-05-11 北京北纬点易信息技术有限公司 用于业务中大用户量数据访问及实时排序系统
CN103873389B (zh) * 2012-12-12 2018-05-04 北京百度网讯科技有限公司 一种标识资源分配方法及系统
CN103593485B (zh) * 2013-12-04 2017-06-16 网易传媒科技（北京）有限公司 实现数据库实时操作的方法和设备
CN105159837A (zh) * 2015-08-20 2015-12-16 广东睿江科技有限公司 一种内存管理方法
CN106126442A (zh) * 2016-06-17 2016-11-16 北京京坤倍益科技发展有限公司 一种数据存储结构和遥感卫星数据存储系统
CN106776375A (zh) * 2016-12-27 2017-05-31 东方网力科技股份有限公司 一种磁盘内部的数据缓存方法及装置
CN108804571B (zh) * 2018-05-23 2021-11-05 湖南博匠信息科技有限公司 一种数据存储方法、装置以及设备
CN110287044B (zh) * 2019-07-02 2021-08-03 广州虎牙科技有限公司 无锁共享内存处理方法、装置、电子设备及可读存储介质
CN113238857B (zh) * 2021-04-21 2022-10-14 宜通世纪物联网研究院(广州)有限公司 一种基于内存池的map映射表多线程遍历方法及装置
CN114741076B (zh) * 2022-04-20 2024-05-31 重庆长安汽车股份有限公司 一种基于soa服务参数快速定义的方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1954318A (zh) * 2004-05-20 2007-04-25 国际商业机器公司 用于保持可由客户机通过网络访问的文件集名称空间的方法、系统和程序
CN101093455A (zh) * 2006-06-21 2007-12-26 中兴通讯股份有限公司 一种嵌入式操作系统的内存池分配方法
WO2008046670A1 (fr) * 2006-10-18 2008-04-24 International Business Machines Corporation Procédé pour contrôler des niveaux de remplissage d'une pluralité de réservoirs de stockage
CN101582092A (zh) * 2009-06-12 2009-11-18 中兴通讯股份有限公司 一种实现保存内存中的数据的方法及装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1304961C (zh) * 2005-03-11 2007-03-14 清华大学 基于元数据服务器的存储虚拟化管理方法
US7606845B2 (en) * 2006-07-13 2009-10-20 International Business Machines Corporation Apparatus, systems, and method for concurrent storage to an active data file storage pool, copy pool, and next pool

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1954318A (zh) * 2004-05-20 2007-04-25 国际商业机器公司 用于保持可由客户机通过网络访问的文件集名称空间的方法、系统和程序
CN101093455A (zh) * 2006-06-21 2007-12-26 中兴通讯股份有限公司 一种嵌入式操作系统的内存池分配方法
WO2008046670A1 (fr) * 2006-10-18 2008-04-24 International Business Machines Corporation Procédé pour contrôler des niveaux de remplissage d'une pluralité de réservoirs de stockage
CN101582092A (zh) * 2009-06-12 2009-11-18 中兴通讯股份有限公司 一种实现保存内存中的数据的方法及装置

Also Published As

Publication number Publication date
CN101582092A (zh) 2009-11-18
CN101582092B (zh) 2011-04-20

Similar Documents

Publication Publication Date Title
WO2010142196A1 (fr) Procédé et appareil de conservation de données
CN109564545B (zh) 用于压缩地址的方法和设备
US20160132541A1 (en) Efficient implementations for mapreduce systems
CN105956035A (zh) 一种文件存储方法及装置
WO2013078583A1 (fr) Procédé et appareil permettant d'optimiser l'accès à des données, et procédé et appareil permettant d'optimiser le stockage de données
WO2017092596A1 (fr) Procédé de traitement de requête d'écriture et terminal mobile
WO2022111313A1 (fr) Procédé de traitement de requête et système de micro-services
US11520520B2 (en) Memory system and method of controlling nonvolatile memory
CN108351838B (zh) 使用聚合存储器管理单元(mmu)提供存储器管理功能
CN104484136B (zh) 一种可支撑高并发内存数据的方法
US11972110B2 (en) Storage device and storage system
KR102063281B1 (ko) 파일에 접근하기 위한 방법과 장치, 및 저장 시스템
JP6485150B2 (ja) 情報処理装置、出力システム、出力方法およびプログラム
JP2001229058A (ja) データベースサーバ処理方法
WO2023070925A1 (fr) Procédé de fragmentation pour un groupe de transactions à chaîne de blocs, système, support de stockage et système informatique
CN112925753B (zh) 文件追加写入方法、装置、电子设备及存储介质
WO2014177080A1 (fr) Procédé et dispositif de traitement de stockage d'objet ressource
WO2017036195A1 (fr) Procédé et appareil de duplication à deux étages de message de multidiffusion ainsi que support d'informations
WO2013189413A2 (fr) Procédé et dispositif de traitement de mémoire tampon
CN112765052A (zh) 处理NVMe完成队列（CQ）阻塞的方法与存储设备
US11567679B2 (en) Concurrent remote-local allocation operations
CN113194127B (zh) 一种数据存储方法、数据传输方法及计算设备
US9747226B2 (en) Packet processing system, method and device to optimize packet buffer space
CN105095015B (zh) 一种磁盘快照的建立方法及装置
CN106161510B (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: 10785709

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: 10785709

Country of ref document: EP

Kind code of ref document: A1