Computer system and data management method

Patent metadata

Field	Value
Publication number	US-10489353-B2
Application number	US-201515539375-A
Country	US
Kind code	B2
Filing date	Jan 5, 2015
Priority date	Jan 5, 2015
Publication date	Nov 26, 2019
Grant date	Nov 26, 2019

Abstract

A storage system includes N nodes (N is an integer, equal to or larger than 2) coupled to at least one data processing system. A plurality of tenant spaces, based on the N nodes, contain Y1 tenant spaces (Y1 is an integer, equal to or larger than 2 and equal to or smaller than N) for a first tenant. The Y1 tenant spaces are based on Y1 node groups in the N nodes. Each of the Y1 node groups contains Q1 or more nodes (Q1 is an integer, equal to or larger than 1). For the first tenant, the storage system provides, to each of the Y1 tenant spaces, data units multiplexed Y1 times. From a first load-source tenant space from among the Y1 tenant spaces, the storage system loads a first data unit group containing one or more data units to a first load-destination data processing system.

First claim

The invention claimed is:

1. A computer system, for reducing data loading time comprises:
a processor;
an I/O interface;
a storage system, comprising a memory, including N nodes (N is an integer, equal to or larger than 2) communicatively coupled with the processor and I/O interface; and
one or more data processing systems communicatively coupled with the storage system,
the storage system being configured to provide a plurality of tenant spaces that are a plurality of storage spaces based on the N nodes and store a plurality of data units of a plurality of tenants,
the plurality of tenant spaces containing Y1 tenant spaces (Y1 is an integer, equal to or larger than 2 and equal to or smaller than N) for a first tenant, the Y1 tenant spaces based on Y1 node groups among the N nodes, and each of the Y1 node groups containing Q1 or more nodes (Q1 is an integer, equal to or larger than 1), wherein Q1 is a quotient of N/Y1, and
the processor being configured to
for the first tenant, arrange Y1-time multiplexed data units in the Y1 tenant spaces in the storage system, and

from a first load-source tenant space from among the Y1 tenant spaces in the storage system, load a first data unit group which contains one or more data units from the storage system to a first load-destination data processing system among the one or more data processing systems.

2. The computer system according to claim 1 , wherein
the plurality of tenant spaces further contain Y2 tenant spaces for a second tenant (Y2 is an integer, equal to or larger than 2 and equal to or smaller than N), the Y2 tenant spaces are based on Y2 node groups among the N nodes, and each of the Y2 node groups is made up of Q2 or more nodes (Q2 is a quotient of N/Y2), and
the processor is configured to
for the second tenant, arrange Y2-time multiplexed data units in the Y2 tenant spaces in the storage system, and
from a second load-source tenant space among the Y2 tenant spaces in the storage system, load a second data unit group which contains one or more data units from the storage system to a second load-destination data processing system among the one or more data processing systems.

3. The computer system according to claim 2 , wherein
the second load-destination data processing system is a data processing system other than the first load-destination data processing system, and
irrespective of whether loading of the first data unit group from the first load-source tenant space to the first load-destination data processing system has been completed or not and whether the first load-destination data processing system has completed data processing using the first data unit group, the processor is configured to load the second data unit group from the second load-source tenant space to the second load-destination data processing system.

4. The computer system according to claim 2 , wherein
the first and second load-source tenant spaces are tenant spaces each selected by the processor, and
the processor, is configured to select, as a load source, a tenant space based on a node group with a lowest load.

5. The computer system according to claim 1 , further comprising
a server system configured to receive a data unit to which metadata is added,
wherein at least one of the storage system and the server system is configured to determine a tenant space that is an arrangement destination of the Y-time multiplexed data unit, according to whether or not the metadata added to the data unit is custom metadata that defines two or more tenant spaces as the arrangement destination of the data unit.

6. The computer system according to claim 1 , wherein
the plurality of tenant spaces contain a tenant space common to the plurality of tenants,
the common tenant space is based on nodes the number of which is more than the number of nodes of any node group among the Y1 node groups, and
the processor is configured to copy the first data unit group from any tenant space among the Y1 tenant spaces to the common tenant space, and
to load the first data unit group from any of the Y1 tenant spaces and the common tenant space to the first load-destination data processing system.

7. The computer system according to claim 6 , wherein
the processor is configured to load the first data unit group, to the first load-destination data processing system, from a node group having a lowest load among the Y1 node groups in the storage system and the node group that stores the first data unit group in the common tenant space.

8. The computer system according to claim 6 , wherein the common tenant space is based on the N nodes.

9. The computer system according to claim 6 , wherein
when the first load-destination data processing system is in data processing, the processor is configured to copy the first data unit group from any tenant space among the Y1 tenant spaces to the common tenant space.

10. The computer system according to claim 1 , wherein the first load-destination data processing system is a data processing system selected based on operating situations of the plurality of data processing systems.

11. The computer system according to claim 1 , further comprising
a management system for the storage system,
wherein the storage system is configured to define the Y1 tenant spaces, for the first tenant, based on an input from the management system.

12. A data management method, for reducing data loading time comprising:
providing, via a storage system comprising a memory communicatively coupled to one or more data processing systems, a plurality of tenant spaces that are a plurality of storage spaces based on N nodes (N is an integer, equal to or larger than 2)
storing, in the storage system, a plurality of data units of a plurality of tenants, wherein the plurality of tenant spaces contain Y1 tenant spaces (Y1 is an integer, equal to or larger than 2 and equal to or smaller than N) for a first tenant, the Y1 tenant spaces are based on Y1 node groups among the N nodes, and each of the Y1 node groups contains Q1 or more nodes (Q1 is an integer, equal to or larger than 2), wherein Q1 is a quotient of N/Y1;
arranging, via a processor communicatively coupled to the storage system, for the first tenant, Y1-time multiplexed data units in each of the Y1 tenant spaces; and
loading, via the processor, from a first load-source tenant space among the Y1 tenant spaces, a first data unit group which contains one or more data units to a first load-destination data processing system among the one or more data processing systems.

Assignees

• Hitachi Ltd

Inventors

• Esaka Tomonori
• Abe Tetsuya
• Nakamura Yoshitaka

Classifications

• G06F16/182

  Distributed file systems · CPC title

• G06F30/18

  Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling (circuit design at the physical level G06F30/39; network planning tools for wireless communication networks H04W16/18) · CPC title

• G06F17/40 Primary

  Data acquisition and logging (for input to computer G06F3/00) · CPC title

• G06F16/183 Primary

  Provision of network file services by network file servers, e.g. by using NFS, CIFS (network file access protocols H04L67/1097) · CPC title

• G06F16/27

  Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title