CN111273869A - Distributed storage system performance optimization method, system, electronic device and medium - Google Patents

Distributed storage system performance optimization method, system, electronic device and medium Download PDF

Info

Publication number
CN111273869A
CN111273869A CN202010062154.9A CN202010062154A CN111273869A CN 111273869 A CN111273869 A CN 111273869A CN 202010062154 A CN202010062154 A CN 202010062154A CN 111273869 A CN111273869 A CN 111273869A
Authority
CN
China
Prior art keywords
target
volume
instruction
volume mapping
map
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.)
Granted
Application number
CN202010062154.9A
Other languages
Chinese (zh)
Other versions
CN111273869B (en
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.)
Suzhou Inspur Intelligent Technology Co Ltd
Original Assignee
Suzhou Inspur Intelligent Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Suzhou Inspur Intelligent Technology Co Ltd filed Critical Suzhou Inspur Intelligent Technology Co Ltd
Priority to CN202010062154.9A priority Critical patent/CN111273869B/en
Publication of CN111273869A publication Critical patent/CN111273869A/en
Application granted granted Critical
Publication of CN111273869B publication Critical patent/CN111273869B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604Improving or facilitating administration, e.g. storage management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638Organizing or formatting or addressing of data
    • G06F3/0644Management of space entities, e.g. partitions, extents, pools
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0652Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input 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/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Landscapes

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

Abstract

The application discloses a method and a system for optimizing the performance of a distributed storage system, an electronic device and a computer readable storage medium, wherein the method comprises the following steps: receiving a creation instruction, and creating a target and a volume mapping according to the creation instruction; sending the relevant information corresponding to the target and the volume mapping to the tgtd service through inter-process communication; and saving the relevant information corresponding to the incoming target and the volume mapping in the map by using the tgtd service so as to directly acquire data from the map when an access request is received. Therefore, after the target and the volume mapping are created, the relevant information corresponding to the target and the volume mapping is stored in the map, and other modules can directly access the map to acquire the required data, so that the updating and accessing efficiency is effectively improved, and the problem of performance reduction caused by large magnitude of the target and the volume mapping is solved.

Description

