CN113342267A - Distributed operation method, system, device and storage medium - Google Patents

Distributed operation method, system, device and storage medium Download PDF

Info

Publication number
CN113342267A
CN113342267A CN202110551894.3A CN202110551894A CN113342267A CN 113342267 A CN113342267 A CN 113342267A CN 202110551894 A CN202110551894 A CN 202110551894A CN 113342267 A CN113342267 A CN 113342267A
Authority
CN
China
Prior art keywords
result
iterative
iterative operation
initial data
memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110551894.3A
Other languages
Chinese (zh)
Inventor
蒋信
刘瑞盛
喻涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Pusaiwei Technology Hangzhou Co ltd
Original Assignee
Pusaiwei Technology Hangzhou Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Pusaiwei Technology Hangzhou Co ltd filed Critical Pusaiwei Technology Hangzhou Co ltd
Priority to CN202110551894.3A priority Critical patent/CN113342267A/en
Publication of CN113342267A publication Critical patent/CN113342267A/en
Pending legal-status Critical Current

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/0614—Improving the reliability of storage systems
    • G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/17—Details of further file system functions
    • G06F16/172—Caching, prefetching or hoarding of files
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/182—Distributed file 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/0643—Management of files
    • 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/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Computer Security & Cryptography (AREA)
  • Retry When Errors Occur (AREA)

Abstract

The invention discloses a distributed operation method, a system, a device and a storage medium, wherein the distributed operation method comprises the following steps of S1: acquiring initial data, and performing iterative operation processing on the initial data; step S2: obtaining a result of current iterative operation and storing the result in a nonvolatile memory; step S3: and reading the stored current iteration operation result and taking the current iteration operation result as initial data of the next iteration operation, returning to the step S1 to execute the next iteration operation processing, and outputting the iteration termination result until the iteration termination condition is met. The invention stores the intermediate result obtained by each iterative operation into the nonvolatile memory, and when the computer is crashed, the intermediate result stored in the nonvolatile memory is not lost, so that the computer can be continuously used after being restarted without carrying out corresponding calculation, data operation and transmission processes again, thereby improving the efficiency and reliability of the system.

Description

