Online capacity expansion IO scheduling method based on hot data and repeated operation deletion

A technique of repeated operations and scheduling methods, applied in the input/output process of data processing, electrical digital data processing, instruments, etc., can solve the problems of seldom considering the impact of user access behavior, reduced capacity expansion efficiency of capacity expansion scheme, and large impact of capacity expansion process, etc. problem, to achieve fast user response time, reduce write request operations, and reduce resource contention

Active Publication Date: 2021-09-17
QINGHAI NORMAL UNIV
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the process of storage cluster data expansion, the existing expansion schemes mainly consider how to reduce the overhead in the data migration process when designing, and seldom consider the impact of user access behavior on expansion
[0003] However, the user's access behavior has a great impact on the expansion process
First, intensive access behavior will increase the load on the disk; second, the contention of user access requests and migration requests on the disk head will cause a large number of random reads and writes; third, user access requests and migration requests are repeated. Write operation of data block
These reasons will lead to a reduction in the expansion efficiency of the online expansion scheme.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Online capacity expansion IO scheduling method based on hot data and repeated operation deletion
  • Online capacity expansion IO scheduling method based on hot data and repeated operation deletion

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] The technical solution of the present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that these embodiments are only used to illustrate the present invention and are not intended to limit the scope of the present invention. After reading the present invention, those skilled in the art Modifications to various equivalent forms of the present invention fall within the scope defined by the appended claims of the present application.

[0028] The present invention provides an online capacity expansion IO scheduling method based on hot data and deletion of duplicate operations. The method includes steps:

[0029] Initialize the storage system;

[0030] Monitor user access requests over a period of time;

[0031] When the user access request is a write operation, compare the physical address of the user access request with the destination address of the data block to be migrated, and...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an online capacity expansion IO scheduling method based on hot data and repeated operation deletion. The method comprises the following steps: initializing a storage system; monitoring a user access request within a period of time; when the user access request is a write operation, comparing a physical address of the user access request with a destination address of a data block needing to be migrated, and if the ranges of the physical address and the destination address are completely consistent, modifying the destination address of the write operation; and if the range parts of the data block to be migrated and the data block to be migrated are consistent, reading out the remaining miss data of the data block to be migrated, splicing the data into the content of the write operation, and modifying the address of the write operation into the target address of the data block to be migrated. Mutual influence between the user access request and the migration request during online capacity expansion is effectively reduced, the efficiency during online capacity expansion is improved, and the user response time is shortened.

Description

technical field [0001] The invention relates to the field of computer network and computer storage, and is mainly applied in the HS6 online expansion scheme, in particular to an online expansion IO scheduling method based on hot data and deletion of duplicate operations. Background technique [0002] With the in-depth integration and development of network technology in all walks of life in society, enterprise data center storage systems are faced with the demand for massive data storage, so the capacity of existing storage systems cannot meet the higher requirements for capacity raised by the growing data scale. In order to increase the capacity of the data center storage system, expanding the capacity space of the existing storage system is a technology that must be adopted, that is, capacity expansion technology. In the process of storage cluster data expansion, the existing expansion schemes mainly consider how to reduce the cost of data migration during design, and seld...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F3/06
CPCG06F3/0647G06F3/061G06F3/0644G06F3/064G06F3/0641
Inventor 谢平李牧原
Owner QINGHAI NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products