WO2022168399A1 - Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations - Google Patents

Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations Download PDF

Info

Publication number
WO2022168399A1
WO2022168399A1 PCT/JP2021/042313 JP2021042313W WO2022168399A1 WO 2022168399 A1 WO2022168399 A1 WO 2022168399A1 JP 2021042313 W JP2021042313 W JP 2021042313W WO 2022168399 A1 WO2022168399 A1 WO 2022168399A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
deletion
information processing
storage device
recorded
Prior art date
Application number
PCT/JP2021/042313
Other languages
English (en)
Japanese (ja)
Inventor
豊 大石
輝江 渡邊
浩司 松村
理貴 近藤
美咲 大塚
優子 宇野
Original Assignee
富士フイルム株式会社
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 富士フイルム株式会社 filed Critical 富士フイルム株式会社
Priority to JP2022579345A priority Critical patent/JPWO2022168399A1/ja
Publication of WO2022168399A1 publication Critical patent/WO2022168399A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/13—File access structures, e.g. distributed indices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers

Definitions

  • the present disclosure relates to an information processing device, an information processing method, and an information processing program.
  • Japanese Patent Application Laid-Open No. 2015-130078 discloses that the priority of data is determined based on the size of data and the time elapsed since the data was stored in the first storage device, and the data is stored in the first storage device according to the priority.
  • a technique for migrating from a storage device to a second storage device is disclosed.
  • the present disclosure has been made in view of the above circumstances, and provides an information processing device, an information processing method, and an information processing program that can efficiently secure free space in a storage device having a higher transfer speed than a magnetic tape. intended to provide
  • An information processing apparatus of the present disclosure is an information processing apparatus including at least one processor, and the processor reads data recorded on a storage device other than a magnetic tape on which the same data as data recorded on a magnetic tape is recorded.
  • a deletion unit representing a group to be deleted is determined, and for each data recorded in the storage device, the size of the data, the period until the expiration date set for the data, the frequency of access to the data, and the data recorded in the storage device. Deriving the deletion efficiency based on at least one of the elapsed times since then, deriving the sum of the deletion efficiencies for each deletion unit, and deleting the data included in the deletion unit from the storage device in descending order of the derived sum .
  • the processor may determine the deletion unit according to the free space that the processor wishes to secure in the storage device.
  • the processor repeats the process of deleting the objects included in the deletion unit from the storage device in descending order of the derived sum until the free space to be secured in the storage device is secured. good.
  • the processor may delete data included in the deletion unit from the storage device when the free space of the storage device becomes less than a predetermined threshold.
  • the deletion unit may be a magnetic tape.
  • the deletion unit may be a data group in which a plurality of data are grouped into one.
  • the information processing method of the present disclosure determines a deletion unit representing a group for deleting data recorded on a storage device other than a magnetic tape on which the same data as the data recorded on the magnetic tape is recorded, and stores the data in the storage device. For each recorded data, deletion efficiency based on at least one of the size of the data, the period until the expiration date set for the data, the frequency of access to the data, and the elapsed time since the data was recorded on the storage device. , derives the sum of deletion efficiencies for each deletion unit, and deletes the data included in the deletion unit from the storage device in descending order of the derived sum. .
  • the information processing program of the present disclosure determines a deletion unit representing a group for deleting data recorded on a storage device other than a magnetic tape on which the same data as the data recorded on the magnetic tape is recorded, and stores the data in the storage device. For each recorded data, deletion efficiency based on at least one of the size of the data, the period until the expiration date set for the data, the frequency of access to the data, and the elapsed time since the data was recorded on the storage device. , derives the sum of deletion efficiencies for each deletion unit, and deletes data included in the deletion unit from the storage device in descending order of the derived sum. is.
  • FIG. 1 is a block diagram showing an example of the configuration of an information processing system;
  • FIG. FIG. 4 is a diagram for explaining an object;
  • FIG. It is a block diagram which shows an example of the hardware constitutions of an information processing apparatus.
  • 1 is a block diagram showing an example of a functional configuration of an information processing device;
  • FIG. 10 is a diagram for explaining deletion efficiency;
  • FIG. 4 is a diagram for explaining a deletion unit;
  • FIG. 8 is a flowchart illustrating an example of object deletion processing;
  • the information processing system 10 includes an information processing device 12 and a tape library 14 .
  • the information processing device 12 include a server computer and the like.
  • the tape library 14 comprises a plurality of slots (not shown) and a plurality of tape drives 18, each slot storing a magnetic tape T as an example of a recording medium.
  • Each tape drive 18 is connected to the information processing device 12 .
  • the tape drive 18 writes data to or reads data from the magnetic tape T under the control of the information processing device 12 .
  • An example of the magnetic tape T is an LTO (Linear Tape-Open) tape.
  • the magnetic tape T to be written or read is loaded from the slot into the predetermined tape drive 18 .
  • the magnetic tape T is unloaded from the tape drive 18 to the slot in which it was originally stored.
  • a unit handling data to be recorded on the magnetic tape T includes data to be stored by the user, such as document data and image data, and metadata related to the data.
  • data to be stored by the user such as document data and image data
  • metadata is written as "meta".
  • a storage system that handles this object is called an object storage system.
  • the metadata includes, for example, object identification information such as object keys, object names, data sizes, and attribute information such as time stamps.
  • the recording order of the data and the metadata when recording the object on the magnetic tape T is not particularly limited, and may be the order of the metadata and the data, or the order of the data and the metadata.
  • the information processing device 12 includes a CPU (Central Processing Unit) 20, a memory 21 as a temporary storage area, and a non-volatile storage section 22.
  • FIG. The information processing apparatus 12 also includes a display 23 such as a liquid crystal display, an input device 24 such as a keyboard and a mouse, a network I/F (InterFace) 25 connected to a network, and an external I/F to which each tape drive 18 is connected. Including F26.
  • CPU 20 , memory 21 , storage unit 22 , display 23 , input device 24 , network I/F 25 and external I/F 26 are connected to bus 27 .
  • the storage unit 22 is an example of a storage device according to technology disclosed herein.
  • the storage unit 22 is implemented by a HDD (Hard Disk Drive), SSD (Solid State Drive), flash memory, or the like.
  • An information processing program 30 is stored in the storage unit 22 as a storage medium.
  • the CPU 20 reads out the information processing program 30 from the storage unit 22 , expands it in the memory 21 , and executes the expanded information processing program 30 .
  • the information processing device 12 when the information processing device 12 receives an object reading instruction transmitted from the user terminal, it reads the object from the magnetic tape T, records the read object in the storage unit 22, and responds to the user terminal. That is, the same object as the object recorded on the magnetic tape T is recorded in the storage unit 22 . This is the time until the storage unit 22 has a higher transfer speed than the magnetic tape T, and when the user terminal transmits a reading instruction for the same object from the next time onward, the object is returned to the user terminal. This is to shorten the
  • the information processing device 12 performs control to record an object transmitted from the user terminal on the magnetic tape T
  • the object is recorded on the magnetic tape T after being recorded on the storage unit 22 .
  • an expiration date is set for the object recorded in the storage unit 22 as described above.
  • This expiration date is, for example, a certain period based on the time when the object is recorded in the storage unit 22 .
  • the fixed period in this case may differ for each object.
  • the expiration date may be set by the user, or may be a fixed period based on the last access date and time from the user terminal. It should be noted that, in the present embodiment, an object whose expiration date has passed is deleted from the storage unit 22 .
  • the storage unit 22 does not have the capacity to record all the data recorded on all the magnetic tapes T because the cost is higher than that of the magnetic tapes T. For this reason, the capacity of the storage unit 22 may be insufficient only by deleting objects whose expiration date has passed from the storage unit 22 . Therefore, the information processing apparatus 12 has a function of deleting from the storage unit 22 objects that are recorded in the storage unit 22 and that are the same as the objects recorded on the magnetic tape T.
  • the information processing device 12 includes a determination section 40 , a determination section 42 , a first derivation section 44 , a second derivation section 46 and a deletion section 48 .
  • the CPU 20 functions as a determination section 40 , a determination section 42 , a first derivation section 44 , a second derivation section 46 and a deletion section 48 .
  • the determination unit 40 determines whether or not the free space of the storage unit 22 is less than a predetermined threshold TH.
  • the threshold value TH may be, for example, a capacity of a predetermined ratio (for example, 20%) of the total capacity of the storage unit 22 .
  • the determination unit 42 determines a deletion unit representing a unit of deletion of objects recorded in the storage unit 22 .
  • the deletion unit is set by the user, for example. In this case, the determination unit 42 determines the deletion unit based on the setting value input by the user via the input device 24 .
  • a magnetic tape T is an example of a deletion unit.
  • the first derivation unit 44 derives the deletion efficiency for each object recorded in the storage unit 22 based on the size of the object, the period until the expiration date set for the object, and the frequency of access to the object. A specific example of deletion efficiency will be described with reference to FIG.
  • the circle in Figure 5 represents the object, and the size of the circle represents the size of the object.
  • the vertical axis in FIG. 5 represents the period until the expiration date set for the object, and the horizontal axis in FIG. 5 represents the frequency of access to the object.
  • An example of access frequency is the number of accesses per unit time. The access frequency in this case is calculated, for example, by dividing the number of accesses in the most recent predetermined period (for example, 24 hours) by that period.
  • objects A to C have the same size, and object D is smaller than objects A to C. Also, object B and object D have the same period until the expiration date and the same access frequency.
  • Object A has a longer expiration period than objects B to D, has the same access frequency as objects B and D, and has a lower access frequency than object C.
  • Object C has a higher access frequency than objects B and D, and has the same expiration period as objects B and D.
  • the higher the access frequency of an object the higher the possibility that the object will be accessed. That is, the higher the access frequency, the lower the deletion efficiency when deleting an object.
  • the larger the size of an object the larger the capacity to be secured in the storage device when it is deleted. Therefore, the larger the size, the higher the deletion efficiency when deleting an object.
  • the first derivation unit 44 derives the deletion efficiency for each object recorded in the storage unit 22 according to the following formula (1).
  • Efficiency of deletion object size ⁇ period until expiration date / access frequency (1)
  • the second derivation unit 46 derives the sum of the deletion efficiencies derived by the first derivation unit 44 for each object included in the deletion unit.
  • a specific example of the process of deriving the sum of deletion efficiencies for each deletion unit will be described with reference to FIG.
  • FIG. 6 The circle, circle size, vertical axis, and horizontal axis in FIG. 6 are the same as in FIG. As shown in FIG. 6, for ease of explanation, it is assumed that objects A to D have the same size, period until expiration date, and access frequency. 6, objects A and B are recorded on the same magnetic tape T, and objects C and D are recorded on different magnetic tapes T, respectively. It is also assumed here that the deletion unit is the magnetic tape T. FIG. Also, here, it is assumed that sufficient free space can be secured in the storage unit 22 by deleting two objects.
  • the second derivation unit 46 derives the sum of deletion efficiencies for each deletion unit.
  • the deletion unit 48 deletes objects included in the deletion unit from the storage unit 22 in descending order of the sum derived by the second derivation unit 46 .
  • the deletion unit 48 is arranged in descending order of the sum derived by the second derivation unit 46 until the desired free space is secured in the storage unit 22, in descending order of the sum derived by the second derivation unit 46. , the process of deleting the objects included in the deletion unit from the storage unit 22 is repeated.
  • the free space to be secured in the storage unit 22 is, for example, the threshold TH or the threshold TH plus a margin. Note that the free space to be secured in the storage unit 22 may be set by the user via the input device 24 .
  • the CPU 20 executes the information processing program 30 to execute the object deletion process shown in FIG.
  • the object deletion process shown in FIG. 7 is executed, for example, at regular timings.
  • step S10 in FIG. 7 the determination unit 40 determines whether or not the free space of the storage unit 22 is less than the threshold TH. If this determination is affirmative, the process proceeds to step S12. In step S ⁇ b>12 , the determination unit 42 determines a deletion unit representing a group of deletion objects recorded in the storage unit 22 .
  • the first derivation unit 44 derives the deletion efficiency for each object recorded in the storage unit 22 according to the above equation (1), as described above.
  • the second derivation unit 46 derives the sum of the deletion efficiencies derived in step S14 for each object included in each deletion unit determined in step S12.
  • step S18 the deletion unit 48 deletes objects included in the deletion unit from the storage unit 22 in descending order of the sum derived in step S16, as described above.
  • the object deletion process ends. Also, if the determination in step S10 is negative, the object deletion process ends.
  • Elapsed time (hereinafter simply referred to as "elapsed time") may also be used.
  • elapsed time As a specific example, 80% of the objects recorded in the storage unit 22 are recorded within 24 hours, 15% of the objects are recorded within 72 hours, and 5% of the objects are recorded. is read 72 hours after it was recorded.
  • the deletion efficiency is determined based on at least one of the size of the object, the period until the expiration date set for the object, the frequency of access to the object, and the elapsed time since the object was recorded in the storage unit 22. can be derived.
  • the magnetic tape T is applied as the deletion unit, but it is not limited to this.
  • a deletion unit a packed object in which a plurality of objects are grouped together, a magnetic tape T wrap, a storage pool including a plurality of magnetic tapes T, or the like may be applied.
  • a packed object is an example of a data group in which multiple pieces of data are grouped together.
  • the determination unit 42 may determine the deletion unit according to the free space to be secured in the storage unit 22 .
  • the determining unit 42 may increase the deletion unit as the free space to be secured in the storage unit 22 increases.
  • the deletion unit becomes larger in order of packed object, wrap of magnetic tape T, magnetic tape T, and storage pool including multiple magnetic tapes T.
  • the hardware of the processing unit that executes various processes such as the determination unit 40, the determination unit 42, the first derivation unit 44, the second derivation unit 46, and the deletion unit 48
  • the various processors include, in addition to the CPU, which is a general-purpose processor that executes software (programs) and functions as various processing units, circuits such as FPGAs (Field Programmable Gate Arrays), etc.
  • Programmable Logic Device PLD which is a processor whose configuration can be changed, ASIC (Application Specific Integrated Circuit) etc. Circuits, etc. are included.
  • One processing unit may be composed of one of these various processors, or a combination of two or more processors of the same type or different types (for example, a combination of multiple FPGAs, a combination of a CPU and an FPGA). combination). Also, a plurality of processing units may be configured by one processor.
  • a single processor is configured by combining one or more CPUs and software.
  • a processor functions as multiple processing units.
  • SoC System on Chip
  • the various processing units are configured using one or more of the above various processors as a hardware structure.
  • an electric circuit combining circuit elements such as semiconductor elements can be used.
  • the information processing program 30 has been pre-stored (installed) in the storage unit 22, but the present invention is not limited to this.
  • the information processing program 30 is provided in a form recorded on a recording medium such as a CD-ROM (Compact Disc Read Only Memory), a DVD-ROM (Digital Versatile Disc Read Only Memory), and a USB (Universal Serial Bus) memory. good too. Further, the information processing program 30 may be downloaded from an external device via a network.