Distributed operation method, system, device and storage medium
Technical Field
The present invention relates to the field of distributed file system technologies, and in particular, to a distributed computing method, system, apparatus, and storage medium.
Background
Big data is one of the most important technical directions for the development of the information industry. With the generation of mass data, the traditional centralized computing and storage system is difficult to meet the requirements for large data storage and processing, and the distributed storage and computing system is widely applied.
The existing distributed computing platform can carry out multiple operations on input data in an iteration mode, and a final operation result is stored in a local storage after the operation is finished. However, if a fault condition such as a computer crash or power failure occurs in the computing platform during the computing process, the computing data of the computing platform is lost, so that the latest computing data cannot be restored when the system is restarted, the computing platform needs to execute the computing task again, each step of computing process and data operation and transmission process before the system fault is repeated, the program execution time is prolonged, and the resource waste is caused.
Disclosure of Invention
In order to overcome the defects of the prior art, an object of the present invention is to provide a distributed operation method, which can ensure that the intermediate result of the operation is not lost, and improve the system reliability and the system restart efficiency.
The second objective of the present invention is to provide an operation system for executing the above operation method.
The invention also provides an electronic device for executing the operation method.
It is a fourth object of the present invention to provide a storage medium for executing the above-mentioned operation method.
One of the purposes of the invention is realized by adopting the following technical scheme:
a distributed computing method, comprising:
step S1: acquiring initial data, and performing iterative operation processing on the initial data;
step S2: obtaining a result of current iterative operation and storing the result in a nonvolatile memory;
step S3: and reading the stored current iteration operation result and taking the current iteration operation result as initial data of the next iteration operation, returning to the step S1 to execute the next iteration operation processing, and outputting the iteration termination result until the iteration termination condition is met.
Further, after the initial data is acquired in step S1, the method further includes:
and judging whether the initial data is read from the nonvolatile memory or not, and if not, writing the acquired initial data into the nonvolatile memory.
Furthermore, the non-volatile memory has a read-write time less than 50ns and a scratch resistant frequency greater than 1010The memory of (2).
Further, the non-volatile memory includes, but is not limited to, spin transfer torque magnetic random access memory, spin orbit torque magnetic random access memory, magnetic racetrack memory, or ferroelectric random access memory.
Further, the method for obtaining the result of the current iterative operation and writing the result into the nonvolatile memory includes:
obtaining a volatile memory address, and writing the current iteration operation result into a volatile memory corresponding to the volatile memory address in advance;
and then obtaining the nonvolatile memory address, and transferring the current iteration operation result stored in the volatile memory into the nonvolatile memory corresponding to the nonvolatile memory address.
Further, the step S3 satisfies an iteration termination condition, including:
judging whether all iterative operations are finished, and if all iterative operations are finished, terminating the iterative operations; or the like, or, alternatively,
judging whether the iterative operation is converged, and if so, terminating the iterative operation; or the like, or, alternatively,
and judging whether the accumulated times of the iterative operation reach the preset times or not, and if so, terminating the iterative operation.
Further, still include:
and judging whether a restart instruction is received, if so, loading all iterative operation results from the nonvolatile memory and storing the iterative operation results in a system local storage, and then executing system restart operation.
The second purpose of the invention is realized by adopting the following technical scheme:
a distributed computing system, comprising:
the iterative operation module is used for carrying out operation processing on the initial data according to a preset iterative operation sequence;
the nonvolatile storage module is used for storing the result of each iterative operation;
the reading module is used for reading the iterative operation result in the nonvolatile storage module and inputting the iterative operation result into the iterative operation module for the next iterative operation as initial data of the next iterative operation;
and the output module is used for outputting the final result of the iterative operation to the distributed file system for storage.
The third purpose of the invention is realized by adopting the following technical scheme:
an electronic device, comprising:
carrying out a procedure;
a memory for storing the program;
and the processor is used for loading the program to execute the distributed operation method.
The fourth purpose of the invention is realized by adopting the following technical scheme:
a storage medium storing a program which, when executed by a processor, implements the distributed computing method as described above.
Compared with the prior art, the invention has the beneficial effects that:
in the process of carrying out multiple iterative operations, the invention stores the intermediate result obtained by each iterative operation into the nonvolatile memory, and when the computer is crashed, the intermediate result of the calculation stored in the nonvolatile memory is not lost, so that the computer can be continuously used after being restarted without carrying out corresponding calculation, data operation and transmission processes again, thereby improving the efficiency and the reliability of the system.
Drawings
FIG. 1 is a schematic flow chart of a distributed computing method according to the present invention;
FIG. 2 is a block diagram of a distributed computing system according to the present invention.
Detailed Description
The present invention will be further described with reference to the accompanying drawings and the detailed description, and it should be noted that any combination of the embodiments or technical features described below can be used to form a new embodiment without conflict.
Example one
The embodiment provides a distributed computing method, which is based on a distributed computing platform, and the computing platform of the embodiment adopts a distributed file system. The distributed file system adopts a master-slave structure and comprises a plurality of data nodes and at least one name node. The distributed file system stores data in a data block mode, namely, the distributed file is divided into different data blocks to be stored in different data nodes, and all the data nodes are managed through name nodes.
In the calculation process of the distributed calculation platform of the embodiment, a calculation frame similar to Spark is adopted to perform multiple iterative operations, and a final result obtained by calculation is written into the distributed file system; the nonvolatile memory is used as the memory to store the intermediate calculation result in the calculation process, and the intermediate calculation result stored in the nonvolatile memory is not lost when the computer is crashed, so that the computer can be continuously used after being restarted without performing corresponding calculation, data operation and transmission processes again, and the efficiency and the reliability of the system are improved.
As shown in fig. 1, the distributed computing method of this embodiment specifically includes the following steps:
step S1: acquiring initial data, and performing iterative operation processing on the initial data;
step S2: obtaining a result of current iterative operation and storing the result in a nonvolatile memory;
step S3: and reading the stored current iteration operation result and taking the current iteration operation result as initial data of the next iteration operation, returning to the step S1 to execute the next iteration operation processing, and outputting the iteration termination result until the iteration termination condition is met.
In this embodiment, the intermediate result generated by each iterative operation is stored in the nonvolatile memory, and the number of the nonvolatile memories for storing the iterative operation result may be set to one or more according to the requirement, that is, one nonvolatile memory is used to store all the intermediate results of the entire iterative operation. Furthermore, a plurality of nonvolatile memories may be used to store intermediate results in the entire iterative operation separately; at this time, different nonvolatile memories need to be matched for different iterative operation steps according to requirements.
In this embodiment, after acquiring the initial data, it is necessary to determine whether the initial data is read from the nonvolatile memory, and if not, the initial data represents that the initial data is the first input data of the iterative operation, and at this time, the first input data is stored in the corresponding nonvolatile memory for storage.
Performing first iterative operation on initial data according to an iterative operation sequence set in a calculation framework, and storing an intermediate result obtained by the operation in a corresponding nonvolatile memory; then, before the second iterative operation, reading an intermediate result of the first iterative operation from the nonvolatile memory, and performing the second iterative operation by taking the intermediate result as input data of the second iterative operation; and repeating the steps, storing the intermediate result of the second iterative operation in the corresponding nonvolatile memory, reading the intermediate result of the second iterative operation from the nonvolatile memory before the third iterative operation as the input of the third iterative operation, repeating the steps, and stopping the iterative operation until the iteration termination condition is met in the loop, and outputting the result of the last iterative operation as the final result to the distributed file system for storage.
The satisfying of the iteration condition specifically includes the following cases:
judging whether all iterative operations are finished or not, and if all iterative operations are finished, terminating the iterative operations; or the like, or, alternatively,
judging whether the iterative operation is converged, and if so, terminating the iterative operation; or the like, or, alternatively,
judging whether the accumulated times of the iterative operation reaches a preset time, wherein the preset time can be equal to or less than the total times of all the iterative operations; if yes, the iterative operation is terminated.
The intermediate result generated by each iteration operation can be directly stored in the corresponding nonvolatile memory, and the specific storage method is to directly obtain the storage address of the nonvolatile memory corresponding to the iteration operation step and write the intermediate result into the nonvolatile memory corresponding to the storage address. In this embodiment, the read/write time is less than 50ns, and the erase-resistant frequency is greater than 1010The nonvolatile memory stores the intermediate result, so that the effect of real-time storage can be achieved, and the situation that the latest operation result cannot be stored due to low read-write speed or failure of the memory is reduced.
The non-volatile memory in this embodiment may be one of a spin transfer torque magnetic random access memory, a spin orbit torque magnetic random access memory, a magnetic racetrack memory, or a ferroelectric random access memory.
The nonvolatile memory may be spin transfer torque magnetic memory (STT-MRAM) which stores information using a Magnetic Tunnel Junction (MTJ) device, reads and writes data by a tunneling magneto-resistance (TMR) effect and a Spin Transfer Torque (STT) effect, has characteristics of high read/write speed and high endurance, has a time of less than 50ns for read and write operations, and has an endurance of more than 10 ns10. And in the system operation process, the intermediate result of each iterative operation is loaded into a nonvolatile spin transfer torque magnetic memory (STT-MRAM) memory for storage.
The non-volatile memory may be a Spin-orbit Torque magnetic memory (SOT-MRAM), and the physical effects involved in the read and write operations of the SOT-MRAM include, but are not limited to, tunneling magneto-resistance (TMR) effect, Spin transfer Torque (Spin transfer Torque) effect, Spin Hall (Spin Hall) effect, Rashba effect, Dzyashinskii-Moriya (DM) interaction, etc., and the present embodiment is implemented by the SOT-MRAM of TMR effect and Spin-orbit Torque (SOT) effectThe read and write data has the characteristics of high read-write speed and high scratch resistance, the time of the read operation and the write operation is less than 50ns, and the scratch resistance is better than 1010. And in the system operation process, the intermediate result of each iterative operation is loaded into a nonvolatile spin orbit torque magnetic memory (SOT-MRAM) memory for storage.
The non-volatile Memory may be a magnetic Racetrack Memory (Racetrack Memory) in which the physical mechanisms for writing and moving the magnetic domain (wall) patterns include, but are not limited to, Spin transfer Torque (Spin Torque) effect, Spin Hall (Spin Hall) effect, Rashba effect, Dzyaloshinskii-moriya (dm) interaction, inter-magnetic layer exchange coupling (IEC), exchange biasing effect, and the like. The magnetic racetrack memory of this embodiment uses magnetic nanowires as carriers (i.e., racetracks) to store information in the magnetic domains or domain wall patterns of the magnetic nanowire racetracks. In the system operation process, the intermediate result of each iterative operation is loaded into a nonvolatile magnetic Racetrack Memory (Racentrack Memory) for storage.
The nonvolatile memory can also be a ferroelectric memory (FeRAM), the FeRAM stores information by utilizing the polarization direction of the ferroelectric material, has the characteristics of high read-write speed and high erasing resistance, the time of read operation and write operation is less than 50ns, and the erasing resistance is better than 1010. In the system operation process, the intermediate result of each iterative operation is loaded into a nonvolatile ferroelectric memory (FeRAM) memory for storage.
In addition, the intermediate result can also be written into the nonvolatile memory in an indirect manner, specifically, the intermediate result is stored in the volatile memory first, and then the intermediate result in the volatile memory is transferred into the nonvolatile memory, that is, in the storage process, a volatile memory address is obtained first, the intermediate result generated by the iterative operation is written into the volatile memory corresponding to the volatile memory address in advance, then the corresponding nonvolatile memory address is obtained, and the intermediate result stored in the volatile memory is transferred into the nonvolatile memory corresponding to the nonvolatile memory address. The read-write speed between the volatile memory is higher than that of the nonvolatile memory, so that the latest data is quickly written by using the volatile memory when the system runs, buffer time is provided for the storage work of the nonvolatile memory, the latest operation result is reserved to the greatest extent, real-time storage is realized, and the latest data loss is avoided.
The intermediate result of the iterative operation is stored in the nonvolatile memory, the data can not be lost, and the intermediate result of each iterative operation is reserved to the maximum extent, so that the computer can be continuously used after being restarted without carrying out corresponding calculation, data operation and transmission processes again, and the efficiency and the reliability of the system are improved.
And if the situation such as power failure and the like in the iterative operation process needs to be restarted, all iterative operation results can be loaded from the nonvolatile memory and stored in a system local storage after the system restarting operation is executed. After the system is restarted, the intermediate result of the iterative operation of the computing platform is reserved, so that the system can continue to execute the rest iterative operation steps according to the intermediate result without performing corresponding calculation, data operation and transmission processes again, and the efficiency and the reliability of the system are improved.
Example two
The present embodiment provides a distributed computing system, which executes the distributed computing method described in the first embodiment, and as shown in fig. 2, the system specifically includes the following modules:
the iterative operation module is used for carrying out iterative operation processing on the initial data for multiple times according to a preset iterative operation sequence;
the nonvolatile storage module is used for storing the result of each iterative operation;
the reading module is used for reading the iterative operation result in the nonvolatile storage module, inputting the read result as initial data of the next iterative operation into the iterative operation module for the next iterative operation, and ending the iterative operation until an iterative termination condition is met;
and the output module is used for outputting the final result of the iterative operation to the distributed file system for storage.
The distributed computing system of this embodiment further includes a restart module, configured to execute a restart operation of the distributed file system, and load all iterative computation results from the nonvolatile storage module, where after the system is restarted, intermediate results of iterative computation of the computing platform are all retained, so that the system may continue to execute the remaining iterative computation steps according to the intermediate results, and corresponding computation, data operation, and transmission processes do not need to be performed again, thereby improving efficiency and reliability of the system.
EXAMPLE III
The present embodiment provides an electronic device, comprising a program, a memory for storing the program, and a processor for loading the program to execute the distributed operation method as described above. In addition, the present embodiment also provides a storage medium storing a program that realizes the distributed computing method as described above when executed by a processor.
The apparatus and the storage medium in this embodiment are based on two aspects of the same inventive concept, and the method implementation process has been described in detail in the foregoing, so that those skilled in the art can clearly understand the structure and implementation process of the system in this embodiment according to the foregoing description, and for the sake of brevity of the description, details are not repeated here.
The above embodiments are only preferred embodiments of the present invention, and the protection scope of the present invention is not limited thereby, and any insubstantial changes and substitutions made by those skilled in the art based on the present invention are within the protection scope of the present invention.