Distributed storage system performance optimization method, system, electronic device and medium
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method and a system for optimizing performance of a distributed storage system, an electronic device, and a computer-readable storage medium.
Background
The architecture of iSCSI (Internet Small Computer System Interface) defines a provider and a user of storage service as iSCSI target, i.e., a storage server, for converting SCSI commands and data in TCP/IP packets, respectively; and an iSCSI initiator, i.e., a storage client, for generating SCSI requests and encapsulating SCSI commands and data into TCP/IP packets to be sent to the IP network. The storage server side and the storage client side communicate by using TCP, and the storage server side maps the block storage device into a volume and provides the volume for the storage client side, so that remote block storage service is realized.
The Linux target frame, i.e. TGT architecture, is an architecture for providing support for creating and maintaining storage server side drivers, and a key target of the architecture is to indirectly integrate into the middle layer of SCSI. In the existing TGT architecture, after the tgtadm command line executes the creation command, the corresponding target and volume mapping information is stored in the corresponding structure type bidirectional linked list, and when other modules need to use the target and volume mapping information, the corresponding information is acquired by traversing the linked list. However, under such an architecture, other modules may frequently traverse the linked list, and when the number of targets or the number of volume mappings reaches an order of 10000 or higher, the operation of traversing the linked list may have a large impact on performance, which significantly increases the time consumption.
Disclosure of Invention
The application aims to provide a performance optimization method and system of a distributed storage system, an electronic device and a computer readable storage medium, which effectively improve the updating and accessing efficiency and solve the problem of performance reduction caused by large target and volume mapping magnitude.
In order to achieve the above object, the present application provides a method for optimizing performance of a distributed storage system, including:
receiving a creation instruction, and creating a target and a volume mapping according to the creation instruction;
sending the relevant information corresponding to the target and the volume mapping to the tgtd service through inter-process communication;
and saving the relevant information corresponding to the incoming target and the volume mapping in the map by using the tgtd service so as to directly acquire data from the map when an access request is received.
Optionally, the receiving a creation instruction, and creating a target and a volume map according to the creation instruction, includes:
and after receiving the creation instruction, storing the creation information corresponding to the creation instruction in a memory.
Optionally, after the creating information corresponding to the creating instruction is stored in the memory, the method further includes:
after receiving an access request aiming at the volume mapping, opening the volume corresponding to the volume mapping and creating a corresponding target thread;
and searching the creation information in the memory by using the target thread, and responding to the access request according to the creation information.
Optionally, after creating the target and the volume map according to the creation instruction, the method further includes:
the configuration information used to create the target and volume maps is persisted to a database.
Optionally, after the persistently storing the configuration information for creating the target and the volume map in the database, the method further includes:
and when the client logs in, searching and loading corresponding configuration information from the database according to the configuration requirement of the client or the user-defined requirement.
Optionally, the method further includes:
receiving a deletion instruction, and sending the deletion instruction to the tgtd service through interprocess communication;
determining a target or a target volume mapping corresponding to the deletion instruction by using the tgtd service;
if the deleting instruction corresponds to a target, clearing all volume mappings under the target;
if the deleting instruction corresponds to the target volume mapping, judging whether the volume corresponding to the target volume mapping is closed or not;
if not, deleting the target volume mapping after closing.
Optionally, the method further includes:
and deleting the deleted target or the configuration information mapped by the target volume from the database.
To achieve the above object, the present application provides a performance optimization system for a distributed storage system, including:
the creating module is used for receiving a creating instruction and creating a target and a volume mapping according to the creating instruction;
a sending module, configured to send, through inter-process communication, the target and relevant information corresponding to the volume mapping to a tgtd service;
and the storage module is used for storing the incoming target and the relevant information corresponding to the volume mapping in the map by using the tgtd service so as to directly acquire data from the map when an access request is received.
Optionally, the creating module includes:
the information storage unit is used for storing the creating information corresponding to the creating instruction in the memory after receiving the creating instruction;
the thread creating unit is used for opening the volume corresponding to the volume mapping and creating a corresponding target thread after receiving an access request aiming at the volume mapping;
and the request response unit is used for searching the creation information in the memory by using the target thread and responding to the access request according to the creation information.
To achieve the above object, the present application provides an electronic device including:
a memory for storing a computer program;
a processor for implementing the steps of any of the aforementioned disclosed distributed storage system performance optimization methods when executing the computer program.
To achieve the above object, the present application provides a computer-readable storage medium, on which a computer program is stored, the computer program, when being executed by a processor, implementing the steps of any one of the methods for optimizing the performance of a distributed storage system disclosed in the foregoing.
According to the scheme, the performance optimization method of the distributed storage system comprises the following steps: receiving a creation instruction, and creating a target and a volume mapping according to the creation instruction; sending the relevant information corresponding to the target and the volume mapping to the tgtd service through inter-process communication; and saving the relevant information corresponding to the incoming target and the volume mapping in the map by using the tgtd service so as to directly acquire data from the map when an access request is received. Therefore, after the target and the volume mapping are created, the relevant information corresponding to the target and the volume mapping is stored in the map, and other modules can directly access the map to acquire the required data, so that the updating and accessing efficiency is effectively improved, and the problem of performance reduction caused by large magnitude of the target and the volume mapping is solved.
The application also discloses a performance optimization system of the distributed storage system, an electronic device and a computer readable storage medium, which can also achieve the technical effects.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 and fig. 2 are flowcharts illustrating a performance optimization method for a distributed storage system according to an embodiment of the present application;
fig. 3 and 4 are flowcharts illustrating another method for optimizing the performance of a distributed storage system according to an embodiment of the present disclosure;
FIG. 5 is a block diagram of another distributed storage system performance optimization system disclosed in an embodiment of the present application;
fig. 6 is a block diagram of an electronic device disclosed in an embodiment of the present application;
fig. 7 is a block diagram of another electronic device disclosed in the embodiments of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In the conventional TGT architecture, after a tgtadm command line executes a create command, corresponding target and volume mapping information is stored in a corresponding structure type bidirectional linked list, and when other modules need to use the target and volume mapping information, corresponding information is acquired by traversing the linked list. However, under such an architecture, other modules may frequently traverse the linked list, and when the number of targets or the number of volume mappings reaches an order of 10000 or higher, the operation of traversing the linked list may have a large impact on performance, which significantly increases the time consumption.
Therefore, the embodiment of the application discloses a performance optimization method for a distributed storage system, which effectively improves the updating and accessing efficiency and solves the problem of performance reduction caused by large target and volume mapping magnitude.
Referring to fig. 1 and fig. 2, a method for optimizing performance of a distributed storage system disclosed in an embodiment of the present application includes:
s101: receiving a creation instruction, and creating a target and a volume mapping according to the creation instruction;
in this embodiment of the present application, the tgtadm end receives a creation instruction for a target and a volume map, and executes a creation operation according to an instruction of the creation instruction, where the volume map is specifically a map of a block storage device.
As a preferred implementation manner, when receiving a creation instruction and creating a target and a volume map according to the creation instruction, in the embodiment of the present application, creation information corresponding to the creation instruction may be specifically stored in a memory. That is, when the volume map is created, the volume is not opened temporarily, and the corresponding thread is not created, only the creation information is stored in the memory, and after an access request for the volume map is subsequently received, the volume corresponding to the volume map is opened, and the corresponding target thread is created at the same time, and the target thread is used to search the required creation information in the memory, so that the access request can be responded according to the creation information, and the information required by the access request can be returned. By only storing the creation information without executing the creation operation for a while, the performance of the storage system can be further optimized, the pressure of the storage system is reduced, and the problem of insufficient memory when the magnitude is larger is avoided.
S102: sending the relevant information corresponding to the target and the volume mapping to the tgtd service through inter-process communication;
in this step, the tgtadm end sends the relevant information corresponding to the target and the volume mapping to the tgtd service by using an inter-process communication mode. Inter-process Communication (IPC) is used to propagate or exchange information between different processes. After the tgtd service is started, an unix socket is initialized, and is specifically a special file used for interprocess communication of the same host, and the application layer data is only copied from one process to another process without passing through a network protocol stack, packing and unpacking, calculating a checksum, maintaining a serial number response and the like. And when the subsequent tgtadm end executes one tgtadm command, the unix socket is used for communicating with the tgtd service. Specifically, when a tgtadm command is input after the command, a request will be initiated to the tgtd service through the unix socket.
S103: and saving the relevant information corresponding to the incoming target and the volume mapping in the map by using the tgtd service so as to directly acquire data from the map when an access request is received.
In a specific implementation, after acquiring the relevant information corresponding to the target and the volume map through inter-process communication, the tgtd service may store the relevant information in the map. When an access request for a target or volume map is subsequently received, the map may be accessed directly in response to the access request. It can be understood that map is a set of double-row data storing keys and values, and different from the traversal lookup process of the linked list, when map is accessed, the access efficiency can be obviously improved.
In a possible implementation manner, after the target and the volume map are created according to the creation instruction, the embodiment of the present application may further persistently store the configuration information for creating the target and the volume map into the database. When the client logs in, the corresponding configuration information can be searched and loaded from the database according to the configuration requirement of the client or the user-defined requirement. In the conventional technology, configuration information used for creating a target and a volume map is usually stored in a configuration file, and a client directly loads the configuration file when logging in, that is, loads all configuration information, which may include some unnecessary configuration information, resulting in waste of memory. Therefore, the configuration information can be acquired as required when the client logs in, and the occupation of the memory is effectively saved.
According to the scheme, the performance optimization method of the distributed storage system comprises the following steps: receiving a creation instruction, and creating a target and a volume mapping according to the creation instruction; sending the relevant information corresponding to the target and the volume mapping to the tgtd service through inter-process communication; and saving the relevant information corresponding to the incoming target and the volume mapping in the map by using the tgtd service so as to directly acquire data from the map when an access request is received. Therefore, after the target and the volume mapping are created, the relevant information corresponding to the target and the volume mapping is stored in the map, and other modules can directly access the map to acquire the required data, so that the updating and accessing efficiency is effectively improved, and the problem of performance reduction caused by large magnitude of the target and the volume mapping is solved.
The embodiment of the present application discloses another performance optimization method for a distributed storage system, and, with respect to the previous embodiment, this embodiment describes a deletion process of a target and a volume map. Referring to fig. 3 and 4, specifically:
s201: receiving a deletion instruction, and sending the deletion instruction to the tgtd service through interprocess communication;
s202: determining a target or a target volume mapping corresponding to the deletion instruction by using the tgtd service;
s203: if the deleting instruction corresponds to the target volume mapping, judging whether the volume corresponding to the target volume mapping is closed or not; if not, go to step S204; if yes, go to step S205;
s204: deleting the target volume mapping after the volume is closed;
s205: directly deleting the target volume mapping;
s206: and if the deleting instruction corresponds to the target, performing clearing operation on all volume mappings under the target.
In the embodiment of the application, a tgtadm end is used for receiving a deletion instruction aiming at a target or a volume mapping, and the deletion instruction is sent to a tgtd service in an inter-process communication mode. the tgtd service will further determine the target or target volume mapping corresponding to the delete command. If the deleting instruction corresponds to the target volume mapping, namely the deleting instruction is an instruction for deleting the target volume mapping, before deleting the target volume mapping, firstly judging whether the volume corresponding to the target volume mapping is closed; if the target volume is closed, the target volume mapping can be directly deleted; if not, closing the volume, and after closing, executing a deleting operation aiming at the target volume mapping; and if the deletion command corresponds to the target, namely the deletion command is a command for deleting the target, clearing all volume maps under the target.
It can be understood that, in the embodiment of the present application, after the target or the target volume mapping is deleted according to the deletion instruction, the configuration information of the deleted target or the target volume mapping may be further deleted from the database, so as to implement the release of the memory in time.
In the following, a performance optimization system of a distributed storage system provided in an embodiment of the present application is introduced, and a performance optimization system of a distributed storage system described below and a performance optimization method of a distributed storage system described above may be referred to each other.
Referring to fig. 5, a system for optimizing performance of a distributed storage system according to an embodiment of the present application includes:
a creating module 301, configured to receive a creating instruction, and create a target and a volume map according to the creating instruction;
a sending module 302, configured to send, through inter-process communication, the relevant information corresponding to the target and the volume map to a tgtd service;
a saving module 303, configured to save, by using the tgtd service, the incoming target and the relevant information corresponding to the volume map in the map, so as to obtain data from the map directly when an access request is received.
For the specific implementation process of the modules 301 to 303, reference may be made to the corresponding content disclosed in the foregoing embodiments, and details are not repeated here.
On the basis of the foregoing embodiment, as a preferred implementation, the creating module includes:
and the information storage unit is used for storing the creating information corresponding to the creating instruction in the memory after receiving the creating instruction.
On the basis of the foregoing embodiment, as a preferred implementation, the system for optimizing performance of a distributed storage system may further include:
a thread creating module, configured to, after storing creating information corresponding to the creating instruction in a memory, open a volume corresponding to the volume map and create a corresponding target thread when receiving an access request for the volume map;
and the request response module is used for searching the creation information in the memory by using the target thread and responding to the access request according to the creation information.
On the basis of the foregoing embodiment, as a preferred implementation, the system for optimizing performance of a distributed storage system may further include:
and the information storage module is used for persistently storing the configuration information for creating the target and the volume mapping into a database after the target and the volume mapping are created according to the creation instruction.
On the basis of the foregoing embodiment, as a preferred implementation, the system for optimizing performance of a distributed storage system may further include:
and the information loading module is used for searching and loading the corresponding configuration information from the database according to the configuration requirement of the client or the user-defined requirement when the client logs in after the configuration information used for creating the target and the volume mapping is persistently stored in the database.
On the basis of the foregoing embodiment, as a preferred implementation, the system for optimizing performance of a distributed storage system may further include:
the instruction receiving module is used for receiving a deleting instruction and sending the deleting instruction to the tgtd service through interprocess communication;
a target determining module, configured to determine, by using the tgtd service, a target or a target volume mapping corresponding to the delete instruction;
the mapping clearing module is used for clearing all volume mappings under the target if the deleting instruction corresponds to the target;
a closing judgment module, configured to judge whether a volume corresponding to the target volume mapping is closed if the deletion instruction corresponds to the target volume mapping; if not, entering the working process of the mapping deletion module;
and the mapping deleting module is used for deleting the target volume mapping after the volume is closed.
On the basis of the foregoing embodiment, as a preferred implementation, the system for optimizing performance of a distributed storage system may further include:
and the information deleting module is used for deleting the deleted target or the configuration information mapped by the target volume from the database.
The present application further provides an electronic device, and as shown in fig. 6, an electronic device provided in an embodiment of the present application includes:
a memory 100 for storing a computer program;
the processor 200, when executing the computer program, may implement the steps provided by the above embodiments.
Specifically, the memory 100 includes a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and computer-readable instructions, and the internal memory provides an environment for the operating system and the computer-readable instructions in the non-volatile storage medium to run. The processor 200 may be a Central Processing Unit (CPU), a controller, a microcontroller, a microprocessor or other data processing chip in some embodiments, and provides computing and controlling capability for the electronic device, and when executing the computer program stored in the memory 100, the steps of the method for optimizing the performance of the distributed storage system provided in any of the foregoing embodiments may be implemented.
On the basis of the above embodiment, as a preferred implementation, referring to fig. 7, the electronic device further includes:
and an input interface 300 connected to the processor 200, for acquiring computer programs, parameters and instructions imported from the outside, and storing the computer programs, parameters and instructions into the memory 100 under the control of the processor 200. The input interface 300 may be connected to an input device for receiving parameters or instructions manually input by a user. The input device may be a touch layer covered on a display screen, or a button, a track ball or a touch pad arranged on a terminal shell, or a keyboard, a touch pad or a mouse, etc.
And a display unit 400 connected to the processor 200 for displaying data processed by the processor 200 and for displaying a visualized user interface. The display unit 400 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch panel, or the like.
And a network port 500 connected to the processor 200 for performing communication connection with each external terminal device. The communication technology adopted by the communication connection can be a wired communication technology or a wireless communication technology, such as a mobile high definition link (MHL) technology, a Universal Serial Bus (USB), a High Definition Multimedia Interface (HDMI), a wireless fidelity (WiFi), a bluetooth communication technology, a low power consumption bluetooth communication technology, an ieee802.11 s-based communication technology, and the like.
While fig. 7 shows only an electronic device having the assembly 100 and 500, those skilled in the art will appreciate that the configuration shown in fig. 7 is not intended to be limiting of electronic devices and may include fewer or more components than those shown, or some components may be combined, or a different arrangement of components.
The present application also provides a computer-readable storage medium, which may include: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk. The storage medium has a computer program stored thereon, and the computer program, when executed by a processor, implements the steps of the distributed storage system performance optimization method provided by any of the embodiments.
According to the method and the device, after the target and the volume mapping are created, the relevant information corresponding to the target and the volume mapping is stored in the map, other modules can directly access the map to obtain the required data, the updating efficiency and the access efficiency are effectively improved, and the problem of performance reduction caused by large magnitude of the target and the volume mapping is solved.
The embodiments are described in a progressive manner in the specification, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description. It should be noted that, for those skilled in the art, it is possible to make several improvements and modifications to the present application without departing from the principle of the present application, and such improvements and modifications also fall within the scope of the claims of the present application.
It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.

