CN103119567B - For the system and method in managing virtual tape pool territory - Google Patents

For the system and method in managing virtual tape pool territory Download PDF

Info

Publication number
CN103119567B
CN103119567B CN201180045042.1A CN201180045042A CN103119567B CN 103119567 B CN103119567 B CN 103119567B CN 201180045042 A CN201180045042 A CN 201180045042A CN 103119567 B CN103119567 B CN 103119567B
Authority
CN
China
Prior art keywords
volume
interim
vtl node
vtl
erasing
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.)
Expired - Fee Related
Application number
CN201180045042.1A
Other languages
Chinese (zh)
Other versions
CN103119567A (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.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
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 International Business Machines Corp filed Critical International Business Machines Corp
Publication of CN103119567A publication Critical patent/CN103119567A/en
Application granted granted Critical
Publication of CN103119567B publication Critical patent/CN103119567B/en
Expired - Fee Related 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/0602Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0614Improving the reliability of storage systems
    • G06F3/0617Improving the reliability of storage systems in relation to availability
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/065Replication mechanisms
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0628Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0652Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601Interfaces specially adapted for storage systems
    • G06F3/0668Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671In-line storage system
    • G06F3/0683Plurality of storage devices
    • G06F3/0686Libraries, e.g. tape libraries, jukebox

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)
  • Library & Information Science (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Studio Circuits (AREA)
  • Storage Device Security (AREA)

Abstract

Provide the system and method for managing virtual tape library (VTL) territory that can be coupled to main frame.A kind of system comprises the multiple VTL node being configured to store multiple interim erasing volume.Each VTL node comprises the processor being at least partially configured to perform following methods.A kind of method comprises the request receiving the volume one of multiple VTL node of removal from main frame, and forward this volume to interim classification in response to receiving this request, wipe the data in this volume and this volume is classified as and wipe volume temporarily, and provide interim entitlement of wiping volume based on the preassigned of multiple VTL node to the VTL node of in multiple VTL node.Additionally provide a kind of computer-readable storage medium comprising computer code for performing above method.

Description

For the system and method in managing virtual tape pool territory
Technical field
Present invention relates in general to storage system, and more specifically, relate to the system and method for managing virtual tape pool territory.
Background technology
Virtual tape library (VTL) is usually such as by using disk to provide high speed tape pool to main frame.Generally speaking, main frame uses following tape pool:
1) roll coil of strip (being after this called " volume ") is inserted tape pool by main frame.This volume is undertaken identifying by volume serial number (VOLSER) and the volume inserted is sorted under the classification of " insertion " by name.Classification is one of attribute of volume and must involves in row definition to represent the state and use that twist in special time to each;
2) volume inserted in classification is forwarded to " interim (scratch) " classification by main frame.Interim classification is used to store blank and/or reusable band;
3) loading of host requests volume.Tape pool loads the volume of asking and provides this volume to main frame.Main frame is by specifying VOLSER and asking the loading of concrete volume (specify and load) or pass through to specify classification and ask any volume in this classification (classification loading) to ask to load.When writing new data when beginning place from volume, generally designate interim classification and perform classification loading operation (being after this called " temporarily loading ");
4) main frame forwards loaded volume to " privately owned " classification and performs I/O (I/O) operation;
5) after completing I/O operation, host requests " removal " is rolled up; And
6) about the volume no longer needed among the volume in privately owned classification, main frame forwards this volume to interim classification.Substantially, the data be transferred in the volume of interim classification be no longer guaranteed and can at this moment between put and wiped to make volume to be reused in time.The main frame that twists in interim classification asks to be provided to main frame when loading volume subsequently.
In interim classification, volume is not remaining, tape pool identifies does not have available blank or reusable band.If interim loading asked under these circumstances by main frame, then load and ask unsuccessfully.
VTL utilizes memory disk to perform above function.Compared with physical tape library, utilize memory disk to have many advantages, be particularly that VTL can to carry out response aspect to interim loading request at a high speed.Because logical volume carries out preparing instead of actual loading physics band, so VTL can respond to main frame fast on disk.
In addition, VTL does not wipe the data in rolling up at volume once being transferred to interim classification usually immediately, thus user can recover the data of the volume being forwarded to interim classification by it mistakenly.On the contrary, data were intactly retained predetermined time amount (such as, 24 hours) before it is wiped free of.Thus, to be among interim classification and the volume that its data are not also wiped free of is referred to as " temporarily not wiping " volume, and the volume that its data were completely erased after predetermined time amount is in the past referred to as " temporarily wiping " volume.
In addition, many VTL support the cluster (clustering) of multiple VTL.The target of VTL being carried out to cluster is the quantity and the disk size that increase virtual tapes driver, and realizes higher availability and disaster recovery scheme by data Replica.In general, VTL is interconnected via Internet protocol (IP) network etc., and shows as single virtual tape pool to main frame.Here, whole cluster configuration is referred to as in " VTL territory ", and each VTL forming VTL territory is referred to as " VTL node ".
When main frame perform in cluster configuration insert or load operation time, the request command carrying out from host by this main frame with it physical connection VTL node receive.VTL node communicates mutually in VTL territory, have consistance and return reply to main frame.
In the configuration of VTL cluster, two VTL node also may be connected to a main frame, and main frame operates, thus main frame sends separately loading request to each VTL node.Under these circumstances, the interim classification usually using two VTL node common.
During operation, expect that conventional VTL node follows the request of from host by operating as follows:
1) VTL node carries out mutually communicating to check in VTL territory the volume (such as, do not wipe volume temporarily and wipe volume temporarily) that there is how many interim classification; And
2) VTL node wipes interim the volume selecting in volume to be wiped free of in the possible time the earliest, and this volume is provided to main frame.If do not exist in whole VTL territory and wipe volume temporarily, then VTL node is selected to be transferred to the volume of interim classification at Possible event the earliest and this volume is provided to main frame temporarily not wiping in volume.
If ask to perform these operations when loading at main frame at every turn, VTL node will need to select interim volume when intercoming mutually to ask at main frame to load at every turn, and this sacrifices the loading performance of the main target as VTL node.Overcome VTL node to need to ask a kind of routine techniques loading phase intercommunication to provide at main frame at every turn and determine which volume will be carried out by which VTL node the method that manages in advance.That is, for each volume, VTL node is designated as " owner " of this volume, and this entitlement can shift between VTL node.Volume owner VTL node has exclusive access to the user data of this volume and metadata.When VTL node needs to load volume and this node is not the current owners of this volume, first VTL node obtains the entitlement of the volume in VTL territory and becomes the new owner of this volume.
Comprise be transferred to interim classification twist in owner's node that interior all volumes have defined its oneself all the time.Specifically, when main frame to VTL send interim load request time, VTL node to be among interim classification and its owner time this VTL node volume select the earliest volume, and provide this volume the earliest to main frame.Thus, even if there is not interim erasing volume and volume does not the earliest wipe volume temporarily, VTL node is also wiped at that time and is not wiped the data in volume and subsequently this volume be provided to main frame temporarily.Only when VTL node is not among interim classification and its owner is the volume of this VTL node, this VTL node just communicates with other VTL node in VTL territory.Here, VTL node to select in VTL territory volume the earliest, by the ownership transfer rolled up the earliest to himself, and provides this volume the earliest subsequently to main frame.
Although the method is optimized the interim performance that loads by minimizing communication between VTL node, the communication eliminated between VTL node may cause other inefficiency problem.At least some inefficiency problem experienced when not communicating mutually to multiple VTL node is below described:
1) by two or more nodes (such as, VTL node 0 and VTL node 1) in the cluster configuration that forms, VTL node 0 has the quantity of proprietorial interim volume to it and VTL node 1 has between the quantity of proprietorial interim volume may there is significant difference to it.Such as, VTL node 0 may have many interim volume VTL node 1 and then only may have seldom interim volume:
2) in this case, the speed of mainframe box interim classification transmission volume roughly may send to VTL node with main frame that temporarily to load the speed of asking identical;
3) in this case, should there is its enough owner is that the interim of VTL node 0 is not wiped volume and wipe volume temporarily.Here, receive from main frame load request time, it is volume the earliest in the interim erasing volume of VTL node 0 that VTL node 0 returns its owner to main frame.But, on the other hand, there is not interim volume that its owners many are VTL node 1 and also may there is not the interim erasing volume that its owner is VTL node 1.Therefore, when receiving the interim loading request to VTL node 1 from main frame, even if still there is the interim erasing volume that its owner is VTL node 0, VTL node 1 is also that the interim of VTL node 1 not being wiped volume and providing wiped volume to main frame by needing to wipe its owner at the moment; And
4) in this case, its owner is that the volume of VTL node 1 forever may be wiped immediately after main frame forwards volume to interim classification.When user forwards volume to interim classification due to operating mistake, data will be lost completely and cannot be recovered.
Summary of the invention
Various embodiment provides the system for managing virtual tape library (VTL) territory that can be coupled to main frame.A kind of system comprises multiple VTL node, and it is configured to store multiple interim erasing volume and can be coupled to main frame.Each VTL node comprises the processor being configured to be coupled to main frame.In one embodiment, each processor is configured to be received in the request of removal volume one of multiple VTL node from main frame and forward this volume to interim classification in response to receiving this request.Each processor is configured to wipe the data that store in volume and classified as by this volume wipe volume further temporarily, and based on the preassigned of multiple VTL node a VTL node entitlement of this erasing volume being temporarily provided in multiple VTL node.
The various method that other embodiments provide for for managing virtual tape library (VTL) territory that can be coupled to main frame, this VTL territory comprises multiple VTL node, and each VTL node comprises processor and is configured to store multiple interim erasing volume.Method comprises the request receiving the volume one of multiple VTL node of removal from main frame, and forwards this volume to interim classification in response to receiving this request.The method comprises the data that store in this volume of erasing further and classified as by this volume wipes volume temporarily, and based on the VTL node for multiple VTL node predetermined standard, entitlement of this erasing volume is temporarily provided in multiple VTL node.
Additionally provide a kind of physical computer storage medium (such as, there is the electrical connection of one or more circuit, portable computer diskette, hard disk, random access storage device (RAM), ROM (read-only memory) (ROM), Erasable Programmable Read Only Memory EPROM (EPROM or flash memory), optical fiber, portable compact disc ROM (read-only memory) (CD-ROM), optical storage apparatus, magnetic storage apparatus, or above is appropriately combined arbitrarily), it comprises the computer program method for managing virtual tape library (VTL) territory being coupled to main frame, this VTL territory comprises multiple VTL node, each VTL node comprises processor and is configured to store multiple interim erasing volume.Physical computer storage medium comprises a computer code for the request for receiving the volume in one of removal multiple VTL node from main frame, and in response to the computer code receiving this request and to be forwarded to by this volume interim classification.This physical computer storage medium comprises further for wiping the data that store in this volume and this volume being classified as the computer code of interim erasing volume, and for entitlement of this erasing volume being temporarily provided to based on multiple VTL node predetermined standard the computer code of a VTL node in multiple VTL node.
Accompanying drawing explanation
In order to easy understand advantage of the present invention, more specifically describe presenting above the of the present invention of concise and to the point description by reference to specific embodiment illustrated in accompanying drawing.Be appreciated that these diagrams only depict exemplary embodiments of the present invention and therefore do not really want to be considered to limit its scope, by using accompanying drawing, by utilizing extra characteristic and details, present invention is described and explain, wherein:
Fig. 1 is the block diagram of an embodiment of system for managing virtual tape pool (VTL) territory;
Fig. 2 is the process flow diagram of an embodiment of the method that the interim erasing for managing in VTL territory is rolled up; And
Fig. 3 is the process flow diagram of another embodiment of the method that the interim erasing for managing in VTL territory is rolled up.
Embodiment
Various embodiment provides the system and method for managing virtual tape pool (VTL) territory.Additionally provide the computer-readable storage medium of the computer code comprised for managing VTL territory.
Turn to accompanying drawing now, Fig. 1 is the block diagram of an embodiment of system 100 for managing the VTL territory 110 that can be coupled to host computing device 50.At least in the illustrated embodiment, VTL territory 110 comprises VTL node 120 and VTL node 130, and they are arranged to cluster configuration via bus 150 (such as, wired and/or wireless bus).
VTL node 120 is configured to store or " having " multiple roll coil of strip (being after this called " volume "), and comprises the processor 129 to involving in line pipe reason.The volume that VTL node 120 has is configured to store data, thus main frame 50 can perform I/O (I/O) operation in system 100.In addition, each volume is configured to according to twisting in the state of any given special time and comprising classification.
When main frame 50 utilizes volume, twist in VTL node 120 and be transferred to privately owned classification 122.When main frame 50 does not utilize volume, volume is transferred to interim classification 124.In interim classification 124, there are two subclass, namely do not wipe subclass 126 and interim erasing subclass 128 temporarily.
The volume that twists in interim classification 124 has been comprised after main frame 50 removal and has not been wiped subclass 126 temporarily, but the data stored in volume are not also wiped free of.In various embodiments, volume can have been remained in any predetermined time amount after main frame 50 removal at this volume and do not wiped subclass 126 temporarily.In one embodiment, twist in this volume to have been remained in after main frame 50 removal about 24 hours and do not wipe in subclass 126 temporarily.In other embodiments, volume can remain in and temporarily not wipe subclass 126 and be longer than or be shorter than 24 hours after this volume is by main frame 50 removal.By this way, the data in volume can be recovered when rolling up and want to utilize data in the predetermined amount of time stayed and do not wipe subclass 126 temporarily when user or main frame 50.Stayed at volume does not wipe after subclass 126 reaches predetermined amount of time temporarily, and the data in this volume are wiped free of and this volume is transferred to interim erasing subclass 128.
The volume stayed in interim erasing subclass 128 can be used for being loaded by main frame 50.That is, VTL node 120 is configured to, in response to receiving from main frame 50, volume in interim erasing subclass 128 is stayed in the volume request and loading that is used for I/O operation.In addition, VTL node 120 is configured to will roll up in response to enclosing volume and forwards privately owned classification 122 to from interim classification 124 (and particularly wiping subclass 128) temporarily.
Processor 129 is configured to manage the entitlement of the various volumes in VTL node 120 and VTL territory 110.That is, processor 129 is configured to determine at least in part to twist in the entitlement between VTL node 120 and VTL node 130.
In one embodiment, processor 129 is configured to based on for each VTL node (such as, VTL node 120,130) the predetermined interim erasing volume of the overall situation threshold quantity or determine the various entitlement twisted in VTL territory 110 for the threshold quantity of the predetermined interim erasing volume of each corresponding VTL node (such as, VTL node 120,130).In this embodiment, processor 129 to be configured to monitor in interim erasing subclass 128 and interim erasing subclass 138 quantity of the volume among each.
In addition, processor 129 is configured to receive from main frame 50 request that removal stays the volume privately owned classification 122.As the response to it, processor 129 is configured to volume to forward to from privately owned classification 122 do not wipe subclass 126 temporarily.Processor 129 be configured to further this volume stayed do not wipe in subclass 126 reach predetermined time amount after wipe data in this volume.After data are wiped free of, the number of threshold values that processor 129 is configured to interim erasing predetermined with the overall situation for the quantity of to wipe in subclass 128 volume is rolled up temporarily compares, and will wipe number of threshold values that the quantity of rolling up in the subclass 138 interim erasing predetermined to the overall situation roll up temporarily or compare for the number of threshold values that the interim erasing that each corresponding VTL node is predetermined is rolled up.
If interim erasing subclass 128 or interim erasing subclass 138 comprise for corresponding VTL node the interim erasing being less than predetermined quantity and roll up (namely, the predetermined threshold quantity of the overall situation or the threshold quantity determined separately), then processor 129 is configured to provide the entitlement of volume and is forwarded to by this volume and wipes subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) temporarily.If interim erasing subclass 128 and interim erasing subclass 138 include the interim erasing volume being less than its corresponding predetermined quantity, then processor 129 is configured to determine to wipe the volume that subclass 128 and which in interim erasing subclass 138 comprise relative minimum number temporarily, and provide the entitlement of volume to it and this volume is forwarded to this and wipe subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) temporarily.If interim erasing subclass 128 and interim erasing subclass 138 include the interim erasing volume being greater than its corresponding predetermined quantity, then processor 129 is configured to determine to wipe the volume that subclass 128 and which in interim erasing subclass 138 comprise relative minimum number temporarily, and provide the entitlement of volume to it and this volume is forwarded to this and wipe subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) temporarily.
In another embodiment, processor 129 is configured to utilize the quantity of its relative business carrying out operating and interim erasing subclass 128 and the curls inward of interim erasing subclass 138 to determine that each twists in the entitlement in VTL territory 110 based on VTL node 120,130.In this embodiment, processor 129 is configured to generate each interim erasing subclass (namely, interim erasing subclass 128 or interim erasing subclass 138) in volume number and main frame 50 utilize VTL node 120,130 to perform the frequency of I/O operation (namely, main frame 50 utilizes the frequency of the volume from VTL node 120,130) ratio, and provide the entitlement of interim erasing volume based on this ratio.
In this embodiment, processor 129 is configured to receive from main frame 50 request that removal stays the volume privately owned classification 122.As the response to it, processor 129 is configured to volume to forward to from privately owned classification 122 do not wipe subclass 126 temporarily.Processor 129 be configured to further this volume stayed do not wipe in subclass 126 temporarily reach predetermined time amount after data in erasing volume.After data are wiped free of, processor 129 is configured to generate volume number in interim erasing subclass 128 and main frame 50 utilizes VTL node 120 to perform the ratio of the frequency (that is, main frame 50 utilizes the frequency of the volume from node 120) of I/O operation.In addition, processor 129 is configured to generate volume number in interim erasing subclass 138 and main frame 50 utilizes VTL node 130 to perform the ratio of the frequency (that is, main frame 50 utilizes the frequency of the volume from node 130) of I/O operation.
Processor 129 is configured to be compared by this ratio subsequently, and provides the entitlement of volume, and by volume switching to the interim erasing subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) with lowest ratio.If within ratio is in predetermined threshold amount, then processor 129 is configured to provide the entitlement of volume and is forwarded to by this volume by the VTL node utilized with maximum frequency with main frame 50 (namely, VTL node 120 or VTL node 130) the interim erasing subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) that is associated.
VTL node 130 is also configured to store or have multiple volume and comprise processor 139.The volume that VTL node 130 has is configured to store data thus main frame 50 can perform I/O (I/O) operation in system 100.In addition, each volume is configured to twist in the state of any given special time according to this and comprise classification.
When main frame 50 utilizes this volume, twist in VTL node 130 and be transferred to privately owned classification 132.When main frame 50 does not utilize volume, volume is transferred to interim classification 134.In interim classification 134, there are two subclass, namely do not wipe subclass 136 and interim erasing subclass 138 temporarily.
The volume that twists in interim classification 134 has been comprised after main frame 50 removal and has not been wiped subclass 136 temporarily, but the data stored in volume are not also wiped free of.In various embodiments, volume can have been remained in any predetermined time amount after main frame 50 removal at this volume and do not wiped subclass 136 temporarily.In one embodiment, twist in this volume to have been remained in after main frame 50 removal about 24 hours and do not wipe subclass 136 temporarily.In other embodiments, volume can remain in and temporarily not wipe subclass 136 and be longer than or be shorter than 24 hours after this volume is by main frame 50 removal.By this way, the data in volume can be recovered when rolling up and want to utilize data in the predetermined amount of time stayed and do not wipe subclass 136 temporarily when user or main frame 50.Stayed at volume does not wipe after subclass 136 reaches predetermined amount of time temporarily, and the data in this volume are wiped free of and this volume is transferred to interim erasing subclass 138.
The volume stayed in interim erasing subclass 138 can be used for being loaded by main frame 50.That is, VTL node 130 is configured to, in response to receiving from main frame 50, volume in interim erasing subclass 138 is stayed in the volume request and loading that is used for I/O operation.In addition, VTL node 130 is configured to, in response to enclosing volume, volume is particularly wiped subclass 138 from interim classification 134 temporarily and forwards privately owned classification 132 to.
Processor 139 is configured to manage the entitlement of each volume in VTL node 130 and VTL territory 110.That is, processor 139 is configured to determine at least in part to twist in the entitlement between VTL node 120 and VTL node 130.
In one embodiment, processor 139 is configured to based on for each VTL node (such as, VTL node 120,130) the predetermined interim erasing volume of the overall situation threshold quantity or determine that each twists in the entitlement in VTL territory 110 for the threshold quantity of the predetermined scraping erasing volume of each corresponding VTL node (such as, VTL node 120,130).In this embodiment, processor 139 to be configured to monitor in interim erasing subclass 128 and interim erasing subclass 138 quantity of the volume among each.
In addition, processor 139 is configured to receive from main frame 50 request that removal stays the volume privately owned classification 132.As the response to it, processor 139 is configured to volume to forward to from privately owned classification 132 do not wipe subclass 136 temporarily.Processor 139 be configured to further this all stayed do not wipe in subclass 136 reach predetermined time amount after wipe data in this volume.After data are wiped free of, the number of threshold values that processor 139 is configured to interim erasing predetermined with the overall situation for the quantity of to wipe in subclass 138 volume is rolled up temporarily compares, and will wipe number of threshold values that the quantity of rolling up in the subclass 128 interim erasing predetermined to the overall situation roll up temporarily or compare for the predetermined threshold number that the interim erasing of each corresponding VTL node is rolled up.
If interim erasing subclass 128 or interim erasing subclass 138 comprise for corresponding VTL node the interim erasing being less than predetermined quantity and roll up (namely, the predetermined threshold quantity of the overall situation or threshold quantity predetermined separately), then processor 139 is configured to provide the entitlement of volume and is forwarded to by this volume and wipes subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) temporarily.If interim erasing subclass 128 and interim erasing subclass 138 include the interim erasing volume being less than its corresponding predetermined quantity, then processor 139 is configured to determine to wipe the volume that subclass 128 and which in interim erasing subclass 138 comprise relative minimum number temporarily, and provide the entitlement of volume to it and this volume is forwarded to this and wipe subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) temporarily.If interim erasing subclass 128 and interim erasing subclass 138 include the interim erasing volume being greater than its corresponding predetermined quantity, then processor 139 is configured to determine to wipe the volume that subclass 128 and which in interim erasing subclass 138 comprise relative minimum number temporarily, and provide the entitlement of volume to it and this volume is forwarded to this and wipe subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) temporarily.
In another embodiment, processor 139 is configured to utilize the quantity of its relative business carrying out operating and interim erasing subclass 128 and the curls inward of interim erasing subclass 138 to determine that each twists in the entitlement in VTL territory 110 based on VTL node 120,130.In this embodiment, processor 139 is configured to generate each interim erasing subclass (namely, interim erasing subclass 128 or interim erasing subclass 138) in volume number and main frame 50 utilize VTL node 120,130 to perform the frequency of I/O operation (namely, main frame 50 utilizes the frequency of the volume from VTL node 120,130) ratio, and provide the entitlement of interim erasing volume based on this ratio.
In this embodiment, processor 139 is configured to receive from main frame 50 request that removal stays the volume privately owned classification 132.As the response to it, processor 139 is configured to volume to forward to from privately owned classification 122 do not wipe subclass 136 temporarily.Processor 139 be configured to further this volume stayed do not wipe in subclass 136 temporarily reach predetermined time amount after data in erasing volume.After data are wiped free of, processor 139 is configured to generate volume number in interim erasing subclass 128 and main frame 50 utilizes VTL node 120 to perform the ratio of the frequency (that is, main frame 50 utilizes the frequency of the volume from node 120) of I/O operation.In addition, processor 139 is configured to generate volume number in interim erasing subclass 138 and main frame 50 utilizes VTL node 130 to perform the ratio of the frequency (that is, main frame 50 utilizes the frequency of the volume from VTL node 130) of I/O operation.
Processor 139 is configured to be compared by this ratio subsequently and by volume switching to the interim erasing subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) with lowest ratio.If within ratio is in predetermined threshold amount, then processor 139 is configured to provide the entitlement of volume and this volume is forwarded to the VTL node that utilizes with maximum frequency with main frame 50 (namely, VTL node 120 or VTL node 130) the interim erasing subclass (that is, interim erasing subclass 128 or interim erasing subclass 138) that is associated.
Although VTL territory 110 is illustrated and is described as to comprise VTL node 120 and VTL node 130, VTL territory can comprise extra VTL node.In other words, VTL territory 110 can be configured to comprise the VTL node more than two desired by system 100 and/or VTL territory 110.
Turn to Fig. 2 now, Fig. 2 is the process flow diagram of an embodiment for involving in the method 200 that line pipe is managed to the interim erasing comprised in the VTL territory (such as, VTL territory 110) of multiple VTL node (such as, VTL node 120,130).At least in the illustrated embodiment, method 200 is to receive for utilizing the loading request of volume as beginning (frame 205).
Method 200 comprises further will roll up the privately owned classification (frame 210) forwarded in VTL node, and receives the request (frame 215) utilizing volume to perform I/O operation from main frame (such as, main frame 50).To be forwarded to by volume in the interim classification of VTL node interim does not wipe subclass (frame 225) in the request (frame 220) and receiving receiving removal volume.
Stay the data of temporarily not wiping after subclass reaches predetermined time amount in erasing volume at this volume and this volume has been appointed as and wipe subclass (frame 230) temporarily.In one embodiment, twist in obliterated data before remain in and not wipe in subclass about 24 hours temporarily.In other embodiments, volume can remain in not wipe in subclass temporarily and be longer than or be shorter than 24 hours before obliterated data.
After volume is designated as interim erasing volume, the predetermined threshold amount that method 200 comprises the quantity of erasing volume interim in each VTL node and the interim erasing for VTL node are rolled up compares (frame 235).In one embodiment, each VTL node comprises and rolls up identical predetermined threshold amount with wiping temporarily.In another embodiment, at least two VTL node comprise and roll up different predetermined threshold amount from wiping temporarily.
If do not comprise the VTL node of the interim erasing volume being less than its corresponding predetermined threshold amount, then the VTL node (frame 245) that the interim erasing that the entitlement of rolling up is provided to VTL node or has minimum number is rolled up.If there is at least one VTL node comprising the interim erasing volume being less than its corresponding predetermined threshold amount, then method 200 determines whether that more than one VTL comprises interim erasing volume (frame 250) being less than threshold quantity subsequently.
If only have one to comprise to be less than the VTL node of the interim erasing volume of its corresponding predetermined threshold amount, then the entitlement of rolling up is provided to this VTL node (frame 255).If there is multiple VTL node comprising the interim erasing volume being less than its corresponding predetermined threshold amount, then the entitlement of rolling up is provided to VTL node or has the VTL node of minimum interim erasing volume quantity relative to its corresponding predetermined threshold amount of wiping volume temporarily.In the entitlement of rolling up after frame 245,255 or 260 is provided to VTL node, method 200 comprises the request (frame 205) received for another volume, or comprises the request (frame 220) receiving another volume that removal has been utilized in I/O operation.
Turn to Fig. 3 now, Fig. 3 is the process flow diagram of another the embodiment interim erasing comprised in the VTL territory (such as, VTL territory 110) of multiple VTL node (such as, VTL node 120,130) being involved in the method 300 of line pipe reason.At least in the illustrated embodiment, method 300 utilizes the loading request of volume as beginning (frame 205) to receive.
Method 300 comprises further will roll up the privately owned classification (frame 310) forwarded in VTL node, and receives the request (frame 315) utilizing volume to perform I/O operation from main frame (such as, main frame 50).To be forwarded to by volume in the interim classification of VTL node interim does not wipe subclass (frame 325) in the request (frame 320) and receiving receiving removal volume.
Stay the data of temporarily not wiping after subclass reaches predetermined time amount in erasing volume at this volume and this volume has been appointed as and wipe subclass (frame 330) temporarily.In one embodiment, twist in obliterated data before remain in not wipe in subclass temporarily and reach about 24 hours.In other embodiments, volume can remain in not wipe in subclass temporarily and be longer than or be shorter than 24 hours before obliterated data.
After volume is designated as interim erasing volume, method 300 comprises determines that the frequency (frame 335) of the volume used in each in multiple VTL node asked by main frame (50).Interim erasing volume quantity in each VTL node and corresponding determined volume frequency of utilization are compared the ratio (frame 340) to determine interim erasing volume and volume frequency of utilization for each VTL node by method 300 subsequently.
Method 300 comprise further determine two or more VTL node whether comprise identical lowest ratio or be in predetermined quantity each other within lowest ratio (frame 345).The lowest ratio within if two or more VTL node do not comprise identical lowest ratio or are in predetermined quantity each other, then the entitlement of rolling up is provided to the VTL node (frame 350) with lowest ratio.The lowest ratio within if two or more VTL node comprise identical lowest ratio or are in predetermined quantity each other, then the entitlement of rolling up is provided to the VTL node (frame 355) with ceiling rate.In the entitlement of rolling up after frame 350 or 355 is provided to VTL node, method 300 comprises the loading request (frame 305) received for another volume, or comprises the request (frame 320) receiving another volume that removal has been utilized in I/O operation.
Although give at least one exemplary embodiment in describing more than of the present invention, should recognize to there is multiple version.Should also realize that, one or more exemplary embodiment only exemplarily, and and is not intended to limit scope of the present invention, application or configuration by any way.On the contrary, more than describe in detail and will provide the convenient manner implementing exemplary embodiment of the present invention for those skilled in the art, it being understood that and function described in the exemplary embodiment and arrangements of components aspect can carry out various change and do not deviate from as scope of the present invention given in claims and law equivalents thereof.
Person of ordinary skill in the field knows, the present invention can be implemented as system, method or computer program.Therefore, the disclosure can be implemented as following form, that is: can be completely hardware, also can be software (comprising firmware, resident software, microcode etc.) completely, can also be the form that hardware and software combines, be commonly referred to as " circuit ", " module " or " system " herein.In addition, in certain embodiments, the present invention can also be embodied as the form of the computer program in one or more computer-readable medium, comprises computer-readable program code in this computer-readable medium.
The combination in any of one or more computer-readable medium can be adopted.Computer-readable medium can be computer-readable signal media or computer-readable recording medium.Computer-readable recording medium such as may be-but not limited to-the system of electricity, magnetic, optical, electrical magnetic, infrared ray or semiconductor, device or device, or combination above arbitrarily.The example more specifically (non exhaustive list) of computer-readable recording medium comprises: the combination with the electrical connection of one or more wire, portable computer diskette, hard disk, random access memory (RAM), ROM (read-only memory) (ROM), erasable type programmable read only memory (EPROM or flash memory), optical fiber, Portable, compact disk ROM (read-only memory) (CD-ROM), light storage device, magnetic memory device or above-mentioned any appropriate.In this document, computer-readable recording medium can be any comprising or stored program tangible medium, and this program can be used by instruction execution system, device or device or be combined with it.
The program code that computer-readable medium comprises can with any suitable medium transmission, comprises that---but being not limited to---is wireless, electric wire, optical cable, RF etc., or the combination of above-mentioned any appropriate.The computer program code operated for performing the present invention can be write with one or more programming languages or its combination, described programming language comprises object oriented program language-such as Java, Smalltalk, C++, also comprises conventional process type programming language-such as " C " language or similar programming language.Program code can fully perform on the user computer, partly perform on the user computer, as one, independently software package performs, partly part performs on the remote computer or performs on remote computer or server completely on the user computer.In the situation relating to remote computer, remote computer can by the network of any kind---comprise LAN (Local Area Network) (LAN) or wide area network (WAN)-be connected to subscriber computer, or, outer computer (such as utilizing ISP to pass through Internet connection) can be connected to.
Below with reference to the process flow diagram of the method for the embodiment of the present invention, device (system) and computer program and/or block diagram, the present invention is described.Should be appreciated that the combination of each square frame in each square frame of process flow diagram and/or block diagram and process flow diagram and/or block diagram, can be realized by computer program instructions.These computer program instructions can be supplied to the processor of multi-purpose computer, special purpose computer or other programmable data treating apparatus, thus produce a kind of machine, these computer program instructions are performed by computing machine or other programmable data treating apparatus, create the device of the function/operation specified in the square frame in realization flow figure and/or block diagram.
Also can these computer program instructions be stored in the computer-readable medium that computing machine or other programmable data treating apparatus can be made to work in a specific way, like this, the instruction be stored in computer-readable medium just produces the manufacture (manufacture) of the command device (instructionmeans) of the function/operation specified in a square frame comprising in realization flow figure and/or block diagram.Also can computer program instructions be loaded on computing machine, other programmable data treating apparatus or miscellaneous equipment, make to perform sequence of operations step on computing machine, other programmable data treating apparatus or miscellaneous equipment, to produce computer implemented process, thus make the instruction performed on computing machine or other programmable device can provide the process of the function/operation specified in the square frame in realization flow figure and/or block diagram.
Process flow diagram in accompanying drawing and block diagram show system according to multiple embodiment of the present invention, the architectural framework in the cards of method and computer program product, function and operation.In this, each square frame in process flow diagram or block diagram can represent a part for module, program segment or a code, and a part for described module, program segment or code comprises one or more executable instruction for realizing the logic function specified.Also it should be noted that at some as in the realization of replacing, the function marked in square frame also can be different from occurring in sequence of marking in accompanying drawing.Such as, in fact two continuous print square frames can perform substantially concurrently, and they also can perform by contrary order sometimes, and this determines according to involved function.Also it should be noted that, the combination of the square frame in each square frame in block diagram and/or process flow diagram and block diagram and/or process flow diagram, can realize by the special hardware based system of the function put rules into practice or operation, or can realize with the combination of specialized hardware and computer instruction.
Although described one or more embodiment of the present invention in detail, those skilled in the art will appreciate that and can modify for those embodiments and adaptive and scope of the present invention that is that do not deviate from given by following claim.

