Patents by Inventor Lilian Harada

Lilian Harada 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: 8775528
    Abstract: A character string which is unique in each transaction and a character string common to different transactions are extracted from a message log obtained when the same transaction is processed for a plurality of number of times. Then, messages stored by practically operating an information system are associated with each transaction by utilizing these character strings, and the character string common to the transactions of which execution times overlap with each other is deleted, so that the remained character strings are provided as linking keywords.
    Type: Grant
    Filed: May 4, 2009
    Date of Patent: July 8, 2014
    Assignee: Fujitsu Limited
    Inventors: Hidekazu Takahashi, Motoyuki Kawaba, Yuuji Hotta, Lilian Harada
  • Patent number: 8539035
    Abstract: This message tying processing method include: extracting tying keys from a key definition database storing, for each protocol, tying keys included in messages relating to the protocol and used in a message tying processing, and generating data of a structure including nodes respectively corresponding to the extracted tying keys and links connecting between the nodes of the tying keys belonging to the same protocol: judging whether or not a loop is formed in the structure by the links; when it is judged that the loop is not formed in the structure, identifying, among allocation patterns that are combinations of allocation of the tying keys to each of plural tying processors, that respectively carry out the tying processing in cooperation with each other, an allocation pattern satisfying a first condition that a communication load between the tying processors is the minimum.
    Type: Grant
    Filed: September 15, 2009
    Date of Patent: September 17, 2013
    Assignee: Fujitsu Limited
    Inventors: Yuuji Hotta, Motoyuki Kawaba, Hidekazu Takahashi, Lilian Harada
  • Patent number: 8533334
    Abstract: An apparatus has a unit that receives plural messages, which belong to plural transactions and respectively have a pertinent transaction identifier, in an indefinite order; plural processors each having a queue storing the messages belonging to a transaction in charge, and outputting, after the messages belonging to one of the transactions in charge have become complete, the complete messages in the queue to a message processing unit; an allocation unit that outputs the received message to one of the plural processors, wherein one of the processors is identified based on the transaction identifier of the received message and an allocation rule predetermined for the transaction identifier; and a change unit that changes the allocation rule when activating or stopping the processor. When the change unit changes the allocation rule, each of the processors outputs at least messages for which re-allocation is necessary to the allocation unit.
    Type: Grant
    Filed: January 22, 2009
    Date of Patent: September 10, 2013
    Assignee: Fujitsu Limited
    Inventors: Yuuji Hotta, Motoyuki Kawaba, Hidekazu Takahashi, Lilian Harada
  • Patent number: 8495006
    Abstract: A computer-readable, non-transitory medium stores the system analysis program which can accurately analyze the operational status of a system without modifying functions of the system for providing services. A message analysis unit analyzes the contents of collected messages, and determines the times of occurrence of the messages, the process types requested by the messages, and whether or not each of the messages is a request message or a response message. In response to an instruction for model generation, a model generation unit generates a transaction model satisfying at least one limiting condition related to caller-called relationships between processes, based on a set of messages selected in accordance with a selection criterion based on the certainty of existence of caller-called relationships. Then, in response to an instruction for analysis, an analysis unit analyzes the processing status of a transaction based on a protocol log conforming to the transaction model.
    Type: Grant
    Filed: August 10, 2012
    Date of Patent: July 23, 2013
    Assignee: Fujitsu Limited
    Inventors: Lilian Harada, Nobuhiro Yugami, Kenichi Kobayashi, Hiroshi Otsuka, Ken Yokoyama, Riichiro Take, Kazumi Kubota, Yuuji Hotta, Naoki Akaboshi
  • Patent number: 8341215
    Abstract: A processing time can be defined in a system including a plurality of computers for which the processing time is calculated, by displaying candidates of paths corresponding to flow of a series of processings as to transmission and reception of each message based on transmission and reception of messages among a plurality of computers; receiving an input that selects one path among the displayed candidates; and creating a processing time in each of computers in the flow of a series of processings as to transmission and reception of messages based on the received input.
    Type: Grant
    Filed: December 8, 2009
    Date of Patent: December 25, 2012
    Assignee: Fujitsu Limited
    Inventors: Motoyuki Kawaba, Hidekazu Takahashi, Yuuji Hotta, Lilian Harada
  • Publication number: 20120317072
    Abstract: A computer-readable, non-transitory medium stores the system analysis program which can accurately analyze the operational status of a system without modifying functions of the system for providing services. A message analysis unit analyzes the contents of collected messages, and determines the times of occurrence of the messages, the process types requested by the messages, and whether or not each of the messages is a request message or a response message. In response to an instruction for model generation, a model generation unit generates a transaction model satisfying at least one limiting condition related to caller-called relationships between processes, based on a set of messages selected in accordance with a selection criterion based on the certainty of existence of caller-called relationships. Then, in response to an instruction for analysis, an analysis unit analyzes the processing status of a transaction based on a protocol log conforming to the transaction model.
    Type: Application
    Filed: August 10, 2012
    Publication date: December 13, 2012
    Applicant: FUJITSU LIMITED
    Inventors: Lilian Harada, Nobuhiro Yugami, Kenichi Kobayashi, Hiroshi Otsuka, Ken Yokoyama, Riichiro Take, Kazumi Kubota, Yuuji Hotta, Naoki Akaboshi
  • Patent number: 8266097
    Abstract: A computer-readable, non-transitory medium stores the system analysis program which can accurately analyze the operational status of a system without modifying functions of the system for providing services. A message analysis unit analyzes the contents of collected messages, and determines the times of occurrence of the messages, the process types requested by the messages, and whether or not each of the messages is a request message or a response message. In response to an instruction for model generation, a model generation unit generates a transaction model satisfying at least one limiting condition related to caller-called relationships between processes, based on a set of messages selected in accordance with a selection criterion based on the certainty of existence of caller-called relationships. Then, in response to an instruction for analysis, an analysis unit analyzes the processing status of a transaction based on a protocol log conforming to the transaction model.
    Type: Grant
    Filed: December 16, 2010
    Date of Patent: September 11, 2012
    Assignee: Fujitsu Limited
    Inventors: Lilian Harada, Nobuhiro Yugami, Kenichi Kobayashi, Hiroshi Otsuka, Ken Yokoyama, Riichiro Take, Kazumi Kubota, Yuuji Hotta, Naoki Akaboshi
  • Patent number: 8219625
    Abstract: A linkage support system links related messages among a plurality of messages sent and received among a plurality of communication terminals. The linkage support system includes an information acquisition unit that acquires message types of the plurality of messages, character strings included in the plurality of messages, and amount of data flow when the character strings are transferred. An unnecessary character strings exclusion unit that excludes character strings that are not required as keywords for linkage processing, based on the information acquired by the information acquisition unit, and a processing order determination unit determines order for using a plurality of character strings from which unnecessary character strings are excluded by the unnecessary character strings exclusion unit.
    Type: Grant
    Filed: March 17, 2009
    Date of Patent: July 10, 2012
    Assignee: Fujitsu Limited
    Inventors: Motoyuki Kawaba, Hidekazu Takahashi, Yuuji Hotta, Lilian Harada
  • Patent number: 8108363
    Abstract: A system analyzing apparatus analyzes a processing state of a computer system that includes a plurality of types of unit processing. The system analyzing apparatus includes a selecting unit that selects a plurality of representative unit processing based on similarities between individual units of the unit processing; and a grouping unit that groups each unit processing based on similarity between the each unit processing and each of representative unit processing selected by the selecting unit.
    Type: Grant
    Filed: October 31, 2006
    Date of Patent: January 31, 2012
    Assignee: Fujitsu Limited
    Inventors: Yukiko Seki, Lilian Harada, Ken Yokoyama
  • Patent number: 8037077
    Abstract: An apparatus receives messages having a linking keyword for identification of a transaction, classifies the received messages in terms of transaction using message patterns and the linking keyword. It compares a series of messages associated with the transaction with the message patterns. It makes a decision as to whether the series of messages associated with the transaction matches any one of the message patterns. It creates a record including an identifier for the transaction and the linking keyword. It searches for the unclassified messages based on the linking keywords contained in the unclassified messages, and identifies the record containing the identical linking keyword. It stores the identifiers for the unclassified messages into a linked candidate list in a corresponding manner to linked candidate transactions. It adds the unclassified messages to the message pattern which corresponds to the linked candidate transaction to create a new message pattern.
    Type: Grant
    Filed: July 31, 2009
    Date of Patent: October 11, 2011
    Assignee: Fujitsu Limited
    Inventors: Hidekazu Takahashi, Motoyuki Kawaba, Yuuji Hotta, Lilian Harada
  • Patent number: 7970584
    Abstract: In determining a condition of a case under which the occurrence rate of the performance abnormality is high based on information related to a resource utilization situation acquired in a resource utilization situation acquisition step and an occurrence frequency of a request acquired in a request occurrence frequency acquisition step, and information related to the existence/nonexistence of the performance abnormality determined in a performance abnormality existence/nonexistence determination step, when branching a parent node that represents a situation of a decision tree to two child nodes using the method of decision tree, the decision tree is generated using an evaluation function which performs branching such that most of normal samples which belong to the parent node are contained in the one child node, and most of abnormal values which belong to the parent node are contained in the other child node.
    Type: Grant
    Filed: April 28, 2008
    Date of Patent: June 28, 2011
    Assignee: Fujitsu Limited
    Inventors: Shinji Kikuchi, Ken Yokoyama, Akira Takeyama, Koji Ishibashi, Kenichi Shimazaki, Lilian Harada, Nobuhiro Yugami, Yukiko Seki
  • Publication number: 20110087630
    Abstract: A computer-readable, non-transitory medium stores the system analysis program which can accurately analyze the operational status of a system without modifying functions of the system for providing services. A message analysis unit analyzes the contents of collected messages, and determines the times of occurrence of the messages, the process types requested by the messages, and whether or not each of the messages is a request message or a response message. In response to an instruction for model generation, a model generation unit generates a transaction model satisfying at least one limiting condition related to caller-called relationships between processes, based on a set of messages selected in accordance with a selection criterion based on the certainty of existence of caller-called relationships. Then, in response to an instruction for analysis, an analysis unit analyzes the processing status of a transaction based on a protocol log conforming to the transaction model.
    Type: Application
    Filed: December 16, 2010
    Publication date: April 14, 2011
    Applicant: Fujitsu Limited
    Inventors: Lilian Harada, Nobuhiro Yugami, Kenichi Kobayashi, Hiroshi Otsuka, Ken Yokoyama, Riichiro Take, Kazumi Kubota, Yuuji Hotta, Naoki Akaboshi
  • Patent number: 7873594
    Abstract: A system analysis program which can accurately analyze the operational status of a system without modifying functions of the system for providing services. A message analysis unit analyzes the contents of collected messages, and determines the times of occurrence of the messages, the process types requested by the messages, and whether or not each of the messages is a request message or a response message. In response to an instruction for model generation, a model generation unit generates a transaction model satisfying at least one limiting condition related to caller-called relationships between processes, based on a set of messages selected in accordance with a selection criterion based on the certainty of existence of caller-called relationships. Then, in response to an instruction for analysis, an analysis unit analyzes the processing status of a transaction based on a protocol log conforming to the transaction model.
    Type: Grant
    Filed: November 3, 2004
    Date of Patent: January 18, 2011
    Assignee: Fujitsu Limited
    Inventors: Lilian Harada, Nobuhiro Yugami, Kenichi Kobayashi, Hiroshi Otsuka, Ken Yokoyama, Riichiro Take, Kazumi Kubota, Yuuji Hotta, Naoki Akaboshi
  • Publication number: 20100198912
    Abstract: A processing time can be defined in a system including a plurality of computers for which the processing time is calculated, by displaying candidates of paths corresponding to flow of a series of processings as to transmission and reception of each message based on transmission and reception of messages among a plurality of computers; receiving an input that selects one path among the displayed candidates; and creating a processing time in each of computers in the flow of a series of processings as to transmission and reception of messages based on the received input.
    Type: Application
    Filed: December 8, 2009
    Publication date: August 5, 2010
    Applicant: FUJITSU LIMITED
    Inventors: Motoyuki KAWABA, Hidekazu Takahashi, Yuuji Hotta, Lilian Harada
  • Patent number: 7747587
    Abstract: An apparatus for classifying a plurality of logs recorded in a log file includes: a parsing unit that performs a parsing of the logs in the log file; a rule generating unit that generates a rule for a data classification based on a result of the parsing; a data classifying unit that performs the data classification, based on the rule generated, to classify the logs into a plurality of groups; a display unit that displays a result of the data classification; and a rule editing that edits the rules based on an instruction from a user.
    Type: Grant
    Filed: June 7, 2005
    Date of Patent: June 29, 2010
    Assignee: Fujitsu Limited
    Inventors: Kazumi Kubota, Riichiro Take, Naoki Akaboshi, Lilian Harada
  • Publication number: 20100082762
    Abstract: This message tying processing method include: extracting tying keys from a key definition database storing, for each protocol, tying keys included in messages relating to the protocol and used in a message tying processing, and generating data of a structure including nodes respectively corresponding to the extracted tying keys and links connecting between the nodes of the tying keys belonging to the same protocol: judging whether or not a loop is formed in the structure by the links; when it is judged that the loop is not formed in the structure, identifying, among allocation patterns that are combinations of allocation of the tying keys to each of plural tying processors, that respectively carry out the tying processing in cooperation with each other, an allocation pattern satisfying a first condition that a communication load between the tying processors is the minimum.
    Type: Application
    Filed: September 15, 2009
    Publication date: April 1, 2010
    Applicant: FUJITSU LIMITED
    Inventors: Yuuji Hotta, Motoyuki Kawaba, Hidekazu Takahashi, Lilian Harada
  • Publication number: 20100076974
    Abstract: An apparatus receives messages having a linking keyword for identification of a transaction, classifies the received messages in terms of transaction using message patterns and the linking keyword. It compares a series of messages associated with the transaction with the message patterns. It makes a decision as to whether the series of messages associated with the transaction matches any one of the message patterns. It creates a record including an identifier for the transaction and the linking keyword. It searches for the unclassified messages based on the linking keywords contained in the unclassified messages, and identifies the record containing the identical linking keyword. It stores the identifiers for the unclassified messages into a linked candidate list in a corresponding manner to linked candidate transactions. It adds the unclassified messages to the message pattern which corresponds to the linked candidate transaction to create a new message pattern.
    Type: Application
    Filed: July 31, 2009
    Publication date: March 25, 2010
    Applicant: FUJITSU LIMITED
    Inventors: Hidekazu Takahashi, Motoyuki Kawaba, Yuuji Hotta, Lilian Harada
  • Publication number: 20100042686
    Abstract: A character string which is unique in each transaction and a character string common to different transactions are extracted from a message log obtained when the same transaction is processed for a plurality of number of times. Then, messages stored by practically operating an information system are associated with each transaction by utilizing these character strings, and the character string common to the transactions of which execution times overlap with each other is deleted, so that the remained character strings are provided as linking keywords.
    Type: Application
    Filed: May 4, 2009
    Publication date: February 18, 2010
    Applicant: FUJITSU LIMITED
    Inventors: Hidekazu Takahashi, Motoyuki Kawaba, Yuuji Hotta, Lilian Harada
  • Publication number: 20090292810
    Abstract: An apparatus has a unit that receives plural messages, which belong to plural transactions and respectively have a pertinent transaction identifier, in an indefinite order; plural processors each having a queue storing the messages belonging to a transaction in charge, and outputting, after the messages belonging to one of the transactions in charge have become complete, the complete messages in the queue to a message processing unit; an allocation unit that outputs the received message to one of the plural processors, wherein one of the processors is identified based on the transaction identifier of the received message and an allocation rule predetermined for the transaction identifier; and a change unit that changes the allocation rule when activating or stopping the processor. When the change unit changes the allocation rule, each of the processors outputs at least messages for which re-allocation is necessary to the allocation unit.
    Type: Application
    Filed: January 22, 2009
    Publication date: November 26, 2009
    Applicant: FUJITSU LIMITED
    Inventors: Yuuji Hotta, Motoyuki Kawaba, Hidekazu Takahashi, Lilian Harada
  • Publication number: 20090248899
    Abstract: A linkage support system links related messages among a plurality of messages sent and received among a plurality of communication terminals. The linkage support system includes an information acquisition unit that acquires message types of the plurality of messages, character strings included in the plurality of messages, and amount of data flow when the character strings are transferred. An unnecessary character strings exclusion unit that excludes character strings that are not required as keywords for linkage processing, based on the information acquired by the information acquisition unit, and a processing order determination unit determines order for using a plurality of character strings from which unnecessary character strings are excluded by the unnecessary character strings exclusion unit.
    Type: Application
    Filed: March 17, 2009
    Publication date: October 1, 2009
    Applicant: FUJITSU LIMITED
    Inventors: Motoyuki Kawaba, Hidekazu Takahashi, Yuuji Hotta, Lilian Harada