Claims (10)

1. A method for optimizing performance of a distributed storage system, comprising:
receiving a creation instruction, and creating a target and a volume mapping according to the creation instruction;
sending the relevant information corresponding to the target and the volume mapping to the tgtd service through inter-process communication;
and saving the relevant information corresponding to the incoming target and the volume mapping in the map by using the tgtd service so as to directly acquire data from the map when an access request is received.
2. The method of claim 1, wherein the receiving a create instruction and creating a target and a volume map according to the create instruction comprises:
and after receiving the creation instruction, storing the creation information corresponding to the creation instruction in a memory.
3. The method for optimizing the performance of the distributed storage system according to claim 2, wherein after the creating information corresponding to the creating instruction is stored in the memory, the method further comprises:
after receiving an access request aiming at the volume mapping, opening the volume corresponding to the volume mapping and creating a corresponding target thread;
and searching the creation information in the memory by using the target thread, and responding to the access request according to the creation information.
4. The method of optimizing performance of a distributed storage system according to claim 1, further comprising, after creating a target and a volume map according to the create instruction:
the configuration information used to create the target and volume maps is persisted to a database.
5. The distributed storage system performance optimization method according to claim 4, further comprising, after the persistently storing configuration information used to create the target and the volume map to the database:
and when the client logs in, searching and loading corresponding configuration information from the database according to the configuration requirement of the client or the user-defined requirement.
6. The distributed storage system performance optimization method according to any one of claims 1 to 5, further comprising:
receiving a deletion instruction, and sending the deletion instruction to the tgtd service through interprocess communication;
determining a target or a target volume mapping corresponding to the deletion instruction by using the tgtd service;
if the deleting instruction corresponds to a target, clearing all volume mappings under the target;
if the deleting instruction corresponds to the target volume mapping, judging whether the volume corresponding to the target volume mapping is closed or not;
if not, deleting the target volume mapping after closing.
7. The distributed storage system performance optimization method of claim 6, further comprising:
and deleting the deleted target or the configuration information mapped by the target volume from the database.
8. A distributed storage system performance optimization system, comprising:
the creating module is used for receiving a creating instruction and creating a target and a volume mapping according to the creating instruction;
a sending module, configured to send, through inter-process communication, the target and relevant information corresponding to the volume mapping to a tgtd service;
and the storage module is used for storing the incoming target and the relevant information corresponding to the volume mapping in the map by using the tgtd service so as to directly acquire data from the map when an access request is received.
9. An electronic device, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the method for performance optimization of a distributed storage system according to any one of claims 1 to 7 when executing said computer program.
10. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method for optimizing the performance of a distributed storage system according to any one of claims 1 to 7.
CN202010062154.9A 2020-01-20 2020-01-20 Distributed storage system performance optimization method, system, electronic device and medium Active CN111273869B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010062154.9A CN111273869B (en) 2020-01-20 2020-01-20 Distributed storage system performance optimization method, system, electronic device and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010062154.9A CN111273869B (en) 2020-01-20 2020-01-20 Distributed storage system performance optimization method, system, electronic device and medium

