Patents by Inventor Tomohiro Morimura

Tomohiro Morimura 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).

  • Publication number: 20200195648
    Abstract: A computer system includes one or more storage devices, and one or more processors. The one or more storage devices store permission management information specifying relations between combinations of an information source and an information type and whether sending information from the information source to an external network system is permitted or prohibited. The one or more processor is configured to receive an information transmission request specifying an information type of first information from a first system of an information source, determine whether sending the first information to outside a network system the first system belongs to is permitted with reference to the permission management information, and select a monitoring/analysis server to receive the first information from the monitoring/analysis servers based on the determination.
    Type: Application
    Filed: September 5, 2019
    Publication date: June 18, 2020
    Applicant: HITACHI, LTD.
    Inventors: Shin NISHIHARA, Tomohiro MORIMURA
  • Publication number: 20200081740
    Abstract: A resource allocation system calculates a performance ratio and a cost for each of a plurality of service tiers. For each of the service tiers, the performance ratio is a ratio of the intended performance to an agreement performance, the agreement performance is a performance that serves as a reference performance of the service tier, the intended performance is a performance calculated for the service tier, and the cost is based on a used capacity of an allocated storage resource among the storage resources belonging to the service tier. The system displays a service tier map that has an axis corresponding to the performance ratio and a second axis orthogonal to the axis and corresponding to the cost. A display object is placed, for each service tier, at a position according to the calculated performance ratio and the calculated cost of the service tier on the service tier map.
    Type: Application
    Filed: March 15, 2019
    Publication date: March 12, 2020
    Inventors: Kiyomi WADA, Shinichi HAYASHI, Tomohiro MORIMURA
  • Patent number: 10333859
    Abstract: In a system, such as a cloud, which allows resource allocation to be flexibly changed in a multi-tenant environment, it is necessary to interchange resources between the tenants. Efficient resource coordination for resource allocation cannot be attained by merely adjusting resource allocation amounts or resource usage amounts. In order to address this problem, the present invention selects an optimum allocation method from among a plurality of resource allocation methods including CPU capping, taking into account each period for which resources must be allocated and the manner in which each tenant uses resources, and then coordinates allocation of resources across the entire system using the selected allocation method. This makes it possible to improve the efficiency of resource coordination even in a multi-tenant environment.
    Type: Grant
    Filed: August 27, 2014
    Date of Patent: June 25, 2019
    Assignee: Hitachi, Ltd.
    Inventors: Kenta Yamasaki, Tomohiro Morimura, Yutaka Kudou, Masaaki Iwasaki
  • Patent number: 9958843
    Abstract: A management system has a topology display screen of a management target system with an area, where icons of system components are typically displayed in the related art, which is embedded and displayed with a graph of a monitor value of the system component. A band having a predetermined width is displayed to show a relation between system display objects indicating the system components. The width of the band is determined by the number of requests which are transmitted or received by the system components. When a time-sequential graph of the monitor value of a system component is displayed, a vertical bar which can be operated by an input/output device is displayed in the graph. When the operation of the vertical bar is detected, an icon indicating integrity of the management target system at a time indicated by the vertical bar is displayed in the vicinity of the vertical bar.
    Type: Grant
    Filed: November 7, 2012
    Date of Patent: May 1, 2018
    Assignee: Hitachi, Ltd.
    Inventors: Kenta Yamasaki, Mariko Miyaki, Yoko Shiga, Tomohiro Morimura
  • Patent number: 9852007
    Abstract: A system management method for a management computer coupled to a computer system, the computer system including a plurality of computers, an operations system being built thereon the computer system, the operations system including a plurality of task nodes each having allocated thereto computer resources, the system management method including: a step of analyzing a configuration of the computer system for specifying a important node, which is an important task node in the operations system; a step of changing an allocation amount of the computer resources allocated to the important node for measuring a load of the operations system; a step of calculating a first weighting representing a strength of associations among the plurality of task nodes based on a measurement result of the load; and a step of specifying a range impacted by a change in the load of the important node based on the calculated first weighting.
    Type: Grant
    Filed: February 12, 2014
    Date of Patent: December 26, 2017
    Assignee: HITACHI, LTD.
    Inventors: Takashi Tameshige, Yutaka Kudou, Tomohiro Morimura, Takeshi Teramura, Daisuke Iizuka, Nobuaki Ozaki
  • Publication number: 20170019345
    Abstract: In a system, such as a cloud, which allows resource allocation to be flexibly changed in a multi-tenant environment, it is necessary to interchange resources between the tenants. Efficient resource coordination for resource allocation cannot be attained by merely adjusting resource allocation amounts or resource usage amounts. In order to address this problem, the present invention selects an optimum allocation method from among a plurality of resource allocation methods including CPU capping, taking into account each period for which resources must be allocated and the manner in which each tenant uses resources, and then coordinates allocation of resources across the entire system using the selected allocation method. This makes it possible to improve the efficiency of resource coordination even in a multi-tenant environment.
    Type: Application
    Filed: August 27, 2014
    Publication date: January 19, 2017
    Inventors: Kenta YAMASAKI, Tomohiro MORIMURA, Yutaka KUDOU, Masaaki IWASAKI
  • Patent number: 9448853
    Abstract: A storage module holds load information obtained by classifying a load on each of virtual machines into groups depending on a fluctuation characteristic. An allocation schedule creation module predicts the load on each of the virtual machines during a predetermined period based on the load information and a rule defined for each of the groups, determining, for each of the groups, an allocation amount of the physical computing resource to be allocated to at least one of the virtual machines classified into the each of the groups and a time slot for allocation based on the predicted load on each of the virtual machines, and creating a schedule including information on the allocation amount and the time slot that have been determined. A schedule execution module allocates the physical computing resource to each of the virtual machines based on the schedule.
    Type: Grant
    Filed: March 13, 2015
    Date of Patent: September 20, 2016
    Assignee: Hitachi, Ltd.
    Inventors: Tomohiro Morimura, Kojiro Nakayama
  • Publication number: 20160210175
    Abstract: A storage module holds load information obtained by classifying a load on each of virtual machines into groups depending on a fluctuation characteristic. An allocation schedule creation module predicts the load on each of the virtual machines during a predetermined period based on the load information and a rule defined for each of the groups, determining, for each of the groups, an allocation amount of the physical computing resource to be allocated to at least one of the virtual machines classified into the each of the groups and a time slot for allocation based on the predicted load on each of the virtual machines, and creating a schedule including information on the allocation amount and the time slot that have been determined. A schedule execution module allocates the physical computing resource to each of the virtual machines based on the schedule.
    Type: Application
    Filed: March 13, 2015
    Publication date: July 21, 2016
    Inventors: Tomohiro MORIMURA, Kojiro NAKAYAMA
  • Publication number: 20160188373
    Abstract: A system management method for a management computer coupled to a computer system, the computer system including a plurality of computers, an operations system being built thereon the computer system, the operations system including a plurality of task nodes each having allocated thereto computer resources, the system management method including: a step of analyzing a configuration of the computer system for specifying a important node, which is an important task node in the operations system; a step of changing an allocation amount of the computer resources allocated to the important node for measuring a load of the operations system; a step of calculating a first weighting representing a strength of associations among the plurality of task nodes based on a measurement result of the load; and a step of specifying a range impacted by a change in the load of the important node based on the calculated first weighting.
    Type: Application
    Filed: February 12, 2014
    Publication date: June 30, 2016
    Applicant: HITACHI, LTD.
    Inventors: Takashi TAMESHIGE, Yutaka KUDOU, Tomohiro MORIMURA, Takeshi TERAMURA, Daisuke IIZUKA, Nobuaki OZAKI
  • Publication number: 20160156568
    Abstract: A computer system comprising computers, wherein the computers include a first computer and second computers for providing resources to a business system. The business system includes a first VM capable of changing its performance by executing scale-out, and a second VMs capable of changing their performance by executing scale-up. The resource optimizing module included in the first computer is configured to: execute first processing for applying resource changing methods that are light in processing load to the active second VM and the standby second VM in a case of detecting an incident of an increase in load on the active second VM; and execute second processing for applying resource changing methods that are heavy in processing load to the active second VM and the standby second VM in a case of increasing the load on the active second VM.
    Type: Application
    Filed: March 3, 2015
    Publication date: June 2, 2016
    Inventors: Yuki NAGANUMA, Noriko NAKAJIMA, Soichi TAKASHIGE, Tomohiro MORIMURA
  • Publication number: 20150370619
    Abstract: Provided is a management system managing a computer system including apparatuses to be monitored. The management system holds configuration information on the computer system, analysis rules and plan execution effect rules. The analysis rules each associates a causal event that may occur in the computer system with derivative events that may occur by effects of the causal event and defines the causal event and the derivative events with types of components in the computer system. The plan execution effect rules each indicates types of components that may be affected by a computer system configuration change and specifics of the effects. The management system identifies a first event that may occur when a first plan changing the computer system configuration is executed using the plan execution effect rules and the configuration information, and identifies a range where the first event affects using the analysis rules and the configuration information.
    Type: Application
    Filed: September 18, 2013
    Publication date: December 24, 2015
    Applicant: Hitachi, Ltd.
    Inventors: Masataka NAGURA, Jun NAKAJIMA, Tomohiro MORIMURA, Yutaka KUDO
  • Publication number: 20150248119
    Abstract: A management system has a topology display screen of a management target system with an area, where icons of system components are typically displayed in the related art, which is embedded and displayed with a graph of a monitor value of the system component. A band having a predetermined width is displayed to show a relation between system display objects indicating the system components. The width of the band is determined by the number of requests which are transmitted or received by the system components. When a time-sequential graph of the monitor value of a system component is displayed, a vertical bar which can be operated by an input/output device is displayed in the graph. When the operation of the vertical bar is detected, an icon indicating integrity of the management target system at a time indicated by the vertical bar is displayed in the vicinity of the vertical bar.
    Type: Application
    Filed: November 7, 2012
    Publication date: September 3, 2015
    Inventors: Kenta Yamasaki, Mariko Miyaki, Yoko Shiga, Tomohiro Morimura
  • Publication number: 20150188752
    Abstract: A root cause analysis engine uses event survival times and gradual deletion of events to improve analysis accuracy and reduce the number of required calculations. Certainty factors of relevant rules are recalculated every time notification of an event is received. The calculation results are held in a rule memory in the analysis engine. Each event has a survival time, and when the time has expired, that event is deleted from the rule memory. Events held in the rule memory can be deleted without affecting other events held in the rule memory. The analysis engine can then re-calculate the certainty factor of each rule by only performing the re-calculation with respect to affected rules that are related with the deleted event. The calculation cost can be reduced because analysis engine processes events incrementally or decrementally.
    Type: Application
    Filed: March 11, 2015
    Publication date: July 2, 2015
    Inventors: Yutaka KUDO, Tetsuya MASUISHI, Takahiro FUJITA, Tomohiro MORIMURA
  • Patent number: 8990141
    Abstract: A root cause analysis engine uses event survival times and gradual deletion of events to improve analysis accuracy and reduce the number of required calculations. Certainty factors of relevant rules are recalculated every time notification of an event is received. The calculation results are held in a rule memory in the analysis engine. Each event has a survival time, and when the time has expired, that event is deleted from the rule memory. Events held in the rule memory can be deleted without affecting other events held in the rule memory. The analysis engine can then re-calculate the certainty factor of each rule by only performing the re-calculation with respect to affected rules that are related with the deleted event. The calculation cost can be reduced because analysis engine processes events incrementally or decrementally.
    Type: Grant
    Filed: April 16, 2014
    Date of Patent: March 24, 2015
    Assignee: Hitachi, Ltd.
    Inventors: Yutaka Kudo, Tetsuya Masuishi, Takahiro Fujita, Tomohiro Morimura
  • Publication number: 20140229419
    Abstract: A root cause analysis engine uses event survival times and gradual deletion of events to improve analysis accuracy and reduce the number of required calculations. Certainty factors of relevant rules are recalculated every time notification of an event is received. The calculation results are held in a rule memory in the analysis engine. Each event has a survival time, and when the time has expired, that event is deleted from the rule memory. Events held in the rule memory can be deleted without affecting other events held in the rule memory. The analysis engine can then re-calculate the certainty factor of each rule by only performing the re-calculation with respect to affected rules that are related with the deleted event. The calculation cost can be reduced because analysis engine processes events incrementally or decrementally.
    Type: Application
    Filed: April 16, 2014
    Publication date: August 14, 2014
    Applicant: Hitachi, Ltd.
    Inventors: Yutaka KUDO, Tetsuya MASUISHI, Takahiro FUJITA, Tomohiro MORIMURA
  • Patent number: 8732111
    Abstract: A root cause analysis engine uses event survival times and gradual deletion of events to improve analysis accuracy and reduce the number of required calculations. Certainty factors of relevant rules are recalculated every time notification of an event is received. The calculation results are held in a rule memory in the analysis engine. Each event has a survival time, and when the time has expired, that event is deleted from the rule memory. Events held in the rule memory can be deleted without affecting other events held in the rule memory. The analysis engine can then re-calculate the certainty factor of each rule by only performing the re-calculation with respect to affected rules that are related with the deleted event. The calculation cost can be reduced because analysis engine processes events incrementally or decrementally.
    Type: Grant
    Filed: September 27, 2013
    Date of Patent: May 20, 2014
    Assignee: Hitachi, Ltd.
    Inventors: Yutaka Kudo, Takahiro Fujita, Tetsuya Masuishi, Tomohiro Morimura
  • Patent number: 8671313
    Abstract: A management apparatus and a management method that enable parsing processing to be executed efficiently by means of a working memory of a fixed size are proposed. One or more predefined rules are divided into one or more rule segments that comprise a condition and a conclusion that each form part of the rule, and the rule segments obtained through the division are stored in the secondary storage, and when an event notification from the information processing device is received, one or more related rule segments are selected and, by linking the selected one or more rule segments in the memory as required, a rule parsing network is constructed that indicates relationships between rules in the memory, an inference is derived on the basis of the constructed rule parsing network, and rule segments that are not readily used in inference derivation are deleted from the memory.
    Type: Grant
    Filed: June 24, 2013
    Date of Patent: March 11, 2014
    Assignee: Hitachi, Ltd.
    Inventors: Tomohiro Morimura, Masashi Kunii, Yutaka Kudo
  • Publication number: 20140025621
    Abstract: A root cause analysis engine uses event survival times and gradual deletion of events to improve analysis accuracy and reduce the number of required calculations. Certainty factors of relevant rules are recalculated every time notification of an event is received. The calculation results are held in a rule memory in the analysis engine. Each event has a survival time, and when the time has expired, that event is deleted from the rule memory. Events held in the rule memory can be deleted without affecting other events held in the rule memory. The analysis engine can then re-calculate the certainty factor of each rule by only performing the re-calculation with respect to affected rules that are related with the deleted event. The calculation cost can be reduced because analysis engine processes events incrementally or decrementally.
    Type: Application
    Filed: September 27, 2013
    Publication date: January 23, 2014
    Applicant: Hitachi, Ltd.
    Inventors: Yutaka KUDO, Tetsuya MASUISHI, Takahiro FUJITA, Tomohiro MORIMURA
  • Patent number: 8583581
    Abstract: A root cause analysis engine uses event survival times and gradual deletion of events to improve analysis accuracy and reduce the number of required calculations. Certainty factors of relevant rules are recalculated every time notification of an event is received. The calculation results are held in a rule memory in the analysis engine. Each event has a survival time, and when the time has expired, that event is deleted from the rule memory. Events held in the rule memory can be deleted without affecting other events held in the rule memory. The analysis engine can then re-calculate the certainty factor of each rule by only performing the re-calculation with respect to affected rules that are related with the deleted event. The calculation cost can be reduced because analysis engine processes events incrementally or decrementally.
    Type: Grant
    Filed: January 10, 2012
    Date of Patent: November 12, 2013
    Assignee: Hitachi, Ltd.
    Inventors: Yutaka Kudo, Tetsuya Masuishi, Takahiro Fujita, Tomohiro Morimura
  • Publication number: 20130290784
    Abstract: A management apparatus and a management method that enable parsing processing to be executed efficiently by means of a working memory of a fixed size are proposed. One or more predefined rules are divided into one or more rule segments that comprise a condition and a conclusion that each form part of the rule, and the rule segments obtained through the division are stored in the secondary storage, and when an event notification from the information processing device is received, one or more related rule segments are selected and, by linking the selected one or more rule segments in the memory as required, a rule parsing network is constructed that indicates relationships between rules in the memory, an inference is derived on the basis of the constructed rule parsing network, and rule segments that are not readily used in inference derivation are deleted from the memory.
    Type: Application
    Filed: June 24, 2013
    Publication date: October 31, 2013
    Inventors: Tomohiro MORIMURA, Masashi KUNII, Yutaka KUDO