Patents by Inventor Ryo Hanafusa

Ryo Hanafusa has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11914868
    Abstract: A storage system comprises nodes and drives, and includes at least one mounting area to install the drives. A node manages a parity group constituted of the plurality of drives; generates, in a case where a target drive that is installed in a first mounting area and that belongs to a first parity group is to be moved from the first mounting area to a second mounting area, difference information regarding a storage area where data was written into the target drive during a period in which the target drive is moved from the first mounting area to the second mounting area; and restore data written into the storage area by using data stored in other drives than the target drive that belongs to the first parity group based on the difference information, and write the data into the target drive that has been moved to the second mounting area.
    Type: Grant
    Filed: September 2, 2022
    Date of Patent: February 27, 2024
    Assignee: Hitachi, Ltd.
    Inventors: Ryo Hanafusa, Tomohiro Yoshihara, Ryosuke Tatsumi, Hiroki Fujii
  • Patent number: 11874873
    Abstract: A subgraph extraction means 71 extracts, from a document structure graph indicating a document structure, a subgraph as a part of the document structure graph on the basis of inter-word relationship information indicating a relationship between a word and a word. A rule creation means 72 creates a rule for extracting a subgraph having the same structure as the subgraph from the document structure graph. A knowledge addition means 73 extracts a subgraph from the document structure graph in accordance with the rule and adds the information indicated by the subgraph to the inter-word relationship information.
    Type: Grant
    Filed: March 7, 2018
    Date of Patent: January 16, 2024
    Assignee: NEC CORPORATION
    Inventors: Masafumi Oyamada, Ryo Hanafusa
  • Publication number: 20230244387
    Abstract: A storage system comprises nodes and drives, and includes at least one mounting area to install the drives. A node manages a parity group constituted of the plurality of drives; generates, in a case where a target drive that is installed in a first mounting area and that belongs to a first parity group is to be moved from the first mounting area to a second mounting area, difference information regarding a storage area where data was written into the target drive during a period in which the target drive is moved from the first mounting area to the second mounting area; and restore data written into the storage area by using data stored in other drives than the target drive that belongs to the first parity group based on the difference information, and write the data into the target drive that has been moved to the second mounting area.
    Type: Application
    Filed: September 2, 2022
    Publication date: August 3, 2023
    Inventors: Ryo HANAFUSA, Tomohiro YOSHIHARA, Ryosuke TATSUMI, Hiroki FUJII
  • Publication number: 20200410168
    Abstract: A subgraph extraction means 71 extracts, from a document structure graph indicating a document structure, a subgraph as a part of the document structure graph on the basis of inter-word relationship information indicating a relationship between a word and a word. A rule creation means 72 creates a rule for extracting a subgraph having the same structure as the subgraph from the document structure graph. A knowledge addition means 73 extracts a subgraph from the document structure graph in accordance with the rule and adds the information indicated by the subgraph to the inter-word relationship information.
    Type: Application
    Filed: March 7, 2018
    Publication date: December 31, 2020
    Applicant: NEC CORPORATION
    Inventors: Masafumi OYAMADA, Ryo HANAFUSA
  • Patent number: 10394480
    Abstract: It is possible to prevent unoccupied blocks from being depleted by a write of logical-physical management information. A processor is capable of performing an unoccupied user block generation process by moving user data stored in allocated user blocks in order to generate unoccupied user blocks serving as unoccupied blocks among allocated user blocks, and performing an unoccupied meta block generation process by moving meta data stored in allocated meta blocks in order to generate unoccupied meta blocks serving as unoccupied blocks among the allocated meta blocks. The processor calculates the number of unoccupied meta blocks to be consumed, that is, the number of unoccupied meta blocks to be consumed by the unoccupied user block generation process. The processor performs the unoccupied meta block generation process based on the number of unoccupied meta blocks to be consumed.
    Type: Grant
    Filed: January 22, 2016
    Date of Patent: August 27, 2019
    Assignee: Hitachi, Ltd.
    Inventors: Masahiro Tsuruya, Ryo Hanafusa, Osamu Kawaguchi
  • Publication number: 20180314426
    Abstract: It is possible to prevent unoccupied blocks from being depleted by a write of logical-physical management information. A processor is capable of performing an unoccupied user block generation process by moving user data stored in allocated user blocks in order to generate unoccupied user blocks serving as unoccupied blocks among allocated user blocks, and performing an unoccupied meta block generation process by moving meta data stored in allocated meta blocks in order to generate unoccupied meta blocks serving as unoccupied blocks among the allocated meta blocks. The processor calculates the number of unoccupied meta blocks to be consumed, that is, the number of unoccupied meta blocks to be consumed by the unoccupied user block generation process. The processor performs the unoccupied meta block generation process based on the number of unoccupied meta blocks to be consumed.
    Type: Application
    Filed: January 22, 2016
    Publication date: November 1, 2018
    Inventors: Masahiro TSURUYA, Ryo HANAFUSA, Osamu KAWAGUCHI
  • Patent number: 9836711
    Abstract: In order to reduce the load of an approval process when approval is required to execute computation jobs using computer resources, the job execution system according to the present invention groups multiple computation jobs and then requests approval in units of groups, and when approval with respect to a group is obtained, all of the computation jobs included in that group are treated as having obtained approval.
    Type: Grant
    Filed: May 17, 2012
    Date of Patent: December 5, 2017
    Assignee: Hitachi, Ltd.
    Inventor: Ryo Hanafusa
  • Publication number: 20150127413
    Abstract: In order to reduce the load of an approval process when approval is required to execute computation jobs using computer resources, the job execution system according to the present invention groups multiple computation jobs and then requests approval in units of groups, and when approval with respect to a group is obtained, all of the computation jobs included in that group are treated as having obtained approval.
    Type: Application
    Filed: May 17, 2012
    Publication date: May 7, 2015
    Inventor: Ryo Hanafusa