Publications (2)

Publication Number Publication Date
CN111273869A true CN111273869A (en) 2020-06-12
CN111273869B CN111273869B (en) 2022-07-22

Family

ID=71001794

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010062154.9A Active CN111273869B (en) 2020-01-20 2020-01-20 Distributed storage system performance optimization method, system, electronic device and medium

Country Status (1)

Country Link
CN (1) CN111273869B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111724262A (en) * 2020-06-24 2020-09-29 上海金仕达软件科技有限公司 Follow-up packet query system of application server and working method thereof
CN111880742A (en) * 2020-07-29 2020-11-03 北京浪潮数据技术有限公司 Distributed storage volume creation method, system, device and computer medium
CN112269539A (en) * 2020-10-16 2021-01-26 苏州浪潮智能科技有限公司 Volume mapping method and device of distributed block storage system based on iSCSI
CN112395264A (en) * 2020-11-26 2021-02-23 深圳市杉岩数据技术有限公司 Processing method for mapping between logical target and volume in distributed storage system
CN112463322A (en) * 2020-11-24 2021-03-09 苏州浪潮智能科技有限公司 Method for controlling request in distributed system and related equipment

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107277131A (en) * 2017-06-15 2017-10-20 深圳市云舒网络技术有限公司 TGT method for optimizing stability in a kind of distributed memory system
CN109672714A (en) * 2017-10-17 2019-04-23 中移(苏州)软件技术有限公司 A kind of data processing method and distributed memory system of distributed memory system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107277131A (en) * 2017-06-15 2017-10-20 深圳市云舒网络技术有限公司 TGT method for optimizing stability in a kind of distributed memory system
CN109672714A (en) * 2017-10-17 2019-04-23 中移(苏州)软件技术有限公司 A kind of data processing method and distributed memory system of distributed memory system

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111724262A (en) * 2020-06-24 2020-09-29 上海金仕达软件科技有限公司 Follow-up packet query system of application server and working method thereof
CN111724262B (en) * 2020-06-24 2024-03-22 上海金仕达软件科技股份有限公司 Subsequent package query system of application server and working method thereof
CN111880742A (en) * 2020-07-29 2020-11-03 北京浪潮数据技术有限公司 Distributed storage volume creation method, system, device and computer medium
CN111880742B (en) * 2020-07-29 2022-06-17 北京浪潮数据技术有限公司 Distributed storage volume creation method, system, device and computer medium
CN112269539A (en) * 2020-10-16 2021-01-26 苏州浪潮智能科技有限公司 Volume mapping method and device of distributed block storage system based on iSCSI
CN112269539B (en) * 2020-10-16 2022-07-08 苏州浪潮智能科技有限公司 Volume mapping method and device of distributed block storage system based on iSCSI
CN112463322A (en) * 2020-11-24 2021-03-09 苏州浪潮智能科技有限公司 Method for controlling request in distributed system and related equipment
CN112463322B (en) * 2020-11-24 2022-12-27 苏州浪潮智能科技有限公司 Method and related equipment for controlling requests in distributed system
CN112395264A (en) * 2020-11-26 2021-02-23 深圳市杉岩数据技术有限公司 Processing method for mapping between logical target and volume in distributed storage system
CN112395264B (en) * 2020-11-26 2024-05-28 深圳市杉岩数据技术有限公司 Processing method for mapping between logical targets and volumes in distributed storage system