Claims (14)

1., for managing the system in the virtual tape library VTL territory that can be coupled to main frame, comprising:
Multiple VTL node, it is configured to store multiple interim erasing volume and can be coupled to described main frame, and wherein each VTL node comprises:
Processor, it is configured to be coupled to described main frame, and wherein each processor is configured to:
The request of the volume be used for one of multiple VTL node described in removal is received from described main frame;
In response to receiving described request, and described volume is forwarded to interim classification;
Wipe the data that store in described volume and described volume is classified as and wipe volume temporarily; And
Based on the preassigned for described multiple VTL node, provide the entitlement of described interim erasing volume to a VTL node in described multiple VTL node.
2. system according to claim 1, wherein each processor is configured to further:
The quantity of the interim erasing volume each VTL node had is wiped compared with the predetermined threshold number of rolling up with interim; And
Described entitlement is provided to described VTL node based on described comparison.
3. system according to claim 2, wherein said VTL node has the interim erasing volume being less than described predetermined threshold number.
4. system according to claim 3, wherein said VTL node has the interim erasing volume of minimum number relative to other VTL node in described multiple VTL node.
5. system according to claim 2, wherein said VTL node has the interim erasing volume of minimum number relative to other VTL node in described multiple VTL node.
6. system according to claim 1, wherein each processor is configured to further:
Determine that described host requests uses the frequency of the interim erasing volume in each VTL node in described multiple VTL node;
Determine the ratio of quantity about described frequency of the interim erasing volume that each VTL node has; And
Described entitlement is provided to described VTL node based on described ratio.
7. system according to claim 6, wherein said VTL node has the interim erasing volume of minimum number about described ratio.
8. for managing the method in the virtual tape library VTL territory being coupled to main frame, described VTL territory comprises multiple VTL node, and each VTL node comprises processor and is configured to store multiple interim erasing volume, and described method comprises:
Received the request of the volume be used for one of multiple VTL node described in removal from described main frame by first processor;
In response to receiving described request, and described volume is forwarded to interim classification;
Wipe the data stored in described volume, and described volume is classified as wipe volume temporarily; And
The entitlement of described interim erasing volume is provided to a VTL node in described multiple VTL node based on the preassigned for described multiple VTL node.
9. method according to claim 8, wherein provides the entitlement of described volume to comprise:
The quantity of the interim erasing volume each VTL node had is wiped compared with the predetermined threshold number of rolling up with interim; And
Described entitlement is provided to described VTL node based on described comparison.
10. method according to claim 9, wherein said VTL node has the interim erasing volume being less than described predetermined threshold number.
11. methods according to claim 10, wherein said VTL node has the interim erasing volume of minimum number relative to other VTL node in described multiple VTL node.
12. methods according to claim 9, wherein said VTL node has the interim erasing volume of minimum number relative to other VTL node in described multiple VTL node.
13. methods according to claim 8, wherein provide the entitlement of described volume to comprise:
The frequency that the interim erasing in its VTL node is rolled up is used by each respective processor determination host requests;
The ratio of quantity about described frequency of the interim erasing volume that its VTL node has is determined by each respective processor; And
Described entitlement is provided to described VTL node based on described ratio.
14. methods according to claim 13, wherein said VTL node has the interim erasing volume of minimum number about described ratio.
CN201180045042.1A 2010-09-30 2011-07-29 For the system and method in managing virtual tape pool territory Expired - Fee Related CN103119567B (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US12/894,613 US8595430B2 (en) 2010-09-30 2010-09-30 Managing a virtual tape library domain and providing ownership of scratch erased volumes to VTL nodes
US12/894,613 2010-09-30
PCT/JP2011/004347 WO2012042724A1 (en) 2010-09-30 2011-07-29 Systems and methods for managing a virtual tape library domain

Publications (2)

Publication Number Publication Date
CN103119567A CN103119567A (en) 2013-05-22
CN103119567B true CN103119567B (en) 2016-01-20

Family

ID=45890813

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201180045042.1A Expired - Fee Related CN103119567B (en) 2010-09-30 2011-07-29 For the system and method in managing virtual tape pool territory

Country Status (6)

Country Link
US (1) US8595430B2 (en)
JP (1) JP5414943B2 (en)
CN (1) CN103119567B (en)
DE (1) DE112011103299T5 (en)
GB (1) GB2497465B (en)
WO (1) WO2012042724A1 (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11188270B2 (en) * 2016-05-25 2021-11-30 International Business Machines Corporation Targeted secure data overwrite
US10007452B2 (en) * 2016-08-19 2018-06-26 International Business Machines Corporation Self-expiring data in a virtual tape server
US10013193B2 (en) * 2016-08-19 2018-07-03 International Business Machines Corporation Self-expiring data in a virtual tape server
US11003372B2 (en) 2018-05-31 2021-05-11 Portworx, Inc. Protecting volume namespaces from corruption in a distributed container orchestrator
US10521132B1 (en) 2018-06-17 2019-12-31 International Business Machines Corporation Dynamic scratch pool management on a virtual tape system
US11461193B2 (en) * 2020-09-24 2022-10-04 International Business Machines Corporation Data storage volume recovery management

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6529996B1 (en) * 1997-03-12 2003-03-04 Storage Technology Corporation Network attached virtual tape data storage subsystem
US6745212B2 (en) * 2001-06-27 2004-06-01 International Business Machines Corporation Preferential caching of uncopied logical volumes in an IBM peer-to-peer virtual tape server
CN1781072A (en) * 2003-02-05 2006-05-31 迪利根特技术公司 Tape storage emulation for open systems environments
CN101647017A (en) * 2007-03-26 2010-02-10 国际商业机器公司 Improved sequential media reclamation and replication

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6304880B1 (en) * 1997-12-12 2001-10-16 International Business Machines Corporation Automated reclamation scheduling override in a virtual tape server
US6785697B2 (en) * 2001-03-01 2004-08-31 International Business Machines Corporation Storage reclamation on tape management systems
JP2003043162A (en) 2001-07-30 2003-02-13 Seiko Epson Corp Watch
JP2003058326A (en) 2001-08-17 2003-02-28 Hitachi Ltd Method and device for acquiring backup
JP4082666B2 (en) 2002-11-07 2008-04-30 ソニー・エリクソン・モバイルコミュニケーションズ株式会社 Wireless receiver
JP4559046B2 (en) * 2003-08-04 2010-10-06 株式会社日立製作所 Virtual tape library device
US7620765B1 (en) * 2006-12-15 2009-11-17 Symantec Operating Corporation Method to delete partial virtual tape volumes
JP4983474B2 (en) * 2007-08-10 2012-07-25 富士通株式会社 Virtual library apparatus, virtual library system, and logical volume copying method for virtual library apparatus.
US8082388B2 (en) * 2008-03-27 2011-12-20 International Business Machines Corporation Optimizing operational requests of logical volumes
US8341346B2 (en) * 2010-06-25 2012-12-25 International Business Machines Corporation Offloading volume space reclamation operations to virtual tape systems

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6529996B1 (en) * 1997-03-12 2003-03-04 Storage Technology Corporation Network attached virtual tape data storage subsystem
US6745212B2 (en) * 2001-06-27 2004-06-01 International Business Machines Corporation Preferential caching of uncopied logical volumes in an IBM peer-to-peer virtual tape server
CN1781072A (en) * 2003-02-05 2006-05-31 迪利根特技术公司 Tape storage emulation for open systems environments
CN101647017A (en) * 2007-03-26 2010-02-10 国际商业机器公司 Improved sequential media reclamation and replication

Also Published As

Publication number Publication date
GB201304553D0 (en) 2013-04-24
GB2497465A8 (en) 2013-06-26
GB2497465A (en) 2013-06-12
WO2012042724A1 (en) 2012-04-05
DE112011103299T5 (en) 2013-07-11
JP2013539083A (en) 2013-10-17
CN103119567A (en) 2013-05-22
US8595430B2 (en) 2013-11-26
GB2497465B (en) 2014-07-09
US20120084499A1 (en) 2012-04-05
JP5414943B2 (en) 2014-02-12

Similar Documents

Publication Publication Date Title
CN103119567B (en) For the system and method in managing virtual tape pool territory
US10901619B2 (en) Selecting pages implementing leaf nodes and internal nodes of a data set index for reuse
CN102413156B (en) Distributed data storage system and method
CN103152390B (en) The node configuration method of distributed memory system, device, node and system
CN107122130B (en) Data deduplication method and device
CN107515726A (en) For managing the method and system of storage device
CN113596010B (en) Data processing method, device, node equipment and computer storage medium
CN110018996A (en) A kind of the snapshot rollback method and relevant apparatus of distributed memory system
CN105051708A (en) Apparatus and methods for a distributed memory system including memory nodes
CN112631953A (en) TRIM method and device for solid state disk data, electronic equipment and storage medium
US9164885B2 (en) Storage control device, storage control method, and recording medium
CN110399168A (en) Majority according to disk storage server system start method, device and equipment
CN112650449B (en) Method and system for releasing cache space, electronic device and storage medium
US20160037119A1 (en) Video recording apparatus, and video recording method when temporary network failure occurs
US10659304B2 (en) Method of allocating processes on node devices, apparatus, and storage medium
CN108334457B (en) IO processing method and device
CN113190384B (en) Data recovery control method, device, equipment and medium based on erasure codes
CN103714059A (en) Data updating method and device
CN105278877A (en) Object storage method and device
CN104360959B (en) The method and controller of data storage
CN108121580A (en) The implementation method and device of application notification service
CN109189746B (en) Method, device, equipment and storage medium for realizing universal stream type Shuffle engine
CN111177091B (en) Video pre-distribution storage method, system and storage medium based on XFS file system
CN111405313A (en) Method and system for storing streaming media data
CN109976953A (en) A kind of data back up method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160120

CF01 Termination of patent right due to non-payment of annual fee