Claims (10)

1. A distributed computing method, comprising:
step S1: acquiring initial data, and performing iterative operation processing on the initial data;
step S2: obtaining a result of current iterative operation and storing the result in a nonvolatile memory;
step S3: and reading the stored current iteration operation result and taking the current iteration operation result as initial data of the next iteration operation, returning to the step S1 to execute the next iteration operation processing, and outputting the iteration termination result until the iteration termination condition is met.
2. The distributed computing method according to claim 1, wherein after acquiring the initial data in step S1, the method further comprises:
and judging whether the initial data is read from the nonvolatile memory or not, and if not, writing the acquired initial data into the nonvolatile memory.
3. The distributed computing method of claim 1, wherein the non-volatile memory has a read/write time of less than 50ns and a endurance count of greater than 1010The memory of (2).
4. The distributed computing method of claim 3, wherein the non-volatile memory includes, but is not limited to, spin transfer torque magnetic random access memory, spin orbit torque magnetic random access memory, magnetic racetrack memory, or ferroelectric random access memory.
5. The distributed computing method of claim 1, wherein the method of obtaining and writing the result of the current iteration of computing into the non-volatile memory is:
obtaining a volatile memory address, and writing the current iteration operation result into a volatile memory corresponding to the volatile memory address in advance;
and then obtaining the nonvolatile memory address, and transferring the current iteration operation result stored in the volatile memory into the nonvolatile memory corresponding to the nonvolatile memory address.
6. The distributed computing method according to claim 1, wherein the step S3 of satisfying an iteration termination condition includes:
judging whether all iterative operations are finished, and if all iterative operations are finished, terminating the iterative operations; or the like, or, alternatively,
judging whether the iterative operation is converged, and if so, terminating the iterative operation; or the like, or, alternatively,
and judging whether the accumulated times of the iterative operation reach the preset times or not, and if so, terminating the iterative operation.
7. The distributed computing method of claim 1, further comprising:
and judging whether a restart instruction is received, if so, loading all iterative operation results from the nonvolatile memory after system restart operation is executed and storing the iterative operation results in a system local storage.
8. A distributed computing system, comprising:
the iterative operation module is used for carrying out operation processing on the initial data according to a preset iterative operation sequence;
the nonvolatile storage module is used for storing the result of each iterative operation;
the reading module is used for reading the iterative operation result in the nonvolatile storage module and inputting the iterative operation result into the iterative operation module for the next iterative operation as initial data of the next iterative operation;
and the output module is used for outputting the final result of the iterative operation to the distributed file system for storage.
9. An electronic device, comprising:
carrying out a procedure;
a memory for storing the program;
a processor for loading the program to perform the distributed computing method of any of claims 1-7.
10. A storage medium storing a program, wherein the program, when executed by a processor, implements the distributed computing method of any one of claims 1-7.
CN202110551894.3A 2021-05-20 2021-05-20 Distributed operation method, system, device and storage medium Pending CN113342267A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110551894.3A CN113342267A (en) 2021-05-20 2021-05-20 Distributed operation method, system, device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110551894.3A CN113342267A (en) 2021-05-20 2021-05-20 Distributed operation method, system, device and storage medium