Landscapes

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

Abstract

Le dispositif de traitement d'informations selon l'invention : détermine une unité de suppression représentant un ensemble de données à supprimer, les données étant enregistrées dans un dispositif de stockage autre qu'une bande magnétique sur laquelle sont enregistrées des données qui sont les mêmes que les données enregistrées sur la bande magnétique; dérive une efficacité de suppression, pour chaque élément de données enregistré sur le dispositif de stockage, sur la base d'au moins l'une parmi la taille des données, la période jusqu'à une expiration définie dans les données, la fréquence d'accès aux données et la quantité de temps écoulée depuis que les données ont été enregistrées sur le dispositif de stockage; dérive une efficacité de suppression totale pour chaque unité de suppression; et supprime les données incluses dans les unités de suppression du dispositif de stockage dans l'ordre du total dérivé le plus grand.
PCT/JP2021/042313 2021-02-05 2021-11-17 Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations WO2022168399A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2022579345A JPWO2022168399A1 (fr) 2021-02-05 2021-11-17

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2021-017455 2021-02-05
JP2021017455 2021-02-05

Publications (1)

Publication Number Publication Date
WO2022168399A1 true WO2022168399A1 (fr) 2022-08-11

Family

ID=82741075

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2021/042313 WO2022168399A1 (fr) 2021-02-05 2021-11-17 Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations

