公开(公告)号：US20210141538A1

公开(公告)日：2021-05-13

申请号：US17012423

申请日：2020-09-04

Applicant: Hitachi, Ltd.

Inventor： Hideyuki SAKAI ,  Masaharu UKEDA ,  Tomoya OHTA ,  Soichi TAKASHIGE ,  Shinichi HAYASHI

IPC: G06F3/06

Abstract: Volume deployment is optimized while adopting layering corresponding to IO density is adopted. A storage management apparatus calculates remaining IO density based on an amount of remaining IOPS and an amount of a remaining capacity in IOPS and a capacity that are providable by a node, the remaining IOPS and the remaining capacity being not allocated to any volume, controls the layers of the node based on the remaining IO density, selects a node on which a volume is to be deployed based on the difference between the IO density of a deployment target volume and the remaining IO density of the node, and determines a node having the smallest difference between the IO density of the deployment target volume and the remaining IO density of the node in the selection of the node as a deployment destination of the volume.

公开(公告)号：US20220300319A1

公开(公告)日：2022-09-22

申请号：US17480189

申请日：2021-09-21

Applicant: Hitachi, Ltd.

Inventor： Shinichi HAYASHI

IPC: G06F9/48 ,  G06F7/57 ,  G06F9/50

Abstract: An arithmetic operation method includes: a simultaneous execution quantity calculation step of calculating a simultaneous execution quantity of the subtasks at each time of day on the basis of resources used by each of the subtasks and available resources at each time of day; an inexpensive remaining quantity calculation step of creating an inexpensive executability table indicating an inexpensive remaining quantity that is a quantity of tasks which may be executed by the inexpensive execution unit at each time of day on the basis of a completion date and time when the arithmetic operations of the plurality of subtasks should be completed, and the simultaneous execution quantity; and an execution instruction step of causing each of the subtasks to be executed by either the inexpensive execution unit or the expensive execution unit with reference to the inexpensive executability table.

公开(公告)号：US20220156101A1

公开(公告)日：2022-05-19

申请号：US17469605

申请日：2021-09-08

Applicant: Hitachi, Ltd.

Inventor： Kiyomi WADA ,  Shinichi HAYASHI

IPC: G06F9/455 ,  G06F9/355

Abstract: A scaling system ranges over a first base in which a first calculating apparatus having first and second worker nodes operates, and a second base in which a storage apparatus connected to the first base by a network is set. The storage apparatus includes first and second network ports, and first and second volumes accessed by first and second worker node, respectively. A second calculating apparatus is further set in the first base, and the second worker node is moved to the second calculating apparatus and operates as a third worker node and the second volume communicates with the third worker node through the second network port if the transfer rate of the first calculating apparatus or the transfer rate of the first network port exceeds a predetermined threshold when the first and second volumes are in communication with the first calculating apparatus through the first network port.

公开(公告)号：US20210288871A1

公开(公告)日：2021-09-16

申请号：US17328514

申请日：2021-05-24

Applicant: HITACHI, LTD.

Inventor： Katsunori SUZUKI ,  Satoshi KANEKO ,  Shinichi HAYASHI ,  Akira KONO

IPC: H04L12/24 ,  G09G5/38

Abstract: Visibility of relevance of detailed configurations is improved while deterioration of the visibility of a general configuration between nodes is suppressed. A node coordinate calculation process calculates, upon calculation of deployment coordinates of each node, a degree of importance of an infrastructure resource and a degree of importance of an application, and weights the distance between the application node and the infrastructure node with the reciprocal of the degree of importance of the infrastructure node. Then, the node coordinate calculation process determines deployment of the application node such that the application node is deployed in the proximity of a comparatively important infrastructure node, and determines deployment of the application node on the basis of the degrees of importance of the applications such that a comparatively important application is deployed closely to the infrastructure node.

公开(公告)号：US20210105223A1

公开(公告)日：2021-04-08

申请号：US17014109

申请日：2020-09-08

Applicant: Hitachi, Ltd.

Inventor： Hiroyoshi JUTORI ,  Tomohiro MORIMURA ,  Satoshi KANEKO ,  Shinichi HAYASHI

IPC: H04L12/911 ,  H04L12/927 ,  H04L12/24

Abstract: A support apparatus and method are capable of facilitating work to optimize deployment locations of information processing resources and are respectively allocated to one or more allocation targets. A deployment location candidate is calculated, which is an appropriate deployment location of each of the information processing resources allocated to each of the allocation targets, and a reducible cost is determined when the information processing resource is allocated to the deployment location candidate, with respect to each information processing resource. The reducible cost is displayed when the deployment of the information processing resource allocated to the allocation target is optimized, and the importance of the allocation target is determined by associating the reducible cost with the importance of the allocation target with respect to each allocation target on the basis of the calculation result of the reducible cost for each information processing resource.

公开(公告)号：US20210065082A1

公开(公告)日：2021-03-04

申请号：US16808205

申请日：2020-03-03

Applicant: Hitachi, Ltd.

Inventor： Atsumi TERAYAMA ,  Shinichi HAYASHI

IPC: G06Q10/06

Abstract: A system includes a first processing unit that executes a first planning algorithm to evaluate a migration destination resource based on a difference between performance of a migration target resource and reference performance and output a first solution as a migration destination resource state string that indicates a configuration and performance of the migration destination resource that is evaluated as a migration destination, a second processing unit that executes a second planning algorithm to output a second solution according to a mathematical programming method as the migration destination resource state string for the evaluated migration destination resource and uses the first solution to correct the second solution, and a third processing unit that outputs, between the first solution satisfying a time limit and the corrected second solution, a solution in which quality of the resource configuration change plan is estimated and an evaluation value of the plan meets a condition.