Publications (1)

Publication Number Publication Date
CN113342267A true CN113342267A (en) 2021-09-03

Family

ID=77470030

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110551894.3A Pending CN113342267A (en) 2021-05-20 2021-05-20 Distributed operation method, system, device and storage medium

Country Status (1)

Country Link
CN (1) CN113342267A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114356422A (en) * 2022-03-21 2022-04-15 四川新迎顺信息技术股份有限公司 Graph calculation method, device and equipment based on big data and readable storage medium

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114356422A (en) * 2022-03-21 2022-04-15 四川新迎顺信息技术股份有限公司 Graph calculation method, device and equipment based on big data and readable storage medium

Similar Documents

Publication Publication Date Title
CN101957726B (en) Phase transition storage in dual inline memory module
US20190114225A1 (en) Dynamically assigning data latches
KR101014040B1 (en) Appratus and method for managing dram buffer
US20180114570A1 (en) Data Storage Device and Data Writing Method Thereof
US7716396B1 (en) Multi-reader multi-writer circular buffer memory
TWI502359B (en) Command order re-sequencing in non-volatile memory
US10732838B2 (en) Logical grouping for hybrid dual write
US8266368B2 (en) Memory controller, memory system, and control method for memory system
US20160055095A1 (en) Storing data from cache lines to main memory based on memory addresses
US10389380B2 (en) Efficient data path architecture for flash devices configured to perform multi-pass programming
JP2006294218A (en) Nonvoaltile memory device and its multipage copyback method
JP2011118469A (en) Device and method for managing memory
CN108351816A (en) Technology for executing data copy operation on data storage device
KR20170108334A (en) Memory system and operating method thereof
CN105373338A (en) Control method and controller for FLASH
US20080288743A1 (en) Apparatus and method of managing mapping table of non-volatile memory
KR20140007990A (en) User device having non-volatile random access memory and data management method thererof
DE102020107491A1 (en) STORAGE SYSTEM AND PROCEDURE FOR OPERATING IT
CN113342266A (en) Distributed computing method, system and storage medium based on nonvolatile memory
CN113342267A (en) Distributed operation method, system, device and storage medium
CN111813339B (en) Data writing method and device for Nand Flash of Flash memory, electronic equipment and storage medium
CN114281265A (en) Storage medium failure processing method and device and solid state disk
CN115470052B (en) Bad block detection method and device for memory chip and memory medium
CN110364211B (en) Method, device and equipment for reducing erasing interference time of nonvolatile memory
JP2013235530A5 (en)

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