PARALLEL COMPUTER SYSTEM AND CONTROL METHOD

• US 20130262683A1
• Filed: 03/15/2013
• Published: 10/03/2013
• Est. Priority Date: 03/27/2012
• Status: Abandoned Application

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: HAYASHI, Naoki, Hashimoto, Tsuyoshi
• Application Number:
  US13/832,266
• Publication Number:
  US 20130262683A1
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: G06F 12/0871 Allocation or management of cache space
• CPC Class Codes: G06F 13/00 Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units interface circuits for specific input/output devices G06F3/00 ; multiprogram control therefor G06F9/46; multiprocessor systems G06F15/16
• CPC Class Codes: G06F 16/172 Caching, prefetching or hoarding of files
• CPC Class Codes: G06F 2212/1016 Performance improvement
• CPC Class Codes: G06F 2212/1044 Space efficiency improvement
• CPC Class Codes: G06F 2212/154 Networked environment
• CPC Class Codes: G06F 2212/163 Server or database system
• CPC Class Codes: G06F 2212/284 being distributed
• CPC Class Codes: G06F 2212/463 File
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation

Abstract

A disclosed control method is executed by a node of plural nodes that are connected in a parallel computer system through a network. The control method includes obtaining property data representing a property of accesses to data stored in a storage device in a first node of the plural nodes for a job to be executed by using data stored in the storage device, and determining a resource to be allocated to a cache among resources included in the parallel computer system and the network based on the obtained property data.

Claims

1. A computer-readable, non-transitory storage medium storing a program for causing a node of a plurality of nodes that are connected in a parallel computer system through a network to execute a procedure, the procedure comprising:

obtaining property data representing a property of accesses to data stored in a storage device in a first node of the plurality of nodes for a job to be executed by using data stored in the storage device; and

determining a resource to be allocated to a cache among resources included in the parallel computer system and the network based on the obtained property data.

2. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the property data is information on an amount of data to be transferred by the accesses to the data stored in the storage device, and

the determining comprises:

upon detecting that the amount of data is equal to or greater than a first threshold, using bandwidth data received from another node of the plurality of nodes to determine a transfer path up to the first node so that a data transfer time becomes shortest or a bandwidth for transferring data becomes maximum; and

allocating a resource of a node on the determined transfer path to the cache.

3. The computer-readable, non-transitory storage medium as set forth in claim 2, wherein the determining further comprises:

generating a weighted directed graph in which each of the plurality of nodes in the network is a vertex, each communication path in the network is an edge, a bandwidth of each communication path is a weight, and a data transfer direction is a direction of the edge;

determining a path of a section up to a node having a resource to be allocated to the cache within the transfer path up to the first node, by applying a first algorithm to the weighted directed graph; and

determining a path of a section from the node having the resource to be allocated to the cache to the first node within the transfer pathup to the first node, by applying a second algorithm different from the first algorithm to the weighted directed graph.

4. The computer-readable, non-transitory storage medium as set forth in claim 3, wherein the generating comprises:

generating the weighted directed graph by generating a vertex by virtually aggregating a portion of the plurality of nodes in the network to one node, by generating an edge by virtually aggregating a plurality of communication paths in the network to one communication path and by setting a total of bandwidths of the plurality of communication paths in the network as a virtual bandwidth of the one communication path corresponding to the plurality of communication paths.

5. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the property data includes a first time required for execution of the job and a second time required for a processing to access the data stored in the storage device, and

the determining comprises determining an allocation method of the resources of the plurality of nodes, based on the first time and the second time.

6. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the obtaining comprises obtaining the property data by monitoring accesses to the data stored in the storage device during execution of the job.

7. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the obtaining comprises obtaining the property data from a data storage unit storing the property data during execution of the job.

8. The computer-readable, non-transitory storage medium as set forth in claim 7, wherein the obtaining comprises generating the property data by analyzing an execution program of the job before the execution of the job.

9. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the obtaining comprises obtaining the property data for each execution stage of the job, and

the determining comprises determining a resource to be allocated to the cache for each execution stage of the job.

10. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the procedure further comprises:

detecting an execution start of the job or an execution end of the job by analyzing a program for controlling execution of the job or monitoring the execution of the job; and

upon detecting the execution start of the job or the execution end of the job, increasing a resource to be allocated to the cache in a resource in either of the plurality of nodes.

11. The computer-readable, non-transitory storage medium as set forth in claim 3, wherein the first algorithm or the second algorithm is at least one of a dijkstra method, an A* method, a Bellman-Ford algorithm, an augmenting path method and a pre-flow push method.

12. The computer-readable, non-transitory storage medium as set forth in claim 1, wherein the resource in the parallel computer system includes at least either of a central processing unit or a central processing unit core and a memory or a memory region.

13. A control method, comprising:

obtaining, by using a node of a plurality of nodes that are connected in a parallel computer system through a network, property data representing a property of accesses to data stored in a storage device in a first node of the plurality of nodes for a job to be executed by using data stored in the storage device; and

determining by using the node, a resource to be allocated to a cache among resources included in the parallel computer system and the network based on the obtained property data.

14. A parallel computer system, comprising:

a plurality of nodes that are connected through a network, and

wherein each node of the plurality of nodes comprises;

a memory; and

a processor using the memory and configured to execute a procedure, the procedure comprising;

obtaining property data representing a property of accesses to data stored in a storage device in a first node of the plurality of nodes for a job to be executed by using data stored in the storage device; and

determining a resource to be allocated to a cache among resources included in the parallel computer system and the network based on the obtained property data.