Country Status (2)

Country Link
JP (1) JPWO2022168399A1 (fr)
WO (1) WO2022168399A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070061530A1 (en) * 2005-09-09 2007-03-15 Charles-Yves Bourhis Method for storage of digital data in a mainframe data center and associated device
JP2018190192A (ja) * 2017-05-08 2018-11-29 富士通株式会社 ストレージ装置およびストレージ制御プログラム
US20190354307A1 (en) * 2018-05-15 2019-11-21 International Business Machines Corporation Accelerated data removal in hierarchical storage environments

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070061530A1 (en) * 2005-09-09 2007-03-15 Charles-Yves Bourhis Method for storage of digital data in a mainframe data center and associated device
JP2018190192A (ja) * 2017-05-08 2018-11-29 富士通株式会社 ストレージ装置およびストレージ制御プログラム
US20190354307A1 (en) * 2018-05-15 2019-11-21 International Business Machines Corporation Accelerated data removal in hierarchical storage environments

Also Published As

Publication number Publication date
JPWO2022168399A1 (fr) 2022-08-11

Similar Documents

Publication Publication Date Title
TW201941189A (zh) 記錄裝置、讀取裝置、記錄方法、記錄程式記憶媒體、讀取方法、讀取程式記憶媒體以及磁帶
WO2021171814A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations
WO2022168399A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations
EP3920184A1 (fr) Dispositif d'enregistrement, procédé d'enregistrement, programme d'enregistrement, et bande magnétique
WO2022176344A1 (fr) Dispositif, procédé et programme de traitement d'informations
WO2022044435A1 (fr) Dispositif, procédé et programme de traitement d'informations
WO2022163078A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations, et programme de traitement d'informations
WO2022172548A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations, et programme de traitement d'informations
WO2021054243A1 (fr) Dispositif d'enregistrement, procédé d'enregistrement, programme d'enregistrement, et bande magnétique
WO2022049831A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations
WO2022044434A1 (fr) Dispositif, procédé et programme de traitement d'informations
WO2022172549A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations
WO2021186774A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations
EP4220418A1 (fr) Appareil, procédé et programme de traitement d'informations
WO2021171815A1 (fr) Dispositif, procédé et programme de traitement d'informations
WO2022172550A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations, et programme de traitement d'informations
WO2021171816A1 (fr) Dispositif, procédé et programme de traitement d'informations
WO2022185650A1 (fr) Dispositif, procédé et programme de traitement d'informations
WO2021181859A1 (fr) Dispositif, procédé et programme de transfert
WO2022044433A1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations, et programme de traitement d'informations
JP2024053282A (ja) 情報処理装置、情報処理方法、及び情報処理プログラム
US20230186945A1 (en) Information processing apparatus, information processing method, and information processing program
US20230065229A1 (en) Information processing apparatus, information processing method, and information processing program
US20240094935A1 (en) Information processing apparatus, information processing method, and information processing program
US20230064391A1 (en) Information processing apparatus, information processing method, and information processing program

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21924785

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2022579345

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21924785

Country of ref document: EP

Kind code of ref document: A1