Patents by Inventor Naoki Utsunomiya

Naoki Utsunomiya 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: 7587478
    Abstract: In a method of reducing a running cost and labor required for quality measurement, client computers matching predetermined district information are selected from a plurality of management target computers receiving network services, a quality measuring program is installed in these client computers to obtain execution results of the quality measuring program, and the quality of network services when the management target computers in the service target district access a server computer.
    Type: Grant
    Filed: September 1, 2004
    Date of Patent: September 8, 2009
    Assignee: Hitachi, Ltd.
    Inventors: Daisuke Iizuka, Naoki Utsunomiya
  • Publication number: 20080162800
    Abstract: A computer in which functions of its resources are divided to realize a plurality of virtual computers 12 and which includes a plurality of physical devices. A managing unit of the computer, when usage of a virtual device has changed, selects a physical device compatible with the virtual device from physical devices usable for a control scheme and makes the physical device be associated with the virtual device and changes the control scheme of the virtual device, thereby achieving the control of devices in the virtual computers, where a plurality of control schemes including a shared scheme and a dedicated scheme are switched.
    Type: Application
    Filed: December 13, 2007
    Publication date: July 3, 2008
    Inventors: Souichi Takashige, Naoki Utsunomiya
  • Publication number: 20070169167
    Abstract: A technique of performing concurrency control of policies is provided, which makes it possible to efficiently utilize resources of an overall information system. According to the present invention, a policy execution device creates a list of components of a application system which are influenced by execution of an action of a policy instance, for respective policy instances. If trigger conditions of another policy instance are newly met during execution of a policy instance, the policy execution device compares a list of components of the policy instance presently being executed with a list of components of the policy instance whose trigger conditions are newly met. If there are no common components in the lists, the policy execution device executes the policy instance whose trigger conditions are newly met, and if there are common components in the lists, the policy execution device suspends the policy instance whose trigger conditions are newly met.
    Type: Application
    Filed: September 27, 2006
    Publication date: July 19, 2007
    Applicant: Hitachi, Ltd.
    Inventors: Tomohiro Morimura, Yoshimasa Masuoka, Naoki Utsunomiya
  • Publication number: 20070016751
    Abstract: The present invention provides a file system capable of reducing time taken to switch I/O paths, and hiding the process of switching the I/O paths from the user. In a system of the present invention in which a file ID is defined for each file, upon receiving a request for accessing a file specifying a file ID from a user, a file server refers to a file management table to obtain a logical disk ID for accessing the file. The file server then refers to a logical disk management table to obtain an I/O path corresponding to the logical disk ID, and accesses a physical disk device by use of the obtained I/O path. When a fault has occurred in an operational I/O path, a file server rewrites the logical disk management tables in all nodes to change the I/O path.
    Type: Application
    Filed: September 25, 2006
    Publication date: January 18, 2007
    Applicant: Hitachi, Ltd.
    Inventors: Akihiro Ito, Naoki Utsunomiya, Koji Sonoda, Hiroyuki Kumazaki
  • Patent number: 7130868
    Abstract: In a system of the present invention in which a file ID is defined for each file, upon receiving a request for accessing a file specifying a file ID from a user, a file server refers to a file management table to obtain a logical disk ID for accessing the file. The file server then refers to a logical disk management table to obtain an I/O path corresponding to the logical disk ID, and accesses a physical disk device by use of the obtained I/O path. When a fault has occurred in an operational I/O path, a file server rewrites the logical disk management tables in all nodes to change the I/O path. This reduces the time taken to switch I/O paths, and hiding the process of switching the I/O paths from the user.
    Type: Grant
    Filed: October 27, 2003
    Date of Patent: October 31, 2006
    Assignee: Hitachi, Ltd.
    Inventors: Akihiro Ito, Naoki Utsunomiya, Koji Sonoda, Hiroyuki Kumazaki
  • Publication number: 20060230103
    Abstract: A computer system that has formerly handled a service is quickly reproduced with another computer system to resume the service immediately. The association relations between services run by a primary site (1) and primary site servers (13) are collected. The association relations between the primary site servers (13) and a primary site storage system (15) are collected. The association relation between the storage system (15) of the primary site (1) and a storage system (25) of a secondary site (2) is collected. The association relations between the primary site services and the primary site servers (13), the association relations between the primary site servers (13) and the primary site storage system (15), and the association relation between the primary site storage system (15) and the secondary site storage system (25) are copied as configuration information from the storage system (15) of the primary site (1) to the secondary site (2).
    Type: Application
    Filed: August 12, 2005
    Publication date: October 12, 2006
    Inventors: Yoshifumi Takamoto, Takao Nakajima, Naoki Utsunomiya
  • Publication number: 20060036724
    Abstract: In a method of reducing a running cost and labor required for quality measurement, client computers matching predetermined district information are selected from a plurality of management target computers receiving network services, a quality measuring program is installed in these client computers to obtain execution results of the quality measuring program, and the quality of network services when the management target computers in the service target district access a server computer.
    Type: Application
    Filed: September 1, 2004
    Publication date: February 16, 2006
    Inventors: Daisuke Iizuka, Naoki Utsunomiya
  • Publication number: 20050289272
    Abstract: A policy verification method in an information processing system for verifying whether the policy rule operates correctly. The method verifies the policy in an information processing system including at least one component, using policies describing a series of system management operations to be performed when an event occurs, and automatically executing system management operations according to the policies when the event occurs. The method acquires configuration information on the component constituting the information processing system. The method acquires all the events that may occur in the information processing system from an event list stored in advance and the configuration information acquired, and generates them as a test item. The method executes the test item generated and verifying the propriety of the policy according to the result of the system management operations executed by the policy.
    Type: Application
    Filed: September 1, 2004
    Publication date: December 29, 2005
    Inventors: Yoshimasa Masuoka, Naoki Utsunomiya
  • Publication number: 20040140996
    Abstract: Where various contents are distributed to mobile devices from a network, the mobile user must frequently operate the device to cancel and select contents until a desired content is displayed. According to the present invention, a mobile device to receive contents distributed from the network is provided with contents display means to display plural contents sequentially part by part in an interleaved manner on the contents display unit. After a part of a content is displayed for a certain period of time, a part of another content is automatically selected and displayed. In addition, the contents display means includes means to continuously display the current content if instructed by the user.
    Type: Application
    Filed: March 21, 2003
    Publication date: July 22, 2004
    Inventors: Tomoki Sekiguci, Akihiro Itoh, Naoki Utsunomiya
  • Publication number: 20040093358
    Abstract: The present invention provides a file system capable of reducing time taken to switch I/O paths, and hiding the process of switching the I/O paths from the user.
    Type: Application
    Filed: October 27, 2003
    Publication date: May 13, 2004
    Applicant: Hitachi, Ltd.
    Inventors: Akihiro Ito, Naoki Utsunomiya, Koji Sonoda, Hiroyuki Kumazaki
  • Patent number: 6691177
    Abstract: A storage medium for a file input/output control system having a plurality of first computers each having a plurality of disks and connected to a network and at least one second computer connected to the network for accessing the disks connected to the first computers. The storage medium includes a data code section storing a step of retrieving a plurality of first data access requests issued from a plurality of processes of an application and comparing the first data access requests with correspondence relation defining information to confirm that the first data access requests are accesses to the disks, a data code section storing a step of creating a plurality of second data access requests to the disks from the first data access requests confirmed to be accesses to the disks and transmitting the second data access requests to the network, and a data code section storing a step of, in each first computer, rearranging the second data access requests for each disk in the order of block numbers in each disk.
    Type: Grant
    Filed: January 28, 2002
    Date of Patent: February 10, 2004
    Assignee: Hitachi, Ltd.
    Inventors: Naoki Utsunomiya, Takashi Nishikado, Koji Sonoda, Hiroyuki Kumazaki
  • Patent number: 6687764
    Abstract: In collective I/O processing in which a plurality of processes access the same file in a shared manner, when each user process issues an I/O request, the user process notifies the system of information on a file region accessed by all the processes; information for specifying whether or not a prefetch is performed, and information for specifying whether or not a disk preallocate is performed, together with the I/O requests issued by all associated processes, as hint information. The system provides a buffer for storing data in a file region accessed by all the processes based on the hint information, such that the I/O processing for all the processes is performed using this buffer.
    Type: Grant
    Filed: December 21, 2001
    Date of Patent: February 3, 2004
    Assignee: Hitachi, Ltd.
    Inventors: Kouji Sonoda, Naoki Utsunomiya, Hiroyuki Kumazaki, Toshiya Kurakake
  • Patent number: 6654769
    Abstract: An illustrative embodiment of the present invention disclosed herein includes a file server having a file management table to obtain a logical disk ID for accessing files. A logical disk management table is consulted to obtain an I/O path corresponding to the logical disk ID, thus accessing the physical device. When a fault occurs along an I/O path, the appropriate tables are altered accordingly to reflect a new I/O path.
    Type: Grant
    Filed: December 20, 2000
    Date of Patent: November 25, 2003
    Assignee: Hitachi, Ltd.
    Inventors: Akihiro Ito, Naoki Utsunomiya, Koji Sonoda, Hiroyuki Kumazaki
  • Publication number: 20020091751
    Abstract: In collective I/O processing in which a plurality of processes access the same file in a shared manner, when each user process issues an I/O request, the user process notifies the system of information on a file region accessed by all the processes; information for specifying whether or not a prefetch is performed, and information for specifying whether or not a disk preallocate is performed, together with the I/O requests issued by all associated processes, as hint information. The system provides a buffer for storing data in a file region accessed by all the processes based on the hint information, such that the I/O processing for all the processes is performed using this buffer.
    Type: Application
    Filed: December 21, 2001
    Publication date: July 11, 2002
    Inventors: Kouji Sonoda, Naoki Utsunomiya, Hiroyuki Kumazaki, Toshiya Kurakake
  • Publication number: 20020073248
    Abstract: A file input/output control system has first computers each having disks and connected to a network; and at least one second computer connected to the network for accessing the disks connected to the plurality of first computers, the second computer having: a retriever for retrieving first data access requests issued from a plurality of processes of an application and comparing the first data access requests with correspondence relation defining information to thereby confirm that the first data access requests are accesses to disks, the correspondence relation defining information being entered by a user in advance and indicating a correspondence relation between the disks and each of regions in a file stored in disks of the first computers; and a scheduler for creating second data access requests to the disks from first data access requests confirmed to be accesses to disks, in accordance with the correspondence relation defining information between the disks and each of the regions in a file stored in the
    Type: Application
    Filed: January 28, 2002
    Publication date: June 13, 2002
    Inventors: Naoki Utsunomiya, Takashi Nishikado, Koji Sonoda, Hiroyuki Kumazaki
  • Patent number: 6347343
    Abstract: A storage medium for a file input/output control system having a plurality of first computers each having a plurality of disks and connected to a network and at least one second computer connected to the network for accessing the disks connected to the first computers. The storage medium includes a data code section storing a step of retrieving a plurality of first data access requests issued from a plurality of processes of an application and comparing the first data access requests with correspondence relation defining information to confirm that the first data access requests are accesses to the disks, a data code section storing a step of creating a plurality of second data access requests to the disks from the first data access requests confirmed to be accesses to the disks and transmitting the second data access requests to the network, and a data code section storing a step of, in each first computer, rearranging the second data access requests for each disk in the order of block numbers in each disk.
    Type: Grant
    Filed: July 10, 2000
    Date of Patent: February 12, 2002
    Assignee: Hitachi, Ltd.
    Inventors: Naoki Utsunomiya, Takashi Nishikado, Koji Sonoda, Hiroyuki Kumazaki
  • Publication number: 20020016792
    Abstract: The present invention provides a file system capable of reducing time taken to switch I/O paths, and hiding the process of switching the I/O paths from the user.
    Type: Application
    Filed: December 20, 2000
    Publication date: February 7, 2002
    Applicant: Hitachi, Ltd.
    Inventors: Akihiro Ito, Naoki Utsunomiya, Koji Sonoda, Hiroyuki Kumazaki
  • Patent number: 6101558
    Abstract: A file input/output control system has first computers each having disks and connected to a network; and at least one second computer connected to the network for accessing the disks connected to the plurality of first computers, the second computer having: a retriever for retrieving first data access requests issued from a plurality of processes of an application and comparing the first data access requests with correspondence relation defining information to thereby confirm that the first data access requests are accesses to disks, the correspondence relation defining information being entered by a user in advance and indicating a correspondence relation between the disks and each of regions in a file stored in disks of the first computers; and a scheduler for creating second data access requests to the disks from first data access requests confirmed to be accesses to disks, in accordance with the correspondence relation defining information between the disks and each of the regions in a file stored in the
    Type: Grant
    Filed: June 25, 1998
    Date of Patent: August 8, 2000
    Assignee: Hitachi, Ltd.
    Inventors: Naoki Utsunomiya, Takashi Nishikado, Koji Sonoda, Hiroyuki Kumazaki
  • Patent number: 5867656
    Abstract: In a computer system in which nodes are connected to each other via a network, transmission and reception buffers of sender and receiver processes are prepared as resident areas in a main storage. A node of a receiver side notifies, prior to initiation of a communication, a physical address of a data reception area of the node to a node on a sender side. In the node on the sender side, the reported physical address is added to transmission data to transfer a resultant item. On the receiver side, reception data is written in a location of the main storage at the physical address. In the receiver node, the double buffering is employed to prevent an overwriting operation of another node onto the data reception area. The respective nodes achieve partial synchronization with adjacent nodes in chain, thereby automatically establishing synchronization between all nodes.
    Type: Grant
    Filed: December 3, 1996
    Date of Patent: February 2, 1999
    Assignee: Hitachi, Ltd.
    Inventors: Masaaki Iwasaki, Hiroyuki Chiba, Naoki Utsunomiya, Kouji Sonoda, Satoshi Yoshizawa, Masahiko Yamauchi
  • Patent number: 5659777
    Abstract: In a computer system in which nodes are connected to each other via a network, transmission and reception buffers of sender and receiver processes are prepared as resident areas in a main storage. A node of a receiver side notifies, prior to initiation of a communication, a physical address of a data reception area of the node to a node on a sender side. In the node on the sender side, the reported physical address is added to transmission data to transfer a resultant item. On the receiver side, reception data is written in a location of the main storage at the physical address. In the receiver node, the double buffering is employed to prevent an overwriting operation of another node onto the data reception area. The respective nodes achieve partial synchronization with adjacent nodes in chain, thereby automatically establishing synchronization between all nodes.
    Type: Grant
    Filed: September 23, 1993
    Date of Patent: August 19, 1997
    Assignee: Hitachi, Ltd.
    Inventors: Masaaki Iwasaki, Hiroyuki Chiba, Naoki Utsunomiya, Kouji Sonoda, Satoshi Yoshizawa, Masahiko Yamauchi