Also Published As

Publication number Publication date
CN111273869B (en) 2022-07-22

Similar Documents

Publication Publication Date Title
CN111273869B (en) Distributed storage system performance optimization method, system, electronic device and medium
US9720952B2 (en) Virtual block devices
CN112765271B (en) Block chain transaction index storage method and device, computer equipment and medium
CN111355721B (en) Access control method, device, equipment and system and storage medium
US11275615B2 (en) Data processing offload using in-storage code execution
CN109213699B (en) Metadata management method, system, equipment and computer readable storage medium
CN107229415B (en) Data writing method, data reading method, related equipment and system
CN111625191A (en) Data reading and writing method and device, electronic equipment and storage medium
US11151052B2 (en) Reading sequential data from memory using a pivot table
CN109597640B (en) Account management method, device, equipment and medium for application program
JP2021089704A (en) Method, apparatus, electronic device, readable storage medium, and computer program for data query
US20200218646A1 (en) System and method of fpga-executed flash translation layer in multiple solid state drives
CN112269659A (en) Resource management method, system, electronic equipment and storage medium
CN113438184B (en) Network card queue management method and device and electronic equipment
CN111078410A (en) Memory allocation method and device, storage medium and electronic equipment
EP4095686A2 (en) Method for switching skin of mini-program page, and electronic device
WO2021012795A1 (en) Network node scheduling method and apparatus, electronic device and storage medium
US8549274B2 (en) Distributive cache accessing device and method for accelerating to boot remote diskless computers
US10628078B2 (en) Data access method and related device
WO2024124833A1 (en) Calculation function construction method, calculation engine, electronic device and readable storage medium
US8892613B1 (en) Method and system for efficiently reading a partitioned directory incident to a serialized process
US20040267967A1 (en) Method, system, and program for managing requests to a network adaptor
CN111752682A (en) Network port resource management method and device, electronic equipment and storage medium
CN111897484A (en) Data storage method and device, electronic equipment and storage medium
US12124877B2 (en) Coordinating execution of computing operations for software applications

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant