CN107340973A - A kind of method and system for accessing asynchronous logic - Google Patents

A kind of method and system for accessing asynchronous logic Download PDF

Info

Publication number
CN107340973A
CN107340973A CN201710542019.2A CN201710542019A CN107340973A CN 107340973 A CN107340973 A CN 107340973A CN 201710542019 A CN201710542019 A CN 201710542019A CN 107340973 A CN107340973 A CN 107340973A
Authority
CN
China
Prior art keywords
path
preferred path
preferred
data
routing information
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
CN201710542019.2A
Other languages
Chinese (zh)
Other versions
CN107340973B (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.)
Zhengzhou Yunhai Information Technology Co Ltd
Original Assignee
Zhengzhou Yunhai Information 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 Zhengzhou Yunhai Information Technology Co Ltd filed Critical Zhengzhou Yunhai Information Technology Co Ltd
Priority to CN201710542019.2A priority Critical patent/CN107340973B/en
Publication of CN107340973A publication Critical patent/CN107340973A/en
Application granted granted Critical
Publication of CN107340973B publication Critical patent/CN107340973B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629Configuration or reconfiguration of storage systems
    • G06F3/0635Configuration or reconfiguration of storage systems by changing the path, e.g. traffic rerouting, path reconfiguration
    • 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/061Improving I/O performance

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)
  • Computer Networks & Wireless Communication (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

This application discloses a kind of method for accessing asynchronous logic, methods described includes:The routing information of the I/O path of logic unit described in client to storage end queried access;Wherein, the routing information includes the precedence information of the I/O path;According to the precedence information, the I/O path of highest priority is arranged to preferred path;I/O data is sent by the preferred path;The transmission situation of the I/O data is monitored, and the preferred path is modified according to the transmission situation;This method plays the efficiency of hardware device to greatest extent, improves the performance for sending I/O data, improves the competitiveness of product;Disclosed herein as well is a kind of system for accessing asynchronous logic, there is above beneficial effect.

Description

A kind of method and system for accessing asynchronous logic
Technical field
The present invention relates to storage management field, more particularly to a kind of method and system for accessing asynchronous logic.
Background technology
Storage device is a kind of equipment of carrying mass data, therefore has substantial amounts of user and storage device is visited Ask.In some industries very high to data storage dependence, once storage device breaks down, tremendous influence can be brought. In order to solve the problem, generally, the various assemblies of many storage devices have all done the consideration of redundancy, can eliminate controller Single Point of Faliure.After redundancy occurs in controller, select which controller, be related to how formulating using which paths Front controller multipath strategy.
In the prior art, there are tri- kinds of front controller strategies of AA, AP and ALUA.Wherein, AA (Symmetric Active/Active) symmetrical Active patterns, all controllers can access storage logic list simultaneously all in active state Member.AP (Active/Passive) pattern, only a controller are in Active states, and other controllers are in Passive State.But AA patterns realize more difficulty in above two method, only seldom storage manufacturer realizes AA Schema controls;AP Pattern can not play the efficiency of hardware device to greatest extent, not be the optional side for formulating front controller multipath strategy Formula.ALUA (Asymmetric Active/Active) pattern, all controllers are all in active state, only a controller Destination logical unit can be conducted interviews, ALUA is the front-end control strategy of current relatively main flow, but is patrolled by ALUA The specific implementation for collecting unit access is also not quite similar.
Therefore, how can formulate a kind of front controller multipath strategy can be when accessing logic unit to greatest extent Ground plays the efficiency of hardware device, is the current technical issues that need to address of those skilled in the art.
The content of the invention
The purpose of the application is to provide a kind of method and system for accessing asynchronous logic, can formulate a kind of front end control Device multipath strategy processed can play the efficiency of hardware device to greatest extent when accessing logic unit.
In order to solve the above technical problems, the application provides a kind of method and system for accessing asynchronous logic, this method Including:
The routing information of the I/O path of logic unit described in client to storage end queried access;Wherein, the path letter Breath includes the precedence information of the I/O path;
According to the precedence information, the I/O path of highest priority is arranged to preferred path;
I/O data is sent by the preferred path;
The transmission situation of the I/O data is monitored, and the preferred path is modified according to the transmission situation.
Optionally, the transmission situation of the monitoring I/O data, and being carried out according to the transmission situation to the preferred path Amendment includes:
The transmission situation of the I/O data is monitored by predetermined period, obtains condition information;
According to the condition information, judge whether the IO performances of the preferred path are deteriorated;
If it is, update the routing information, and reselect in the available I/O path one it is described preferential I/O path is as new preferred path described in level highest.
Optionally, the I/O path conduct of a highest priority is reselected in the available I/O path New preferred path includes:
Delete the preferred path of IO degradations;
According to the routing information after renewal, the I/O path of one highest priority of selection in the I/O path As new preferred path;
Judge whether storage end feedback switching succeeds;
If it is not, then other described I/O paths are selected successively as new preferential road according to the order of priority from high to low Footpath, until feedback switches successfully.
Optionally, methods described also includes:
The preferred path is stored into preferred path chained list or preferred path search tree.
Present invention also provides a kind of system for accessing asynchronous logic, the system includes:
Enquiry module, the routing information for the I/O path of logic unit described in client to storage end queried access;Its In, the routing information includes the precedence information of the I/O path;
Path selection module, for according to the precedence information, the I/O path of highest priority to be arranged into excellent First path;
I O process module, for sending I/O data by the preferred path;
Monitoring module, for monitoring the transmission situation of the I/O data, and according to the transmission situation to the preferential road Footpath is modified.
Optionally, the monitoring module includes:
Monitoring unit, for monitoring the transmission situation of the I/O data by predetermined period, obtain condition information;
Judging unit, for according to the condition information, judging whether the IO performances of the preferred path are deteriorated;
Amending unit, for when the IO degradations of the preferred path, updating the routing information, and in available institute The I/O path that a highest priority is reselected in I/O path is stated as new preferred path.
Optionally, the amending unit includes:
Subelement is deleted, occurs the preferred path of IO degradations for deleting;
Path gravity treatment subelement, for according to the routing information after renewal, selection one to be excellent in the I/O path I/O path is as new preferred path described in first level highest;
Switching judging subelement, for judging whether storage end feedback switching succeeds;
Subelement is selected in path again, for feeding back handoff failure when storage end, according to the order of priority from high to low successively Other described I/O paths are selected as new preferred path, until feedback switches successfully.
Optionally, the system also includes:
Preferred path memory cell, for the preferred path to be stored to preferred path chained list or preferred path search tree In.
The invention provides a kind of method for accessing asynchronous logic, logic described in client to storage end queried access The routing information of the I/O path of unit;Wherein, the routing information includes the precedence information of the I/O path;According to described excellent First level information, the I/O path of highest priority is arranged to preferred path;I/O data is sent by the preferred path;Prison The transmission situation of the I/O data is controlled, and the preferred path is modified according to the transmission situation.
This method is all inquired about the routing information of all I/O paths for being able to access that destination logical unit, due to every The priority of paths is different, and the higher I/O path for accessing logic unit of priority also more optimizes, wherein passing through master access The highest priority of the I/O path of logic unit.The priority in all paths is ranked up and sets the I/O path of highest priority It is set to preferred path, that is to say, that preferred path will be arranged to by the path of master access logic unit.Pass through preferred path The access to logic unit is realized, the efficiency of hardware device can be played to greatest extent.Due to the access of each I/O path Situation is not unalterable, and the transmission situation of preferred path may become very severe, to preferred path in this method Transmission situation be monitored, if preferred path goes wrong, preferred path is modified, ensures the excellent of preferred path First level is highest in each path, to realize in access process, is always maintained at playing hardware device efficiency to greatest extent, real The optimization of existing IO performances.The application additionally provides a kind of system for accessing asynchronous logic simultaneously, has above-mentioned beneficial effect, It will not be repeated here.
Brief description of the drawings
In order to illustrate more clearly of the embodiment of the present application, the required accompanying drawing used in embodiment will be done simply below Introduce, it should be apparent that, drawings in the following description are only some embodiments of the present application, for ordinary skill people For member, on the premise of not paying creative work, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is the hardware environment schematic diagram at a kind of method of access asynchronous logic provided herein;
Fig. 2 is a kind of typical main frame storage link topology diagram;
A kind of flow chart of the method for access asynchronous logic that Fig. 3 is provided by the embodiment of the present application;
Fig. 4 is that client and storage end interact schematic diagram in embodiment illustrated in fig. 3;
The flow chart for another method for accessing asynchronous logic that Fig. 5 is provided by the embodiment of the present application;
Fig. 6 is a kind of system structure diagram for access asynchronous logic that the embodiment of the present application provides;
Fig. 7 is the structural representation for another system for accessing asynchronous logic that the embodiment of the present application provides.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present application clearer, below in conjunction with the embodiment of the present application In accompanying drawing, the technical scheme in the embodiment of the present application is clearly and completely described, it is clear that described embodiment is Some embodiments of the present application, rather than whole embodiments.Based on the embodiment in the application, those of ordinary skill in the art The every other embodiment obtained under the premise of creative work is not made, belong to the scope of the application protection.
A kind of method and system of access asynchronous logic provided herein, can apply to following hardware scene In:
Fig. 1 is refer to, Fig. 1 is the hardware loop at a kind of method of access asynchronous logic provided herein Border schematic diagram, including client 101, storage end 102.
Wherein, client 101 is also host side, is that user selects preferred path and sends the terminal installation of I/O data, and one As be arranged in common client computer, it is necessary to be worked in coordination operation with storage end 102.As long as client 101 can select excellent First path and the terminal installation for sending I/O data, do not do specific limitation to client 101 herein.Storage end 102 is The access object of client 101, storage end 102 provides the routing information of each bar access path to client 101, so as to client 101 one optimal path of selection conduct interviews.Storage end 102 has multiple functional modules under its command, as cache management submodule, IO turn Send out submodule etc..
Fig. 2 is referred to below, and Fig. 2 is a kind of typical main frame storage link topology diagram.P1, P2 are dual control storage controls FC ports on device SP0 processed, P1 and P2 form port set PG0,1,2,3,4, be logical volume using SP0 as master control, these logics It is the FC ports on controller that volume, which forms logical volume group LG0, same P3, P4, and P3 and P4 form PG1, and 5,6,7,8 form logical volume Group LG1.Topological structure in Fig. 2, main frame, which accesses logical volume 1, can 8 kinds of paths, be respectively:
Path1:A-1-P1-LV1;
Path2:A-2-P2-LV1;
Path3:A-3-P3-LV1;
Path4:A-4-P4-LV1;
Path5:B-1-P1-LV1;
Path6:B-2-P2-LV1;
Path7:B-3-P3-LV1;
Path8:B-4-P4-LV1;
Wherein below 4 kinds and above the path access in 4 has symmetric relation, in above 4, this 4 In kind access path (path1-path4), path1 and path2 performance is identical and is better than path3 and path4.From ALUA angle From the point of view of degree, path1 and path2 path port group state are preferential, and path3 and path4 port set state is non-preferential. For the preferential and non-preferential of port set state appearance, its main basis is that controller is relative with master control be present for logical volume group With non-master control.
Fig. 3, Fig. 4, a kind of method for access asynchronous logic that Fig. 3 is provided by the embodiment of the present application are referred to below Flow chart;Fig. 4 is that client and storage end interact schematic diagram in embodiment illustrated in fig. 3, wherein, the visitor marked in Fig. 4 Family end multipath module is client, and storage end ALUA modules are storage end.
Specific steps can include:
Step S201:The routing information of the I/O path of logic unit described in client to storage end queried access;Wherein, institute Stating routing information includes the precedence information of the I/O path;
Wherein, client first sends query statement, such as " INQURY " or " REPORT TARGET to storage end GROUP”.The particular content of query statement is not defined herein, as long as storage end can be allowed by the path of I/O path Information is sent to the query statement of client.Under certain conditions, client is not directly to send inquiry to storage end to refer to Order, but query statement is sent indirectly by third party device (such as interchanger), also whether query statement is not passed through herein Third party device forwarding is defined.
After storage end receives querying command, then related place is carried out according to the order of client requirements report path state Reason, such as:The path status information for the logic unit that structure client is specified, including which port the master control of logic unit is, should The IO situations and busy extent of the preferential each port of port set corresponding to logic unit, the IO feelings of the non-preferential each port of port set Condition and busy extent, and above-mentioned path status information is sent to client, so that client carries out the selection of preferred path.Can With understanding, precedence information is included in the traffic information that client is sent, precedence information is in the middle part of above-mentioned traffic information Point information together decides on, such as IO situations and busy extent of each port.
When client receives the routing information that storage end reports, relevant treatment is carried out to routing information, is such as created related Data structure, introductory path information (port set state and prior information) is preserved, form the I/O path chained list of logic unit.Can be with Understand, client can not only access a logic unit in practical operation, but can access many logic units, deposit In the situation repeatedly inquired about, so may eventually form multiple logic unit I/O path chained lists.
Step S202:According to the precedence information, the I/O path of highest priority is arranged to preferred path;
Wherein, the precedence information of every I/O path represents the quality that the path sends I/O data performance, it is possible to understand that It is that the performance of its higher transmission I/O data of priority of I/O path is better.Therefore this step is by the I/O path of highest priority It is arranged to preferred path, that is to say, that the optimal I/O path of I/O data performance will be sent and be arranged to preferred path.
Client determines that the step of preferred path is first to travel through all logic unit I/O path chained lists, finds out priority as 1 Path, and the path is arranged to preferred path.It is appreciated that priority is the path that 1 path is highest priority, Increase with the series of priority, the rank of priority gradually reduces.Certainly, the rank of priority is a relative numeral, According to priority, sequence obtains successively from high to low, and the performance of the transmission I/O data in equal priority difference path is also not to the utmost It is identical.
It is understood that the preferred path of all logic units is stored in storage area network, when the number of logic unit It can be stored in preferred path chained list when measuring less, preferred path search tree can be stored in when number of logic cells is more In.Certainly, if the path of logic unit that chained list is longer and infrequently accesses be present, the path can be deleted, to save space, Lift operating efficiency.
Certainly, the method for selecting preferred path is not defined herein, but is to ensure that client passes through as far as possible The higher path access asynchronous logic of one priority, that is to say, that select master controller to carry out I O process as far as possible, subtract The performance degradation that few submaster controller IO forwardings are brought, improve the performance of I/O transmission.
Step S203:I/O data is sent by the preferred path;
Wherein, because what client accessed is more than logic unit, therefore access is multiple patrols for client memory storage The preferred path of unit is collected, it is necessary to travel through the preferred path of all logic units before I/O data is sent by preferred path, To determine I/O path.After I/O path is determined, multi-path software strategy is set as " fixed route strategy ", that is to say, that Later I/O data is all transmitted by this preferred path.It is understood that above-mentioned " fixed route strategy " does not imply that IO Path is unalterable, but say path status in preferred path it is constant it is severe on the premise of use the I/O path always, work as road When footpath situation goes wrong, thus it is possible to vary preferred path.
Step S204:The transmission situation of the I/O data is monitored, and the preferred path is entered according to the transmission situation Row amendment;
Wherein, because the visit capacity on preferred path is very big, I/O path degradation can be caused, causes client to access and patrols The path for collecting unit is not an optimal paths, it is therefore desirable to which the transmission situation to I/O data is monitored.It is appreciated that It is that the time interval monitored every time is unsuitable excessive, it is also unsuitable too small.Time interval, which crosses conference, causes path switching not in time, when Between be spaced it is too small can cause the cumbersome wasting of resources, therefore monitoring was needed in a suitable time interval, the time every time Interval can be drawn by the mode such as testing, calculating, and the length and acquisition pattern of time interval are not defined herein.
There is many to the method that preferred path is modified, determined according to the port of failure and its quantity.Amendment Detailed process be:When the IO degradations of client monitors to preferred path, the command frame for building target port group enters Row path status is set.Storage end receives dbjective state command frame is set after information in command frame to logic unit It is major and minor to control into switching.In handoff procedure, first suspend the I O access of the logic unit, the data for having been written into caching, root Set according to original major-minor control and write with a brush dipped in Chinese ink or forwarded, the new preferred path of client is notified after the completion of switching.
It is understood that major and minor control is that comparatively the relatively good port of I/O path performance is master control, relatively It is poor to be controlled for pair, when master control its I/O path performance that breaks down will die down, so that secondary control replaces original master control structure Into preferred path, that is, IO is set to carry out I O process by the controller of better performances as far as possible.
Fig. 5 is referred to below, another method for accessing asynchronous logic that Fig. 5 is provided by the embodiment of the present application Flow chart.
This embodiment is on the basis of above-described embodiment, and the method to monitoring has carried out phase with the amendment to preferred path Close and limit.
Specific steps can include:
Step S301:The routing information of the I/O path of logic unit described in client to storage end queried access;Wherein, institute Stating routing information includes the precedence information of the I/O path.
Step S302:According to the precedence information, the I/O path of highest priority is arranged to preferred path.
Step S303:I/O data is sent by the preferred path.
Step S304:The transmission situation of the I/O data is monitored by predetermined period, obtains condition information;
Wherein, the time interval monitored every time is unsuitable excessive, also unsuitable too small.Time interval, which crosses conference, causes path to switch Not in time, time interval is too small can cause the cumbersome wasting of resources, therefore monitoring was needed between a suitable time every time Every.As a kind of preferable scheme, it can set and transmission situation is monitored by predetermined period, to ensure that it is excellent that I/O data passes through First path is transmitted.
Step S305:According to the condition information, judge whether the IO performances of the preferred path are deteriorated, if so, into Step S306;If it is not, then enter S303.
Wherein, it is not that the degradation of preferred path is a little judged as IO degradations to judge IO degradations, can be with Allow the performance of preferred path to fluctuate within the specific limits, when the amplitude of fluctuation is more than certain parameter, then judge preferential road The IO degradations in footpath.It is understood that the reason for IO degradations, has a lot, for example, line fault, a large amount of clients are all Select the preferred path etc..
Certainly, for the step it is possible that such situation:After preferred path breaks down, by the of short duration time Failure vanishes afterwards, preferred path continue with high-property transmission I/O data.Therefore, just changed when of short duration failure occurs in preferred path Path, which does not have, accomplishes that selection as far as possible sends the path of I/O data better performances as preferred path.For this special feelings Condition, after can there is primary fault finding path, shorten the cycle of monitoring, more tight monitoring is carried out to failure.Entering After the more tight monitoring of row, if finding the Failure elimination of preferred path, do not judge that preferred path breaks down;It is if it was found that excellent The failure in first path is persistently present, then judges that preferred path breaks down, it is necessary to the preferred path more renewed, and by the week of monitoring Phase recovers normal condition, and new preferred path is monitored.It is understood that implement the specific prison of tighter monitoring The cycle is controlled depending on actual conditions, the concrete numerical value in the cycle is not defined herein.
Step S306:The routing information is updated, and deletes the preferred path for IO degradations occur;
Wherein, after preferred path IO degradations, illustrate that the port situation in all paths is likely to go wrong, That is, the situation that each bar accesses the path of asynchronous logic is likely to change.Therefore need to reacquire respectively The routing information of paths, conducted interviews to reselect a preferred path.
It is understood that preferred path is stored in preferred path chained list or preferred path search tree, due to original Preferred path IO degradations after, in this way it is no longer necessary to preferred path originally, therefore need to be deleted, it is empty to save storage Between.
Step S307:According to the routing information after renewal, one highest priority of selection in the I/O path The I/O path is as new preferred path;
Wherein, in order that the performance in the path of I/O data transmission reaches optimal, so when selecting new preferred path The higher I/O path of a priority is selected as far as possible.That is, when master controller breaks down, submaster controller composition is selected I/O path.The method for selecting preferred path is not defined herein, as long as ensure that client is as excellent by one as possible The higher path access asynchronous logic of first level.
Step S308:Judge whether storage end feedback switching succeeds, if so, then entering step S303, if otherwise entering step Rapid S309;
Wherein, detect that it is to need to switch over to reselect preferred path after the IO degradations of I/O path and be transmitted , but the path switched is it is possible that the situation of path more, then can be by new preferential so if switching successfully Path conducts interviews, and needs to reselect preferred path if switching is unsuccessful.
Step S309:Other described I/O paths are selected successively as new preferential road according to the order of priority from high to low Footpath, until feedback switches successfully.
Wherein, the IO degradations of the I/O path of original highest priority are, it is necessary to reselect an I/O path conduct New preferred path.The performance of the higher transmission I/O data of priority of I/O path is better, that is to say, that to be dropped according to priority The sequential selection preferred path of sequence.That is the I/O path conduct of a highest priority is selected as far as possible in available path Preferred path.The order of priority from high to low is the order that priority is 1,2,3 ....It is understood that new is preferential The selection in path is regular consistent with original preferred path selection rule, and the S202 appearances of specific above step are substantially uniform, this Place repeats no more.
Because the embodiment of components of system as directed and the embodiment of method part are mutually corresponding, therefore the embodiment of components of system as directed please Referring to the description of the embodiment of method part, wouldn't repeat here.
Fig. 6 is referred to below, Fig. 6 is a kind of system structure diagram for access asynchronous logic that the application provides, The system can include:
Enquiry module 100, the routing information for the I/O path of logic unit described in client to storage end queried access; Wherein, the routing information includes the precedence information of the I/O path;
Path selection module 200, for according to the precedence information, the I/O path of highest priority to be arranged to Preferred path;
I O process module 300, for sending I/O data by the preferred path;
Monitoring module 400, for monitoring the transmission situation of the I/O data, and according to the transmission situation to described preferential Path is modified.
Referring to Fig. 7, the structure for another system for accessing asynchronous logic that Fig. 7, which is the embodiment of the present application, to be provided is shown It is intended to.
On the basis of above-described embodiment, the present embodiment is further, and the monitoring module 400 includes:
Monitoring unit 410, for monitoring the transmission situation of the I/O data by predetermined period, obtain condition information;
Judging unit 420, for according to the condition information, judging whether the IO performances of the preferred path are deteriorated;
Amending unit 430, for when the IO degradations of the preferred path, updating the routing information, and can use The I/O path in reselect the I/O path of a highest priority as new preferred path.
Further, the amending unit 430 includes:
Subelement 431 is deleted, occurs the preferred path of IO degradations for deleting;
Path gravity treatment subelement 432, for according to the routing information after renewal, one to be selected in the I/O path The I/O path of highest priority is as new preferred path;
Switching judging subelement 433, for judging whether storage end feedback switching succeeds;
Subelement 434 is selected in path again, for when storage end feed back handoff failure, according to the order of priority from high to low according to Secondary other described I/O paths of selection are as new preferred path, until feedback switches successfully.
A kind of method and system of access asynchronous logic provided herein are described in detail above.Say Each embodiment is described by the way of progressive in bright book, and what each embodiment stressed is the difference with other embodiment Part, between each embodiment identical similar portion mutually referring to.For system disclosed in embodiment, due to its with Method is corresponding disclosed in embodiment, so description is fairly simple, related part is referring to method part illustration.It should refer to Go out, for those skilled in the art, can also be to the application on the premise of the application principle is not departed from Some improvement and modification are carried out, these are improved and modification is also fallen into the application scope of the claims.
It should also be noted that, in this manual, such as first and second or the like relational terms be used merely to by One entity or operation make a distinction with another entity or operation, and not necessarily require or imply these entities or operation Between any this actual relation or order be present.Moreover, term " comprising ", "comprising" or its any other variant meaning Covering including for nonexcludability, so that process, method, article or equipment including a series of elements not only include that A little key elements, but also the other element including being not expressly set out, or also include for this process, method, article or The intrinsic key element of equipment.Under the situation not limited more, the key element that is limited by sentence "including a ..." is not arranged Except other identical element in the process including the key element, method, article or equipment being also present.

Claims (8)

  1. A kind of 1. method for accessing asynchronous logic, it is characterised in that methods described includes:
    The routing information of the I/O path of logic unit described in client to storage end queried access;Wherein, the routing information bag Include the precedence information of the I/O path;
    According to the precedence information, the I/O path of highest priority is arranged to preferred path;
    I/O data is sent by the preferred path;
    The transmission situation of the I/O data is monitored, and the preferred path is modified according to the transmission situation.
  2. 2. method according to claim 1, it is characterised in that the transmission situation of the monitoring I/O data, and according to the hair Send situation the preferred path is modified including:
    The transmission situation of the I/O data is monitored by predetermined period, obtains condition information;
    According to the condition information, judge whether the IO performances of the preferred path are deteriorated;
    If it is, updating the routing information, and the priority is reselected most in the available I/O path The high I/O path is as new preferred path.
  3. 3. method according to claim 2, it is characterised in that reselected in the available I/O path one it is described excellent I/O path described in first level highest includes as new preferred path:
    Delete the preferred path of IO degradations;
    According to the routing information after renewal, the I/O path conduct of a highest priority is selected in the I/O path New preferred path;
    Judge whether the storage end feedback switching succeeds;
    If it is not, then other described I/O paths are selected successively as new preferred path according to the order of priority from high to low, Until feedback switches successfully.
  4. 4. method according to claim 3, it is characterised in that methods described also includes:
    The preferred path is stored into preferred path chained list or preferred path search tree.
  5. 5. a kind of system for accessing asynchronous logic, it is characterised in that the system includes:
    Enquiry module, the routing information for the I/O path of logic unit described in client to storage end queried access;Wherein, institute Stating routing information includes the precedence information of the I/O path;
    Path selection module, for according to the precedence information, the I/O path of highest priority to be arranged into preferential road Footpath;
    I O process module, for sending I/O data by the preferred path;
    Monitoring module, the preferred path is entered for monitoring the transmission situation of the I/O data, and according to the transmission situation Row amendment.
  6. 6. system according to claim 5, it is characterised in that the monitoring module includes:
    Monitoring unit, for monitoring the transmission situation of the I/O data by predetermined period, obtain condition information;
    Judging unit, for according to the condition information, judging whether the IO performances of the preferred path are deteriorated;
    Amending unit, for when the IO degradations of the preferred path, updating the routing information, and in the available IO The I/O path of a highest priority is reselected in path as new preferred path.
  7. 7. system according to claim 6, it is characterised in that the amending unit includes:
    Subelement is deleted, for deleting the preferred path of IO degradations;
    Path gravity treatment subelement, for according to the routing information after renewal, a priority to be selected in the I/O path I/O path described in highest is as new preferred path;
    Switching judging subelement, for judging whether the storage end feedback switching succeeds;
    Subelement is selected in path again, for feeding back handoff failure when the storage end, according to the order of priority from high to low successively Other described I/O paths are selected as new preferred path, until feedback switches successfully.
  8. 8. system according to claim 7, it is characterised in that also include:
    Preferred path memory cell, for the preferred path to be stored into preferred path chained list or preferred path search tree.
CN201710542019.2A 2017-07-05 2017-07-05 Method and system for accessing asynchronous logic unit Active CN107340973B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710542019.2A CN107340973B (en) 2017-07-05 2017-07-05 Method and system for accessing asynchronous logic unit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710542019.2A CN107340973B (en) 2017-07-05 2017-07-05 Method and system for accessing asynchronous logic unit

Publications (2)

Publication Number Publication Date
CN107340973A true CN107340973A (en) 2017-11-10
CN107340973B CN107340973B (en) 2021-04-13

Family

ID=60217994

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710542019.2A Active CN107340973B (en) 2017-07-05 2017-07-05 Method and system for accessing asynchronous logic unit

Country Status (1)

Country Link
CN (1) CN107340973B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111190546A (en) * 2019-12-30 2020-05-22 深圳创新科软件技术有限公司 Distributed block storage performance optimization method based on ALUA and local cache
WO2024103690A1 (en) * 2022-11-16 2024-05-23 苏州元脑智能科技有限公司 Data request method and apparatus, and device and non-volatile readable storage medium

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6240075B1 (en) * 1999-01-25 2001-05-29 Trw Inc. Satellite communication routing arbitration techniques
US20020038391A1 (en) * 2000-09-28 2002-03-28 Takeshi Ido Storage control apparatus
CN101714064A (en) * 2009-12-29 2010-05-26 成都市华为赛门铁克科技有限公司 Data access method and server
US20110153959A1 (en) * 2009-12-23 2011-06-23 Hitachi Global Storage Technologies Netherlands B.V. Implementing data storage and dual port, dual-element storage device
US20110173504A1 (en) * 2010-01-13 2011-07-14 Nec Corporation Communication system, a communication method and a program thereof
CN102710516A (en) * 2012-05-30 2012-10-03 浪潮电子信息产业股份有限公司 Method for automation deployment under multi-controller storage system environment
CN102810082A (en) * 2011-06-01 2012-12-05 阿尔特拉公司 Memory controllers with dynamic port priority assignment capabilities
CN103493020A (en) * 2011-04-27 2014-01-01 国际商业机器公司 Transparent input/output switching between synchronously mirrored storage volumes
CN103634388A (en) * 2013-11-22 2014-03-12 华为技术有限公司 Method for processing restarting of controllers in storage server, related equipment and communication system
CN104991874A (en) * 2015-07-22 2015-10-21 浪潮(北京)电子信息产业有限公司 SCST (SCSI target subsystem for Linux) based multi-controller storage device ALUA (asymmetrical logical unit access) configuration method
CN105430103A (en) * 2015-12-31 2016-03-23 浪潮(北京)电子信息产业有限公司 Dynamic load balancing system based on multi-controller storage
CN106873907A (en) * 2017-01-09 2017-06-20 中国电子科技集团公司第五十二研究所 A kind of multi-controller memory array reads and writes load-balancing method and device

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6240075B1 (en) * 1999-01-25 2001-05-29 Trw Inc. Satellite communication routing arbitration techniques
US20020038391A1 (en) * 2000-09-28 2002-03-28 Takeshi Ido Storage control apparatus
US20110153959A1 (en) * 2009-12-23 2011-06-23 Hitachi Global Storage Technologies Netherlands B.V. Implementing data storage and dual port, dual-element storage device
CN101714064A (en) * 2009-12-29 2010-05-26 成都市华为赛门铁克科技有限公司 Data access method and server
US20110173504A1 (en) * 2010-01-13 2011-07-14 Nec Corporation Communication system, a communication method and a program thereof
CN103493020A (en) * 2011-04-27 2014-01-01 国际商业机器公司 Transparent input/output switching between synchronously mirrored storage volumes
CN102810082A (en) * 2011-06-01 2012-12-05 阿尔特拉公司 Memory controllers with dynamic port priority assignment capabilities
CN102710516A (en) * 2012-05-30 2012-10-03 浪潮电子信息产业股份有限公司 Method for automation deployment under multi-controller storage system environment
CN103634388A (en) * 2013-11-22 2014-03-12 华为技术有限公司 Method for processing restarting of controllers in storage server, related equipment and communication system
CN104991874A (en) * 2015-07-22 2015-10-21 浪潮(北京)电子信息产业有限公司 SCST (SCSI target subsystem for Linux) based multi-controller storage device ALUA (asymmetrical logical unit access) configuration method
CN105430103A (en) * 2015-12-31 2016-03-23 浪潮(北京)电子信息产业有限公司 Dynamic load balancing system based on multi-controller storage
CN106873907A (en) * 2017-01-09 2017-06-20 中国电子科技集团公司第五十二研究所 A kind of multi-controller memory array reads and writes load-balancing method and device

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111190546A (en) * 2019-12-30 2020-05-22 深圳创新科软件技术有限公司 Distributed block storage performance optimization method based on ALUA and local cache
CN111190546B (en) * 2019-12-30 2023-10-20 深圳创新科软件技术有限公司 Distributed block storage performance optimization method based on ALUA and local cache
WO2024103690A1 (en) * 2022-11-16 2024-05-23 苏州元脑智能科技有限公司 Data request method and apparatus, and device and non-volatile readable storage medium

Also Published As

Publication number Publication date
CN107340973B (en) 2021-04-13

Similar Documents

Publication Publication Date Title
Jimenez et al. On the controller placement for designing a distributed SDN control layer
CN100481813C (en) Optimization of routing forwarding database in a network processor
US8750168B2 (en) Methods and systems to store and forward multicast traffic
US10318533B2 (en) Optimized query execution in a distributed data stream processing environment
CN107911299A (en) A kind of route planning method based on depth Q study
CN101969448B (en) Method, system and equipment for searching active node in P2P streaming media system
CN109995650A (en) Path calculation method and device under Multi-dimensional constraint based on SDN network
CN107547283B (en) Management method and device of distributed aggregation group
KR102165865B1 (en) Methods and apparatuses for dynamic load balancing based on genetic-ant colony algorithm in software defined network
CN105721600A (en) Content centric network caching method based on complex network measurement
CN105933236A (en) Method and device for updating SDN (Software Defined Network) flow table
CN106685745B (en) A kind of constructing network topology method and device
CN107340973A (en) A kind of method and system for accessing asynchronous logic
CN107105043A (en) A kind of content center network caching method based on software defined network
CN105704032A (en) Interest packet forwarding method and apparatus
CN102833164B (en) Implementation method, implementation device and switching device of policy-based routing
CN112039767B (en) Multi-data center energy-saving routing method and system based on reinforcement learning
CN104639450A (en) Data package forwarding control method and device and SDN (software defined network) frame system
CN105657054B (en) A kind of content center network caching method based on K mean algorithms
CN109151620A (en) Aggregation group port switching method and device and Optical Line Terminal (OLT) equipment
Wu et al. Optimization design and realization of ceph storage system based on software defined network
CN106612298B (en) A kind of content distribution method and system based on large-scale network node
US9553829B2 (en) Apparatus and method for fast search table update in a network switch
CN109246007A (en) Active and standby port switching method, storage device and the network equipment of aggregation interface
CN106304223A (en) A kind of network mode switching method, Apparatus and system

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