CN110096231A - The processing method and processing device of disk lock - Google Patents
The processing method and processing device of disk lock Download PDFInfo
- Publication number
- CN110096231A CN110096231A CN201910338564.9A CN201910338564A CN110096231A CN 110096231 A CN110096231 A CN 110096231A CN 201910338564 A CN201910338564 A CN 201910338564A CN 110096231 A CN110096231 A CN 110096231A
- Authority
- CN
- China
- Prior art keywords
- host
- disk lock
- shared
- lock
- solicited status
- 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
Links
- 238000012545 processing Methods 0.000 title claims abstract description 33
- 238000003672 processing method Methods 0.000 title claims abstract description 17
- 238000000034 method Methods 0.000 claims abstract description 31
- 238000001514 detection method Methods 0.000 claims abstract description 11
- 238000007599 discharging Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 24
- 238000004891 communication Methods 0.000 description 15
- 230000006870 function Effects 0.000 description 11
- 230000008569 process Effects 0.000 description 9
- 238000004590 computer program Methods 0.000 description 8
- 230000008901 benefit Effects 0.000 description 3
- 238000013475 authorization Methods 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 230000004888 barrier function Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007717 exclusion Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Classifications
-
- 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/176—Support for shared access to files; File sharing support
-
- 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/061—Improving I/O performance
-
- 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/0629—Configuration or reconfiguration of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/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)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application proposes a kind of processing method and processing device of disk lock, is related to shared-file system technical field.This method comprises: when the first Host Detection is to when there is network failure between the second host, according to the location information for the first disk lock that the first host in corresponding relationship is currently held, the solicited status when request of the second host locks the first disk lock corresponding shared resource is read from shared storage device, when the solicited status is not blocked state, it does not discharge the first disk lock then, i.e., the corresponding shared resource of the first disk lock is not unlocked.So, for there is no locking the shared resource of obstruction, a reading IO need to only be generated, the mode that host locks again after being unlocked to all shared resources locked that succeeded compared to the prior art, the movement for avoiding unnecessary unlock and locking again, host is greatly reduced to the read-write number of shared storage device, and then effectively increases the performance of shared-file system.
Description
Technical field
This application involves shared-file system technical fields, in particular to the processing method and dress of a kind of disk lock
It sets.
Background technique
In shared storage environment, when multiple host accesses the shared resource in shared-file system simultaneously, need specific
Locking mechanism, to prevent multiple host from carrying out write operation to shared resource simultaneously, host locks shared resource
Or unlock is realized by the rewriting operation to the corresponding disk lock of the shared resource.When locking host is to some shared resource
When the locking rank of request and the shared resource current grant incompatible to the lock rank of other hosts, the locking for locking host is asked
Asking will be blocked, and after which actively unlocks, lock host
Locking request can just continue.When the network between host is normal, disappearing for obstruction can will be locked by internet message
Breath is transmitted to authorization host from host is locked, and when the network failure between host, then can not carry out above-mentioned notification action.
Current way is that host, which periodically unlocks, all licenses to the shared of oneself in detecting host network failure
Resource locks when follow-up business needs, then again；Regardless of being unlock or locking, experience is required from disk
Reading of content and the process that the content of modification is written to disk, therefore for a shared resource, if host first unlocks it
It locks again afterwards, then can generate four disk input and output (Input Output, IO), and because of the general maximum probability of the needs of business
Ground may require that and lock again, therefore host has locked the mode locked again after successful shared resource is unlocked for all,
Host can be increased significantly to the read-write number of disk, to significantly impact the performance of shared-file system.
Summary of the invention
A kind of processing method and processing device for being designed to provide disk lock of the application is set with reducing host to shared storage
Standby read-write number, improves the performance of shared-file system.
To achieve the goals above, the embodiment of the present application the technical solution adopted is as follows:
In a first aspect, the embodiment of the present application proposes a kind of processing method of disk lock, applied in shared-file system
First host, the shared-file system further include the second host in addition to first host and can be led by described first
The shared storage device that machine, second host access, the magnetic that first host record has first host currently to hold
The corresponding relationship of disk lock and location information of the disk lock currently held on the shared storage device；The method packet
It includes:
When first Host Detection is to when there is network failure between second host, according to the corresponding relationship
In the location information of the first disk lock currently held of first host, read described second from the shared storage device
Solicited status when host request locks first disk lock corresponding shared resource；
When the solicited status is not blocked state, then first disk lock is not discharged；Wherein, the blocked state
It is written when first host blocks second host to the locking of first disk lock corresponding shared resource described total
Enjoy storage equipment.
Second aspect, the embodiment of the present application also propose a kind of processing unit of disk lock, are applied in shared-file system
The first host, the shared-file system further includes the second host in addition to first host and can be by described first
The shared storage device that host, second host access, first host record have first host currently to hold
The corresponding relationship of disk lock and location information of the disk lock currently held on the shared storage device；Described device
Include:
State reading module, for there is network failure between second host when first Host Detection
When, according to the location information for the first disk lock that first host in the corresponding relationship is currently held, shared from described
Storage equipment reads solicited status when the second host request locks first disk lock corresponding shared resource；
Disk lock processing module, for when the solicited status is not blocked state, then not discharging first disk
Lock；Wherein, the blocked state is corresponding to first disk lock shared in first host obstruction, second host
The shared storage device is written when locking in resource.
Compared with the prior art, the embodiment of the present application has the advantages that
The processing method and processing device of disk lock provided by the embodiment of the present application, applied to first in shared-file system
Host, shared-file system further include the second host in addition to the first host and can be accessed by the first host, the second host
Shared storage device, disk lock that the first host record has the first host currently to hold is with the disk lock currently held shared
Store the corresponding relationship of the location information in equipment.When the first Host Detection is to when there is network failure between the second host,
According to the location information for the first disk lock that the first host in corresponding relationship is currently held, second is read from shared storage device
Solicited status when host request locks the first disk lock corresponding shared resource, when the solicited status is not blocked state
When, then the first disk lock is not discharged, wherein the blocked state is corresponding to the first disk lock in the first host the second host of obstruction
Shared storage device is written when locking in shared resource.Since the first host is asked according to from shared storage device the second host of reading
Solicited status when locking is sought to judge whether the first host blocks the second host and lock to shared resource, if the solicited status table
When bright first host does not block the second host to the locking of disk lock corresponding shared resource, the first host does not discharge the disk lock,
The corresponding shared resource of the disk lock is not unlocked.In this way, only needing to generate for there is no locking the shared resource of obstruction
One reading IO, host is to all sides for having locked and having locked again after successful shared resource is unlocked compared to the prior art
Formula avoids unnecessary unlock and the movement that locks again, greatly reduces host to the read-write number of shared storage device,
And then effectively increase the performance of shared-file system.
Other feature and advantage of the application will be illustrated in subsequent specification, also, partly be become from specification
It is clear that by implementing the application understanding.The purpose of the application and other advantages can be by written specifications, power
Specifically noted structure is achieved and obtained in sharp claim and attached drawing.
Detailed description of the invention
In order to illustrate more clearly of the technical solution of the application, letter will be made to attached drawing needed in the embodiment below
It singly introduces, it should be understood that the following drawings illustrates only some embodiments of the application, therefore is not construed as to range
It limits, it for those of ordinary skill in the art, without creative efforts, can also be according to these attached drawings
Obtain other relevant attached drawings.
Fig. 1 shows the application environment schematic diagram of the processing method and processing device of disk lock provided by the embodiment of the present application.
Fig. 2 shows the flow diagrams of the processing method of disk lock provided by the embodiment of the present application.
Fig. 3 shows the corresponding relationship of the location information of the memory object and disk lock of disk lock on shared storage device
A kind of schematic diagram.
Fig. 4 shows the corresponding relationship of the location information of the memory object and disk lock of disk lock on shared storage device
Another schematic diagram.
Fig. 5 shows host and requests a kind of schematic diagram locked to shared resource.
Fig. 6 shows host and requests another schematic diagram locked to shared resource.
Fig. 7 shows the functional block diagram of the processing unit of disk lock provided by the embodiment of the present application.
Fig. 8 shows a kind of structural block diagram of the host in Fig. 1.
Icon: the processing unit of 500- disk lock；510- state reading module；520- blocks judgment module；530- disk
Lock processing module；610- memory；620- processor；630- communication interface.
Specific embodiment
Below in conjunction with attached drawing in the application, the technical solution in the application is clearly and completely described, it is clear that
Described embodiments are only a part of embodiments of the present application, instead of all the embodiments.Usually retouched in attached drawing here
The component for the application for stating and showing can be arranged and be designed with a variety of different configurations.Therefore, below to mentioning in the accompanying drawings
The detailed description of the embodiments herein of confession is not intended to limit claimed scope of the present application, but is merely representative of this
The selected embodiment of application.Based on embodiments herein, those skilled in the art are in the premise for not making creative work
Under every other embodiment obtained, shall fall in the protection scope of this application.
It should also be noted that similar label and letter indicate similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined in a attached drawing, does not then need that it is further defined and explained in subsequent attached drawing.
The processing method and processing device of disk lock provided by the embodiment of the present application can be applied to shared file shown in FIG. 1
In system.Fig. 1 is please referred to, which may include shared storage device and multiple main frames (for example, host 1, host
2 ..., host N), multiple main frames are connect to realize being in communication with each other between multiple main frames with interchanger, and multiple main frames are also together
Storage equipment communication connection is enjoyed to realize access of each host to shared storage device.
In the present embodiment, it is adopted between the communication network and host and shared storage device used between multiple host
Communication network is different.For example, being communicated between multiple host using A network, between host and shared storage device
It is communicated using B network.
It can store multiple shared resources on the shared storage device, need to be each shared money when creating shared resource
Corresponding disk lock is distributed in source, and the host for only holding disk lock just possesses the access right of the corresponding shared resource of the disk lock
Limit.For each host in shared-file system, all disk locks held are maintained in shared storage device, the magnetic
Disk locks the memory space that a certain size is corresponded on shared storage device, for the related data of storage disk lock, for example, the magnetic
Disk, which is locked corresponding shared resource and licensed to, have been held the lock rank of the host of the disk lock, has locked successfully master to shared resource
The information such as the solicited status when identification information of machine and locking host request lock shared resource.
When host locks successfully some shared resource, then can record on the corresponding disk lock of the shared resource should add
Lock successful host identification information and the shared resource current grant to the host lock rank (i.e. the host hold plus
Lock rank)；Meanwhile the disk lock and the disk lock can be also recorded in host in the memory of oneself on shared storage device
The corresponding relationship of location information.When the locking rank and the shared resource current grant that host is requested to some shared resource are to
Hold the host of the disk lock lock rank it is incompatible when, the locking request of the host will be blocked, then the host can be in the magnetic
Blocked state is written in disk lock.
In the present embodiment, each host can be detected between other hosts using preset keepalive mechanism
Whether communication network can be used.I.e. each host periodically can send keep-alive message by other hosts into shared-file system
(such as: heartbeat message), the keep-alive message is for informing other hosts oneself " online ", while other hosts are also respectively to the master
Machine sends keep-alive message.When the host can receive the keep-alive message that every other host is sent, then can determine that host it
Between communication network it is normal；When the host cannot receive the keep-alive message of at least one host in other hosts, then may be used
Determine that the communication network between host breaks down.When the communication network between host is normal, it can lead between host
It crosses A network and sends locking Blocking message, to require the host for holding disk lock to be unlocked shared resource；When some host is examined
When measuring with there is network failure between other hosts, which can access shared storage device by B network, with from shared
The related data for the disk lock that the host is held is read in storage equipment, and judges whether to occur to lock obstruction.Below with reference to attached
Figure and specific embodiment are further described in detail the application.
It referring to figure 2., is the flow diagram of the processing method of disk lock provided by the embodiment of the present application.It needs to illustrate
, the processing method of the disk lock of the embodiment of the present application is not limitation with Fig. 2 and specific order below, should be managed
Solution, in other embodiments, the sequence of the processing method part step of the disk lock of the application can be according to actual needs
It is exchanged with each other or part steps therein also can be omitted or delete.The executing subject of this method can be shown in FIG. 1
One host comprising following steps:
Step S101, when the first Host Detection is to when there is network failure between the second host, according in corresponding relationship
The location information of the first disk lock currently held of the first host, read the request of the second host to first from shared storage device
Solicited status when the corresponding shared resource of disk lock locks.
In the present embodiment, the first host can be any one host shown in FIG. 1, and the second host can be Fig. 1 institute
In the multiple main frames shown in addition to the first host host (for example, host 2, host 3 ... or host N)；First disk lock can
With any one disk lock being interpreted as in the disk lock that the first host is currently held.
For example, it is assumed that host 1 shown in FIG. 1 is the first host, when host 1 detects the communication network between the second host
When network is unavailable, it is determined that network failure occur, the position of the first disk lock in corresponding relationship just recorded according to host 1 is believed
It is corresponding to first disk lock shared to read the request of the second host from the first disk lock saved on shared storage device for breath
Solicited status when resource locks.
It should be noted that in the present embodiment, occurring the second host of network failure and request between the first host
The second host locked to the corresponding shared resource of first disk lock may be the same or different, and the application does not do this
Limitation.In other words, when host 1, which is detected, network failure occurs between host 2, the request read from the first disk lock
State may be solicited status when host 2 is requested to the locking of first disk lock corresponding shared resource, it is also possible to host
3, host 4 ... or host N to the corresponding shared resource of first disk lock lock when solicited status.
In the present embodiment, the location information of disk lock can use logical block addresses (LogicalBlock
Address, LBA) it indicates, position or address of the disk lock on shared storage device can be determined by LBA.First master
The disk lock that machine is currently held is with the location information of the disk lock currently held in the corresponding relationship of the first host record
Key assignments, the first host traverse corresponding relationship according to preset key assignments ordering rule, and according to the first disk lock in corresponding relationship
Key assignments from shared storage device read the second host request to the corresponding shared resource of the first disk lock lock when request shape
State.
It should be appreciated that the disk lock recorded in the corresponding relationship is not equivalent to the disk saved on shared storage device
Lock, but abstract rear obtained object is carried out to the disk lock saved on shared storage device and (is known as disk in the present embodiment
The memory object of lock).As an implementation, the position of the memory object of disk lock and disk lock on shared storage device
The corresponding relationship of information can be established in the memory of each host according to the form of red black tree, so that host sequence issues request
State reads instruction, realizes the efficient inquiry of solicited status.Specifically, when a host is wanted to lock for some shared resource
When, first using LBA as key assignments, searches and whether contained the corresponding disk lock of the shared resource in current red black tree
The memory object of the disk lock if it is not, creating the memory object of the disk lock, and is inserted into red black tree by memory object
In.Wherein, record has the title of disk lock, host to add the corresponding shared resource of the disk lock in the memory object of the disk lock
The information such as the locking state (for example, " locking ", " successfully locking ", " request locks ") of lock.Host is creating the disk lock
Memory object when, the locking state in the memory object of the disk lock can be recorded as to " locking " or " request lock ",
Show that the disk lock is that host wants the disk lock held, it, can be in disk lock after host successfully locks shared resource
It deposits in object and locking state is changed to " successfully locking " by " locking " or " request locks ", show the disk lock for host
The disk lock held.
It is appreciated that not only including that the host is current in corresponding relationship of each host according to the form foundation of red black tree
The memory object for the disk lock held can also include that the host disk lock that want to hold (i.e. want to lock but also not by host
Lock the corresponding disk lock of successful shared resource) memory object.Therefore, when the first host is with preset key assignments ordering rule
It is main for the memory object for the disk lock that the first host in the corresponding relationship is currently held, first when traversing the corresponding relationship
Machine can read the solicited status when request of the second host locks shared resource according to its key assignments from shared storage device；
The memory object that the disk lock held is wanted for the first host in the corresponding relationship, because the first host does not hold the disk also
It locks (i.e. the authorization that the first host does not obtain the shared resource also), therefore does not need to read from the disk lock that shared storage device saves
The solicited status when request of the second host being taken to lock shared resource.
As shown in figure 3, a kind of schematic diagram of corresponding relationship is established according to the form of red black tree for the first host.In the correspondence
In relationship, the memory object or the first host for the disk lock that each node is used to indicate that the first host is currently held are wanted to hold
Disk lock memory object, and the key assignments of each node is the disk lock currently held of the first host on shared storage device
Location information on shared storage device of location information or the first host disk lock for wanting to hold.For example, node T1
Key assignments LBA=103, the key assignments LBA=of the key assignments LBA=105 of the key assignments LBA=101 of node T2, node T3, node T4
The key assignments LBA=106 of the key assignments LBA=104 of the key assignments LBA=102 of 100, node T5, node T6, node T7.
Since red black tree meets the feature of binary search tree, i.e., the key assignments of any node is centainly greater than every in its left subtree
The key assignments of one node, and it is less than the key assignments of each node in its right subtree.It is for location information when the first host is desired
When the corresponding shared resource of the disk lock of " 99 " locks, then first using LBA=99 as key assignments, find not wrap in current red black tree
Memory object containing the disk lock needs to create the memory object of the disk lock at this time, due to LBA=99 < LBA=100, therefore will
The memory object of the disk lock is inserted into the left child node of current red black tree interior joint T4.As shown in figure 4, node T8 is new inserts
Enter the memory object of the disk lock into red black tree, the key assignments LBA=99 of node T8.
If the first Host Detection network failure occurs between the second host at this time, start the dynamic of inquiry request state
Make, i.e., traverses corresponding relationship shown in Fig. 4 according to the ordering rule of key assignments from small to large.First host accessed node T8 first,
And read out the corresponding locking state of node T8, it is found that the locking state is " locking ", shows that the first host is right
The corresponding shared resource of node T8 locks, and the first host does not hold the corresponding disk lock of node T8 also, does not need to deposit from shared
Store up equipment read requests state, start access next node T4, if the T4 node read out correspond to locking state for " successfully plus
Lock " shows that the corresponding disk lock of T4 node is the disk lock that the first host has been held, then the first host is read from shared storage device
The corresponding solicited status of node T4 is taken, then successively accessed node T2, T5, T1, T6, T3, T7.
In this way, the first host according to key assignments ordering rule from small to large successively accessed node T8, T4, T2, T5, T1, T6,
T3, T7, and the corresponding solicited status of each node is read from shared storage device, it is sent out to greatly facilitate the first host sequence
It send the reading of solicited status to instruct, and traverses corresponding relationship according to key assignments ascending order, it is possible to refer to the reading of multiple solicited status
A bigger reading instruction is merged into order, to improve the reading performance of solicited status, realizes the efficient inquiry of solicited status.Example
Such as, the first host needs to send two solicited status and reads instruction, each solicited status read instruction and include reading position and
Reading length, wherein it is 100 that first solicited status, which reads the reading position in instruction, and reading length is 512 bytes, the
It is 101 that two solicited status, which read the reading position in instruction, and reading length is 512 bytes, because the two solicited status are read
Reading position in instruction is continuous (i.e. 100,101), then it is one that the two solicited status can be read to instruction folding
Bigger reading instruction, the reading position in reading instruction after merging are 100, and reading length is 1024 bytes, and first is main at this time
Machine need to only issue a reading instruction (reading instruction i.e. after the merging), can be obtained first solicited status and read instruction and second
A solicited status, which is read, instructs corresponding data.
It should be noted that above-mentioned preset key assignments ordering rule can be the sequence according to key assignments from small to large, may be used also
To be the sequence according to key assignments from big to small, the application is without limitation.
It should also be noted that, the memory object by disk lock that the application proposes is established according to the form of red black tree and is corresponded to
Relationship is only a kind of example, and in practical applications, the memory object of the disk lock can also carry out tissue using other forms,
In order to realize the efficient lookup of data.
Optionally, which has corresponding state storage area, state storage on shared storage device
Region is associated with the location information of first disk lock, and the state storage area is for storing the solicited status.First host root
According to corresponding relationship in shared storage device the determining associated state storage area of location information with the first disk lock, and from shape
State storage region reads the solicited status when request of the second host locks the first disk lock corresponding shared resource.
For example, it is assumed that the memory space of each disk lock corresponding 512 bytes on shared storage device, then can pass through
The memory space of 512 bytes has held the lock rank of the host of the disk lock, to altogether to store shared resource and license to
Resource is enjoyed to lock the identification information of successful host and lock the letters such as solicited status when host request locks shared resource
Breath.In one example, 1~100 byte that can be set in 512 bytes has held this for storing shared resource and licensing to
The lock rank of the host of disk lock, setting 101 bytes~400 bytes lock successful host to shared resource for storing
Identification information for storing solicited status, and is set using 401 bytes~512 bytes as the state storage area of the disk lock
In disk lock initialization, the solicited status of state storage area storage is preset value.
When it is subsequent have the second host request to the corresponding shared resource of the disk lock lock when, the second host firstly the need of from
The shared resource current grant is read in the disk lock to the lock rank for the host for having held the disk lock, when the second host is wanted
The locking rank requested to the shared resource and the shared resource current grant give the lock rank for having held the host of the disk lock
When incompatible, then the locking request of second host is blocked, and the second host rewrites the preset value in the state storage area
For the identification information of second host.Wherein, the preset value can be understood as disk lock initialization when default value (for example,
255), which is that the second host blocks the shape that disk lock is written when the second host locks shared resource in the first host
In state storage region, the identification information can be host node number (for example, 2,3 ..., N).
In addition, if the first host does not block the second host and locks to the corresponding shared resource of disk lock, i.e. the second host energy
It is enough that successfully the corresponding shared resource of disk lock is locked, at this point, the identification information of the second host will be written into 101 byte above-mentioned
~400 bytes show that the second host successfully locks the corresponding shared resource of the disk lock.
In practical applications, the locking rank of shared resource generally comprises three kinds: complete mutual exclusion (EXMODE, EX), readable
Not writeable (PRMODE, PR), unlocked (NLMODE, NL), when host holds the lock of EX rank, other hosts cannot be at the same time
Access and operate corresponding shared resource；When host holds the lock of PR rank, other hosts can access simultaneously, but cannot
Modify corresponding shared resource.
As shown in figure 5, requesting a kind of schematic diagram locked to shared resource for host.Assuming that initial in the first disk lock C
After change, host M request locks the corresponding shared resource of first disk lock C, then it is shared that this is read from first disk lock C
Resource current grant gives the lock rank for having held the host of the disk lock, and host M has found the locking grade requested the shared resource
The lock rank of host of the disk lock is not compatible to having held for (EX) and the shared resource current grant, then by the mark letter of oneself
In the locking success Host List of breath write-in first disk lock C, and the current grant in the first disk lock C this is held
The lock rank of the host of disk lock is rewritten as licensing to the lock rank of host M, and host M is corresponding to first disk lock C at this time
Shared resource locks the access authority successfully possessed to the corresponding shared resource of first disk lock C.In host M to the first magnetic
After the corresponding shared resource of disk lock C locks successfully, host N request locks the shared resource and the locking rank requested is PR,
Read out from the first disk lock C first the shared resource current grant give held the disk lock host lock rank EX,
It was found that the locking rank PR and the shared resource current grant of oneself request give the lock rank EX for having held the host of the disk lock
Incompatible, the locking request of host N is blocked, mark of the host N to the state storage area of first disk lock C write-in host N
Know information.
As shown in fig. 6, requesting another schematic diagram locked to shared resource for host.When host M is to the first disk lock C
Corresponding shared resource locks successfully, and the shared resource current grant to host M lock rank be PR when, if host N request
The shared resource is locked and the locking rank requested also is PR, then host N request the shared resource locking rank PR and
The shared resource current grant is compatible to the lock rank PR of host M, and first magnetic is written in the identification information of oneself by host N at this time
Disk is locked in the locking success Host List of C.
In the present embodiment, in order to improve the efficiency of the first Host read state, the first host is with the side of asynchronous IO
Formula reads the solicited status when request of the second host locks the first disk lock corresponding shared resource from shared storage device.
Step S102 judges whether solicited status is blocked state according to the solicited status read.
In the present embodiment, the solicited status can by preset value or shared-file system in addition to the first host
The identification informations of other hosts characterized.Wherein, which is not blocked state for characterizing the solicited status, the mark
Knowing information for characterizing the solicited status is blocked state.
It if the solicited status that the first host is read is preset value, can determine that the solicited status is not blocked state, execute
Step S103；If the solicited status that the first host is read is the identification information of the second host, it can be determined that the solicited status is
Blocked state executes step S104.
Still by taking Fig. 5 and the first disk lock C shown in fig. 6 as an example, it is assumed that host M is the first host, and host M is detecting net
After network failure, corresponding relationship, and the read requests state since the smallest disk lock of key assignments are traversed.When host M traverses first
When disk lock C, according to key assignments of the first disk lock C in corresponding relationship, determine first disk lock C on shared storage device
Position, and then determine first disk lock C state storage area, and from the state storage area of the first disk lock C read
Solicited status out, if the identification information (referring to Fig. 5) that the solicited status is host N, determines the solicited status for blocked state；
If the solicited status is preset value " 255 " (referring to Fig. 6), determine that the solicited status is not blocked state.
Step S103 does not discharge the first disk lock then when solicited status is not blocked state；Wherein, blocked state exists
First host, which blocks when the second host locks the first disk lock corresponding shared resource, is written shared storage device.Specifically,
The corresponding memory space of the first disk lock, such as the state storage area of write-in memory space can be written by the second host.
In the present embodiment, which can be corresponded in the state storage area of memory space by the first disk lock
The information of storage indicates.When the information of storage is host identification, then it is assumed that be blocked state, when the information of storage is preset value
When, then it is assumed that blocked state is not present.In one example, when the second host blocks the second host to the first disk in the first host
When locking the locking of corresponding shared resource, the second host is recorded in the state storage area that the first disk lock corresponds to memory space
Identification information.
When solicited status is not blocked state, it is corresponding to the first disk lock total to show that the first host does not block the second host
Resource locking is enjoyed, the first host does not need to discharge first disk lock, and the second host can be corresponding total to first disk lock
It enjoys resource successfully to lock, after the second host successfully locks the corresponding shared resource of the first disk lock, the first and second host is all
It is the holder of the first disk lock.
Step S104 then discharges the first disk lock when solicited status is blocked state.
In the present embodiment, when solicited status is blocked state, show that the first host blocks the second host to the first magnetic
Disk is locked corresponding shared resource and is locked, and needs the first host to discharge first disk lock, the first host is no longer the first magnetic at this time
The holder of disk lock, the locking request of such second host can just continue.Wherein, the first host discharges first disk
Lock, is the equal of being unlocked operation to the corresponding shared resource of the first disk lock, and unlock operation can pass through CAW
(CompareAnd Write, compare and write) instruction realizes that i.e. the first host is when judging that oneself the second host of obstruction locks, to altogether
It enjoys storage equipment and sends CAW instruction, shared storage device instructs the locking by the first host on the first disk lock to believe according to CAW
Breath is deleted, for example, delete the identification information for locking the first host in successfully Host List and the shared resource current grant to
The lock rank of first host.
As it can be seen that the processing method of disk lock provided by the embodiments of the present application, be the first Host Detection to the second host
Between when there is network failure, just start the movement of inquiry request state.That is the first host is when detecting network failure, from altogether
Enjoy storage equipment in read the second host request to the corresponding shared resource of the first disk lock lock when solicited status, and according to
The solicited status judges whether first host blocks the locking of the second host, if the first host does not block the locking of the second host,
The first disk lock is not discharged；It is locked if the first host blocks the second host, discharges the first disk lock.In this way, the first host is only
Operation just need to be unlocked to the shared resource, for there is no locking when blocking the second host to shared resource locking
The shared resource of obstruction only need to generate a reading IO, reduce unlock number.And the prior art is in order to solve the net between host
When network failure, the problem of locking the message blocked can not be transmitted by internet message, host is needed periodically to unlock all award
Weigh to the shared resource of oneself, locked when follow-up business needs, then again, and the general maximum probability of business may require that weight
It is new to lock, therefore host is to all sides for having locked and having locked again after successful shared resource is unlocked compared to the prior art
Formula, the movement that the application effectively prevents unnecessary unlock and locks again, greatly reduces host to shared storage device
Read-write number, to effectively increase the performance of shared-file system.
It is further noted that a locking host will not generally block other and lock host in shared-file system
(this is that the business that shared-file system is carried determines), in other words, in practical applications, occurs the probability for locking obstruction
It is smaller, but host can't go to judge whether to occur to lock obstruction in the prior art, but when network failure, the period
All shared resources for licensing to oneself are unlocked to property, then need to lock again according to business, to further cause
The movement of unnecessary unlock and locking, also will affect the performance of shared-file system.In this application, it is locked by reading disk
On solicited status come judge first host whether block the second host to the corresponding shared resource of the disk lock lock, if should
First host does not block the second host and locks to the corresponding shared resource of the disk lock, then shared money not corresponding to the disk lock
Source carries out locking operation；The corresponding shared resource of the disk lock is locked if first host blocks the second host, to the magnetic
Disk locks corresponding shared resource and carries out locking operation, effectively prevent in the case where not occurring to lock obstruction to shared resource into
Movement row unnecessary unlock and locked again, reduces host to the read-write number of shared storage device.
Fig. 7 is please referred to, is the functional block diagram of the processing unit 500 of disk lock provided by the embodiment of the present application.
It should be noted that the technical effect of the processing unit 500 of disk lock provided by the present embodiment, basic principle and generation with
Preceding method embodiment is identical, to briefly describe, does not refer to part in the present embodiment, can refer to the phase in preceding method embodiment
Answer content.The processing unit 500 of disk lock can be applied to any one host shown in FIG. 1 comprising state reading module 510,
Block judgment module 520 and disk lock processing module 530.
The state reading module 510 is used for when the first Host Detection is to when there is network failure between the second host, root
According to the location information for the first disk lock that the first host in corresponding relationship is currently held, it is main that second is read from shared storage device
Solicited status when machine request locks the first disk lock corresponding shared resource.
Optionally, the disk lock which currently holds is in corresponding relationship with the position for the disk lock currently held
Information is key assignments, and state reading module 510 is specifically used for traversing corresponding relationship according to preset key assignments ordering rule, and according to the
Key assignments of one disk lock in corresponding relationship is corresponding to the first disk lock total from shared storage device reading the second host request
Enjoy solicited status when resource locks.
Optionally, which has corresponding state storage area, state storage on shared storage device
Region is associated with the location information of the first disk lock, and the state storage area is for storing solicited status.The state reading module
510 deposit specifically for being determined in shared storage device according to corresponding relationship with the associated state of location information of the first disk lock
Storage area domain, and the request when request of the second host locks the first disk lock corresponding shared resource is read from state storage area
State.
Optionally, which is specifically used for reading first from shared storage device in a manner of asynchronous IO
Host has locked the state of successful disk lock.
It is appreciated that the state reading module 510 can execute above-mentioned steps S101.
Optionally, which passes through other hosts in preset value or shared-file system in addition to the first host
Identification information is characterized, which is used for judging whether solicited status is resistance according to the solicited status read
Plug-like state；If solicited status is preset value, decision request state is not blocked state；If solicited status is the mark of the second host
Know information, then decision request state is blocked state.
It is appreciated that the obstruction judgment module 520 can execute above-mentioned steps S102.
The disk lock processing module 530 is used for when solicited status is not blocked state, then does not discharge the first disk lock；When
When solicited status is blocked state, then the first disk lock is discharged；Wherein, blocked state blocks the second host to the in the first host
Shared storage device is written when locking in one disk lock corresponding shared resource.Specifically, the first magnetic can be written by the second host
Disk locks corresponding memory space, such as the state storage area of write-in memory space.
It is appreciated that the disk lock processing module 530 can execute above-mentioned steps S103 and step S104.
Fig. 8 is please referred to, is a kind of structural block diagram of host shown in FIG. 1.The host may include memory 610, processing
Device 620 and communication interface 630, the memory 610, processor 620 and communication interface 630, each element between each other directly or
Ground connection is electrically connected, to realize the transmission or interaction of data.For example, these elements can pass through one or more communication between each other
Bus or signal wire, which are realized, to be electrically connected.Memory 610 can be used for storing software program and module, as the embodiment of the present application mentions
Corresponding program instruction/the module of the processing method and processing device of the disk lock of confession, processor 620 are stored in memory by executing
Software program and module in 610, thereby executing various function application and data processing.The communication interface 630 can be used for
Other node devices carry out the communication of signaling or data.
Wherein, memory 610 can be but not limited to, random access memory (Random Access Memory,
RAM), read-only memory (Read Only Memory, ROM), programmable read only memory (Programmable Read-Only
Memory, PROM), erasable read-only memory (Erasable Programmable Read-Only Memory, EPROM),
Electricallyerasable ROM (EEROM) (Electric Erasable Programmable Read-Only Memory, EEPROM) etc..
Processor 620 may be a kind of IC chip, have signal handling capacity.The processor 620 can be logical
With processor, including central processing unit (Central Processing Unit, CPU), network processing unit (Network
Processor, NP) etc.；Can also be digital signal processor (DSP)), specific integrated circuit (ASIC), ready-made programmable gate
Array (FPGA) either other programmable logic device, discrete gate or transistor logic, discrete hardware components.
It is appreciated that structure shown in Fig. 8 is only to illustrate, host may also include more or less than shown in Fig. 8
Component, or with the configuration different from shown in Fig. 8.Each component shown in fig. 8 can be real using hardware, software, or its combination
It is existing.
To sum up, the processing method and processing device of disk lock provided by the embodiment of the present application is applied in shared-file system
The first host, shared-file system further includes the second host in addition to the first host and can be by the first host, second main
The shared storage device of machine access, the disk lock that the first host record has the first host currently to hold and the disk lock currently held
The corresponding relationship of location information on shared storage device.When the first Host Detection is former to occurring network between the second host
When barrier, according to the location information for the first disk lock that the first host in corresponding relationship is currently held, read from shared storage device
The solicited status when request of the second host being taken to lock the corresponding shared resource of the first disk lock, when the solicited status is not obstruction
When state, then the first disk lock is not discharged；When the solicited status is blocked state, then first disk lock is discharged；Wherein, should
Blocked state blocks write-in shared storage when the second host locks the first disk lock corresponding shared resource in the first host and sets
It is standby.Due to the first host be detect there is network failure between the second host when, just read the from shared storage device
The solicited status when request of two hosts locks, when the solicited status shows that the first host does not block the second host and corresponds to disk lock
Shared resource when locking, the first host does not discharge the disk lock, i.e., does not unlock to the corresponding shared resource of the disk lock, therefore needle
To there is no locking the shared resource of obstruction, a reading IO only need to be generated, host has been locked to all compared to the prior art
The mode that successful shared resource locks again after being unlocked, the movement for avoiding unnecessary unlock and locking again, pole
Host is reduced to the read-write number of shared storage device greatly, and then effectively increases the performance of shared-file system.
It should be understood by those skilled in the art that, the application can provide as the production of method, apparatus, equipment or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the application
Form.It can be used moreover, the application can be used in the computer that one or more wherein includes computer usable program code
The computer program product implemented on storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Form.
The application is flow chart and/or side of the reference according to the present processes, device, equipment and computer program product
Block diagram describes.It should be understood that each process and/or the side in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in frame and flowchart and/or the block diagram.These computer program instructions be can provide to logical
With the processor of computer, special purpose computer, Embedded Processor or other programmable data processing devices to generate a machine
Device, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for realizing in process
The device for the function of being specified in figure one process or multiple processes and/or block diagrams one box or multiple boxes.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
In several embodiments provided herein, it should be understood that disclosed device and method can also pass through
Other modes are realized.Device and method embodiment described above is only schematical, for example, the flow chart in attached drawing
The device of multiple embodiments according to the application, the system in the cards of method and computer program product are shown with block diagram
Framework, function and operation.In this regard, each box in flowchart or block diagram can represent a module, program segment or generation
A part of code, a part of the module, section or code include one or more for realizing defined logic function
Executable instruction.It should also be noted that function marked in the box can also be in some implementations as replacement
Occur different from the sequence marked in attached drawing.For example, two continuous boxes can actually be basically executed in parallel, they
Sometimes it can also execute in the opposite order, this depends on the function involved.It is also noted that block diagram and or flow chart
In each box and the box in block diagram and or flow chart combination, can function or movement as defined in executing it is special
Hardware based system is realized, or can be realized using a combination of dedicated hardware and computer instructions.
In addition, each functional module in each embodiment of the application can integrate one independent portion of formation together
Point, it is also possible to modules individualism, an independent part can also be integrated to form with two or more modules.
It, can be with if the function is realized and when sold or used as an independent product in the form of software function module
It is stored in a computer readable storage medium.Based on this understanding, the technical solution of the application is substantially in other words
The part of the part that contributes to existing technology or the technical solution can be embodied in the form of software products, the meter
Calculation machine software product is stored in a storage medium, including some instructions are used so that a computer equipment (can be a
People's computer, server or network equipment etc.) execute each embodiment the method for the application all or part of the steps.
And storage medium above-mentioned includes: that USB flash disk, mobile hard disk, read-only memory (ROM, Read-OnlyMemory), arbitrary access are deposited
The various media that can store program code such as reservoir (RAM, Random Access Memory), magnetic or disk.It needs
Illustrate, herein, the terms "include", "comprise" or any other variant thereof is intended to cover non-exclusive inclusion,
So that the process, method, article or equipment for including a series of elements not only includes those elements, but also including not having
The other element being expressly recited, or further include for elements inherent to such a process, method, article, or device.Do not having
There is the element limited in the case where more limiting by sentence "including a ...", it is not excluded that in the mistake including the element
There is also other identical elements in journey, method, article or equipment.
The foregoing is merely the alternative embodiments of the application, are not intended to limit this application, for the skill of this field
For art personnel, various changes and changes are possible in this application.Within the spirit and principles of this application, made any to repair
Change, equivalent replacement, improvement etc., should be included within the scope of protection of this application.It should also be noted that similar label and letter exist
Similar terms are indicated in following attached drawing, therefore, once being defined in a certain Xiang Yi attached drawing, are then not required in subsequent attached drawing
It is further defined and explained.
Claims (12)
1. a kind of processing method of disk lock, which is characterized in that described shared applied to the first host in shared-file system
File system further includes the second host in addition to first host and can be visited by first host, second host
The shared storage device asked, the disk lock that first host record has first host currently to hold currently are held with described
Location information of the disk lock on the shared storage device corresponding relationship；The described method includes:
When first Host Detection is to when there is network failure between second host, according in the corresponding relationship
The location information for the first disk lock that first host is currently held reads second host from the shared storage device
Request solicited status when locking to the corresponding shared resource of first disk lock；
When the solicited status is not blocked state, then first disk lock is not discharged；Wherein, the blocked state is in institute
Described share is written when stating the first host obstruction second host to the locking of first disk lock corresponding shared resource to deposit
Store up equipment.
2. the method as described in claim 1, which is characterized in that the disk lock currently held in the corresponding relationship with
The location information of the disk lock currently held is key assignments；
The location information for the first disk lock that first host according in the corresponding relationship is currently held, from described
Shared storage device reads request shape when the second host request locks first disk lock corresponding shared resource
The step of state includes:
The corresponding relationship is traversed according to preset key assignments ordering rule, and according to first disk lock in the corresponding relationship
In key assignments read second host from the shared storage device and request to the corresponding shared resource of first disk lock
Solicited status when locking.
3. the method according to claim 1, wherein the method also includes:
When the solicited status is the blocked state, then first disk lock is discharged.
4. method as claimed in claim 3, which is characterized in that the solicited status passes through preset value or the shared file system
The identification information of other hosts in system in addition to first host is characterized；The method also includes:
According to the solicited status read, judge whether the solicited status is blocked state；
If the solicited status is the preset value, determine that the solicited status is not blocked state；
If the solicited status is the identification information of second host, determine the solicited status for blocked state.
5. the method as described in claim 1, which is characterized in that first disk lock has on the shared storage device
Corresponding state storage area, the state storage area are associated with the location information of first disk lock, and the state is deposited
Storage area domain is for storing the solicited status；
The location information for the first disk lock that first host according in the corresponding relationship is currently held, from described
Shared storage device reads request shape when the second host request locks first disk lock corresponding shared resource
The step of state includes:
According to the corresponding relationship, determination is associated with the location information of first disk lock in the shared storage device
State storage area, and it is corresponding total to first disk lock from state storage area reading the second host request
Enjoy solicited status when resource locks.
6. the method as described in claim 1, which is characterized in that described to read second host from the shared storage device
Request to the corresponding shared resource of first disk lock lock when solicited status the step of include:
The second host request is read from the shared storage device in a manner of asynchronous IO to correspond to first disk lock
Shared resource lock when solicited status.
7. a kind of processing unit of disk lock, which is characterized in that described shared applied to the first host in shared-file system
File system further includes the second host in addition to first host and can be visited by first host, second host
The shared storage device asked, the disk lock that first host record has first host currently to hold currently are held with described
Location information of the disk lock on the shared storage device corresponding relationship；Described device includes:
State reading module, for when first Host Detection is to when there is network failure between second host, root
According to the location information for the first disk lock that first host in the corresponding relationship is currently held, set from the shared storage
The standby solicited status read when the second host request locks first disk lock corresponding shared resource；
Disk lock processing module, for when the solicited status is not blocked state, then not discharging first disk lock；Its
In, the blocked state blocks second host in first host and adds to the corresponding shared resource of first disk lock
The shared storage device is written when lock.
8. device as claimed in claim 7, which is characterized in that the disk lock currently held in the corresponding relationship with
The location information of the disk lock currently held is key assignments；
The state reading module is used to traverse the corresponding relationship according to preset key assignments ordering rule, and according to described first
Key assignments of the disk lock in the corresponding relationship reads the second host request to described first from the shared storage device
Solicited status when the corresponding shared resource of disk lock locks.
9. device as claimed in claim 7, which is characterized in that the disk lock processing module is also used to when the solicited status
When for the blocked state, then first disk lock is discharged.
10. device as claimed in claim 9, which is characterized in that the solicited status passes through preset value or the shared file
The identification information of other hosts in system in addition to first host is characterized；Described device further include:
Block judgment module, for judging whether the solicited status is blocked state according to the solicited status read；If
The solicited status is the preset value, then determines that the solicited status is not blocked state；If the solicited status is described
The identification information of second host then determines the solicited status for blocked state.
11. device as claimed in claim 7, which is characterized in that first disk lock has on the shared storage device
There is corresponding state storage area, the state storage area is associated with the location information of first disk lock, the state
Storage region is for storing the solicited status；
The state reading module is used to be determined and first magnetic in the shared storage device according to the corresponding relationship
The associated state storage area of location information of disk lock, and the second host request is read to institute from the state storage area
State solicited status when the corresponding shared resource of the first disk lock locks.
12. device as claimed in claim 7, which is characterized in that the state reading module be used in a manner of asynchronous IO from
The shared storage device reads when the second host request locks first disk lock corresponding shared resource and asks
Seek state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910338564.9A CN110096231A (en) | 2019-04-25 | 2019-04-25 | The processing method and processing device of disk lock |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910338564.9A CN110096231A (en) | 2019-04-25 | 2019-04-25 | The processing method and processing device of disk lock |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110096231A true CN110096231A (en) | 2019-08-06 |
Family
ID=67445829
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910338564.9A Pending CN110096231A (en) | 2019-04-25 | 2019-04-25 | The processing method and processing device of disk lock |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110096231A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111324500A (en) * | 2020-02-29 | 2020-06-23 | 苏州浪潮智能科技有限公司 | Method, device and storage medium for detecting ATS function of storage array |
| CN111737063A (en) * | 2020-05-20 | 2020-10-02 | 山东鲸鲨信息技术有限公司 | Disk lock arbitration method, device, equipment and medium for double-control split brain |
| CN113535416A (en) * | 2021-06-30 | 2021-10-22 | 北京百度网讯科技有限公司 | Method and device for realizing reentrant distributed lock, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140040220A1 (en) * | 2012-07-31 | 2014-02-06 | Hideaki Kimura | Methods and systems for deadlock detection |
| CN104391935A (en) * | 2014-11-21 | 2015-03-04 | 华为技术有限公司 | Implementation method and device of range lock |
| CN106202462A (en) * | 2016-07-15 | 2016-12-07 | 北京奇虎科技有限公司 | Method and device for data configuration data lock |
| CN106648909A (en) * | 2016-10-13 | 2017-05-10 | 华为技术有限公司 | Management method and device for dish lock and system |
| CN107402822A (en) * | 2017-07-06 | 2017-11-28 | 腾讯科技（深圳）有限公司 | Deadlock treatment method and device |
| CN108446337A (en) * | 2018-02-28 | 2018-08-24 | 新华三云计算技术有限公司 | A kind of lock resources control permission moving method and device |
-
2019
- 2019-04-25 CN CN201910338564.9A patent/CN110096231A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140040220A1 (en) * | 2012-07-31 | 2014-02-06 | Hideaki Kimura | Methods and systems for deadlock detection |
| CN104391935A (en) * | 2014-11-21 | 2015-03-04 | 华为技术有限公司 | Implementation method and device of range lock |
| CN106202462A (en) * | 2016-07-15 | 2016-12-07 | 北京奇虎科技有限公司 | Method and device for data configuration data lock |
| CN106648909A (en) * | 2016-10-13 | 2017-05-10 | 华为技术有限公司 | Management method and device for dish lock and system |
| CN107402822A (en) * | 2017-07-06 | 2017-11-28 | 腾讯科技（深圳）有限公司 | Deadlock treatment method and device |
| CN108446337A (en) * | 2018-02-28 | 2018-08-24 | 新华三云计算技术有限公司 | A kind of lock resources control permission moving method and device |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111324500A (en) * | 2020-02-29 | 2020-06-23 | 苏州浪潮智能科技有限公司 | Method, device and storage medium for detecting ATS function of storage array |
| CN111324500B (en) * | 2020-02-29 | 2023-01-10 | 苏州浪潮智能科技有限公司 | Method, device and storage medium for detecting ATS (automatic transfer switching) function of storage array |
| CN111737063A (en) * | 2020-05-20 | 2020-10-02 | 山东鲸鲨信息技术有限公司 | Disk lock arbitration method, device, equipment and medium for double-control split brain |
| CN111737063B (en) * | 2020-05-20 | 2023-11-14 | 山东鲸鲨信息技术有限公司 | Disk lock arbitration method, device, equipment and medium for double-control brain fracture |
| CN113535416A (en) * | 2021-06-30 | 2021-10-22 | 北京百度网讯科技有限公司 | Method and device for realizing reentrant distributed lock, electronic equipment and storage medium |
| CN113535416B (en) * | 2021-06-30 | 2024-02-27 | 北京百度网讯科技有限公司 | Implementation method and device of reentrant distributed lock, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110096231A (en) | The processing method and processing device of disk lock | |
| CN108897628A (en) | A kind of implementation method of distributed lock, device and electronic equipment | |
| CN104660578B (en) | A kind of system and method for realizing data safety storage and data access control | |
| CN108845877B (en) | Method, device and system for managing memory | |
| CN109889517B (en) | Data processing method, permission data set creating device and electronic equipment | |
| BR112012033016B1 (en) | online service access control method and system using directory resources | |
| CN107018174A (en) | A kind of method, device and the transaction processing system of blocking system service processing | |
| JP2016514334A (en) | Guess application inventory | |
| CN107402821A (en) | Access control method, device and the equipment of shared resource | |
| CN105991624A (en) | Safety management method and device of server | |
| CN109412967A (en) | System flow control method, device, electronic equipment, storage medium based on token | |
| CN109032799A (en) | Storage resource management method, apparatus, equipment and readable storage medium storing program for executing | |
| US9514290B2 (en) | Authorization cache | |
| CN107644173A (en) | Method and apparatus for controlling application program to access memory | |
| CN104391935B (en) | A kind of implementation method and device of scope lock | |
| CN109947667B (en) | Data access prediction method and device | |
| US9021321B2 (en) | Testing disk drives shared by multiple processors in a supercomputer complex | |
| CN106354793B (en) | Method and device for monitoring hot spot object | |
| CN112181599A (en) | Model training method, device and storage medium | |
| CN108055299A (en) | Portal page push method, network access server and portal certification system | |
| CN107967265A (en) | Access method, data server and the file access system of file | |
| CN105871928B (en) | A kind of method of controlling security and system of distributed network | |
| CN108133034A (en) | Shared storage access method and relevant apparatus | |
| CN115603923A (en) | Access Control List (ACL) policy management method, device and related equipment | |
| CN105095105B (en) | A kind of method and device of Cache subregions |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190806 |
|
| RJ01 | Rejection of invention patent application after publication |