公开(公告)号：US20160070497A1

公开(公告)日：2016-03-10

申请号：US14942555

申请日：2015-11-16

Applicant: HITACHI, LTD.

Inventor： Shinichi HAYASHI ,  Tomohiro KAWAGUCHI

IPC: G06F3/06

CPC classification number: G06F3/0619 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0631 ,  G06F3/0647 ,  G06F3/0649 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0685 ,  G06F3/0689

Abstract: Systems and methods directed to changing tiers for a storage area that utilizes thin provisioning. Systems and methods check the area subject to a tier change command and change the tier based on the tier specified in the tier change command, and the tier presently associated with the targeted storage area. The pages of the systems and methods may be further restricted to one file per page.

公开(公告)号：US20150347311A1

公开(公告)日：2015-12-03

申请号：US14759590

申请日：2013-01-09

Applicant: HITACHI, LTD.

Inventor： Toru TANAKA ,  Shinichi HAYASHI ,  Akihisa NAGAMI

IPC: G06F12/08 ,  G06F3/06

CPC classification number: G06F12/0897 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0649 ,  G06F3/0683 ,  G06F3/0685 ,  G06F12/0873 ,  G06F2212/313

Abstract: Since an application or an administrator of the application copies data having a high frequency of reference from a storage to an upper tier within a server or the storage, when I/O concentrates to data other than the data copied to the server by the application, the performance of the storage is deteriorated. Therefore, according to the present invention, a management computer performs tier management of data stored in any of multiple types of storage devices disposed in the storage system according to an access status thereof, and in conjunction with the application, also sets data stored in the multiple types of storage device other than the data accessed by the processing of the application as a target of tier management.

Abstract translation: 由于应用程序或应用程序的管理员将具有从服务器或存储器中的存储器的高频率参考的数据复制到服务器或存储器中的上层，当I / O集中于除应用程序复制到服务器的数据之外的数据时， 存储的性能恶化。 因此，根据本发明，管理计算机根据其存取状态对存储在存储系统中的多种类型的存储装置中存储的数据进行层次管理，结合应用，还将存储在存储系统 多种类型的存储设备，而不是通过处理应用程序访问的数据作为层级管理的目标。

公开(公告)号：US20130262774A1

公开(公告)日：2013-10-03

申请号：US13892495

申请日：2013-05-13

Applicant: Hitachi, Ltd.

Inventor： Shinichi HAYASHI ,  Toshio OTANI

IPC: G06F3/06 ,  G06F12/12

CPC classification number: G06F3/0604 ,  G06F3/0631 ,  G06F3/0643 ,  G06F3/0647 ,  G06F3/0667 ,  G06F3/0685 ,  G06F12/06 ,  G06F12/12 ,  G06F12/121

Abstract: Exemplary embodiments provide a technique to manage object based tier to improve allocation of media to unallocated area. In one embodiment, a method of allocating an area of a logical volume to an unallocated area of a virtual volume for a write command comprises: calculating an object location of an object based on the write command and an object allocation information, the write command containing a virtual volume name and a virtual volume address of a virtual volume; selecting a tier from a plurality of tiers based on the calculated object location and an object and tier definition information; selecting a media type from a plurality of media types based on the selected tier and a tier and media definition information; and selecting a logical volume from a plurality of logical volumes based on the virtual volume specified by the write command, the object allocation information, a pool information, and the selected media type.

Abstract translation: 示例性实施例提供了一种管理基于对象的层以改进对未分配区域的媒体分配的技术。 在一个实施例中，将逻辑卷的区域分配给用于写入命令的虚拟卷的未分配区域的方法包括：基于写入命令和对象分配信息计算对象的对象位置，所述写入命令包含 虚拟卷的虚拟卷名称和虚拟卷地址; 基于所计算的对象位置和对象和层定义信息从多个层中选择层; 基于所选择的层以及层和媒体定义信息从多种媒体类型中选择媒体类型; 以及基于由所述写入命令指定的所述虚拟卷，所述对象分配信息，池信息以及所选择的媒体类型，从多个逻辑卷中选择逻辑卷。

公开(公告)号：US20130097378A1

公开(公告)日：2013-04-18

申请号：US13705419

申请日：2012-12-05

Applicant: HITACHI, LTD.

Inventor： Yuichi TAGUCHI ,  Shinichi HAYASHI

IPC: G06F3/06

CPC classification number: G06F3/067 ,  G06F3/0613 ,  G06F3/0635 ,  G06F3/065 ,  G06F3/0664 ,  H04L47/10 ,  H04L47/266 ,  H04L47/30 ,  H04L47/50 ,  H04L49/901 ,  H04L49/9078

Abstract: In a storage system in which computers are connected via a network, in order to avoid a state where communication quality is degraded due to poor performance of an apparatus constituting the network, for a transfer data amount, an amount of data sent out from a storage apparatus is suppressed. Moreover, the storage apparatus inhibits a read-ahead process, in accordance with the suppression of the sending out of the data. Furthermore, proper load allocation is realized by migrating a logical storage unit provided by the storage, to another network interface or a second storage apparatus, without changing a configuration of the network.

Abstract translation: 在通过网络连接计算机的存储系统中，为了避免由于构成网络的装置的性能差而导致通信质量下降的状态，对于传输数据量，从存储器发送的数据量 装置被抑制。 此外，存储装置根据发送数据的抑制来禁止预读处理。 此外，通过将由存储器提供的逻辑存储单元迁移到另一网络接口或第二存储装置而实现适当的负载分配，而不改变网络的配置。