WO2017109890A1 - Ordinateur de gestion et procédé d'exécution de traitement par lots - Google Patents

Ordinateur de gestion et procédé d'exécution de traitement par lots Download PDF

Info

Publication number
WO2017109890A1
WO2017109890A1 PCT/JP2015/085993 JP2015085993W WO2017109890A1 WO 2017109890 A1 WO2017109890 A1 WO 2017109890A1 JP 2015085993 W JP2015085993 W JP 2015085993W WO 2017109890 A1 WO2017109890 A1 WO 2017109890A1
Authority
WO
WIPO (PCT)
Prior art keywords
batch
information
resource
execution
management unit
Prior art date
Application number
PCT/JP2015/085993
Other languages
English (en)
Japanese (ja)
Inventor
貴志 爲重
水野　潤
大介 飯塚
Original Assignee
株式会社日立製作所
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 株式会社日立製作所 filed Critical 株式会社日立製作所
Priority to PCT/JP2015/085993 priority Critical patent/WO2017109890A1/fr
Publication of WO2017109890A1 publication Critical patent/WO2017109890A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services

Definitions

  • the present invention relates to a batch processing execution method executed by a system on a cloud service.
  • a user system (tenant) is constructed on a computer system that provides a cloud service, and various processes are performed on the tenant.
  • the tenant includes a virtual computer and a virtual switch.
  • the user uses the computer resources of the computer system according to the tenant's requirements and processing contents.
  • computer resources are also simply referred to as resources.
  • Patent Document 1 discloses a resource allocation method for maximizing an application level performance index.
  • a cloud service in which the resource usage fee varies depending on the amount of free resources in the computer system or the usage status of the computer system.
  • the provider of the cloud service can grasp the free resource amount of the computer system and the usage status of the computer system, but the user cannot grasp them. For this reason, a fixed amount of resources is allocated to a standard process such as a batch process.
  • a typical example of the invention disclosed in the present application is as follows. That is, a management computer that manages a plurality of computers that provide computer resources, wherein the management computer includes a first processor, a first memory connected to the first processor, and the first processor. A first interface for connecting to a device, wherein each of the plurality of computers includes a second processor, a second memory connected to the second processor, and the second processor; And having a second interface for connecting to a device, on the plurality of computers, at least one business system for providing a predetermined business is constructed using computer resources of the plurality of computers The at least one business system executes a batch process including a plurality of jobs, and the management computer performs the batch process.
  • a batch allocation management unit that manages allocation of computer resources, and a batch execution unit that controls execution of the batch processing, wherein the batch allocation management unit includes a start time of the batch processing and the batch processing Batch processing management information including information related to the first resource, which is a computer resource with a fixed usage charge regardless of the usage time, and job management information for managing the configuration of the plurality of jobs of the batch processing, Policy management information for managing a computer resource allocation policy for the batch processing, and free resource amount history information for managing a history of the free capacity of the second resource, which is a computer resource whose usage fee varies depending on the usage time, Charge history information for managing a history of usage charges of the second resource, and the batch allocation management unit Generating first resource amount prediction information for predicting a free capacity of the second resource based on the resource amount history information, and predicting a usage fee of the second resource based on the fee history information Whether or not the second resource can be used for the batch processing based on the first resource amount prediction information, the first fee prediction information, and the policy management information is
  • the second resource necessary for each of the plurality of jobs is determined based on the batch processing management information and the job management information. Calculating a resource amount, generating first execution plan information for reserving a resource amount of the second resource necessary for each of the plurality of jobs, and the batch execution unit, The execution of the batch process is controlled based on the first execution plan information.
  • FIG. 1 is a diagram illustrating an example of a system configuration of Embodiment 1.
  • FIG. FIG. 3 is a block diagram illustrating a configuration of a management server according to the first embodiment.
  • FIG. 2 is a block diagram illustrating a hardware configuration and a software configuration example of a server that implements IaaS of the first embodiment.
  • FIG. 2 is a block diagram illustrating a hardware configuration and a software configuration example of a server that implements PaaS according to the first embodiment. It is a figure which shows an example of the system configuration information of Example 1. It is a figure which shows an example of the system configuration information of Example 1.
  • FIG. 6 is a diagram illustrating an example of batch processing management information according to the first embodiment.
  • FIG. 6 is a diagram illustrating an example of job management information according to the first exemplary embodiment.
  • FIG. It is a figure which shows an example of the budget information of Example 1.
  • FIG. 6 is a diagram illustrating an example of free resource amount history information according to the first embodiment.
  • FIG. 6 is a diagram illustrating an example of free resource amount history information according to the first embodiment. It is a figure which shows an example of the charge history information of Example 1.
  • FIG. It is a figure which shows an example of the charge history information of Example 1.
  • FIG. It is a figure which shows an example of the policy management information of Example 1.
  • FIG. It is a figure which shows an example of the execution plan management information of Example 1.
  • 6 is a flowchart illustrating an example of an execution plan generation process for batch processing according to the first exemplary embodiment.
  • 6 is a flowchart illustrating an example of an execution plan generation process for batch processing according to the first exemplary embodiment.
  • 6 is a flowchart illustrating an example of an execution plan change process according to the first embodiment.
  • 6 is a flowchart illustrating an example of a resource amount calculation process (scale out) according to the first embodiment.
  • 6 is a flowchart illustrating an example of a resource amount calculation process (scale-up) according to the first embodiment.
  • 3 is a flowchart illustrating an example of execution processing of batch processing according to the first exemplary embodiment.
  • 10 is a flowchart illustrating an example of an execution plan update process for a job according to the first exemplary embodiment.
  • FIG. 10 is a flowchart illustrating an example of an execution plan update process for a job according to the first exemplary embodiment.
  • 6 is a diagram illustrating an example of a user interface displayed by a display unit according to the first embodiment.
  • FIG. It is a figure explaining an example of the effect of the process which the management server of Example 1 performs.
  • FIG. 1 is a diagram illustrating an example of a system configuration of the first embodiment.
  • the system of the first embodiment includes a plurality of computer systems operated by a cloud service provider.
  • the computer system includes a management server 101, a server 102, a virtual server management server 151, a storage subsystem 105, NW-SWs 103 and 104, and an FC-SW 108.
  • the management server 101 manages a computer system group included in the management target system.
  • the management server 101 is connected to the management interface (management I / F) 113 of the NW-SW 103 and the management interface 114 of the NW-SW (business network switch) 104 via the NW-SW (management network switch) 103.
  • the management server 101 can set a VLAN (Virtual LAN) for each NW-SW 103, 104.
  • a virtual server management server 151 that manages a virtual server (virtual machine) running on the server 102 is connected to the NW-SW 103.
  • the NW-SW 103 constitutes a management network.
  • the management network is a network for managing the OS and applications distributed on the plurality of physical servers 102 and the power control, etc. by the management server 101.
  • NW-SW 104 constitutes a business network.
  • the business network is a network used by an application executed by a virtual server on the server 102.
  • the NW-SW 104 is connected to a WAN or the like and communicates with a client computer outside the virtual computer system.
  • the management server 101 is connected to the storage subsystem 105 via an FC-SW (Fibre Channel switch) 108.
  • the management server 101 manages LU (Logical Unit) in the storage subsystem 105.
  • the management server 101 manages N LU1 to LUn.
  • a control unit 110 that manages a computer system such as the server 102 is executed.
  • the control unit 110 refers to and updates the management information group 111.
  • the server 102 to be managed provides a virtual server as described later.
  • the server 102 connects to the NW-SWs 103 and 104 via the PCIex-SW 107 and the I / O device.
  • the PCI Express-SW 107 is connected to a PCI Express standard I / O device.
  • the I / O device has an I / O adapter such as NIC (Network Interface Card), HBA (Host Bus Adapter), and CNA (Converged Network Adapter).
  • the PCIex-SW 107 is an I / O switch that extends a PCI Express bus from a motherboard (or server blade) to the outside and connects a number of PCI-Express devices.
  • a system configuration in which the server 102 is directly connected to the NW-SW 103 and the NW-SW 104 without using the PCIex-SW 107 may be used.
  • the management server 101 is connected to the management interface 117 of the PCIex-SW 107, and manages the connection of the plurality of servers 102 and I / O devices. Further, the server 102 accesses LU1 to LUn of the storage subsystem 105 via an I / O device (HBA in FIG. 1) connected to the PCIex-SW 107.
  • HBA I / O device
  • the virtual server management server 151 manages the first virtualization unit 311 (see FIG. 3) and the second virtual server 314 (see FIG. 3) executed by the server 102. Specifically, the virtual server management unit 161 instructs the first virtualization unit 311.
  • the virtual server management unit 161 instructs power supply control of the second virtual server 314 and migration of the second virtual server 314 and the first virtualization unit 311.
  • the management server 101 may include the virtual server management unit 161.
  • FIG. 2 is a block diagram illustrating the configuration of the management server 101 according to the first embodiment.
  • the management server 101 includes a processor 201, a memory 202, a disk interface 203, and a network interface 204.
  • the processor 201 executes a program stored in the memory 202.
  • the memory 202 stores a program executed by the processor 201 and information necessary for executing the program.
  • the program and information stored in the memory 202 will be described later.
  • the disk interface 203 is an interface for accessing the storage subsystem 105.
  • the network interface 204 is an interface for communicating with other devices via the IP network.
  • one disk interface 203 and one network interface 204 are shown, but a plurality of interfaces may be provided.
  • the management server 101 may have a network interface connected to the NW-SW 103 and a network interface connected to the NW-SW 104.
  • the management server 101 may have a BMC (Basement Management Controller) that performs power control and control of each interface, and a PCI-Express interface for connection to the PCIex-SW 107.
  • BMC Base Management Controller
  • the memory 202 stores a program for realizing the control unit 110 and a management information group 111.
  • the control unit 110 includes a plurality of program modules and provides functions for performing various controls. Specifically, the control unit 110 includes a batch assignment management unit 211, a batch execution unit 212, and a display unit 213.
  • the control unit 110 includes program modules other than those described above, but omits program modules not directly related to the present embodiment.
  • One functional unit may be divided into a plurality of functional units, or a plurality of functional units may be integrated into one functional unit.
  • the batch assignment management unit 211 and the batch execution unit 212 may be a single functional unit.
  • the processor 201 loads the function units of the batch assignment management unit 211, the batch execution unit 212, and the display unit 213 as programs into the memory 202, and executes the loaded programs.
  • the processor 201 operates as a functional unit that realizes a predetermined function by operating according to a program of each functional unit.
  • the processor functions as the batch assignment management unit 211 by operating according to a program that implements the batch assignment management unit 211.
  • the processor 201 also operates as a functional unit that implements each of a plurality of processes executed by each program.
  • the batch allocation management unit 211 manages resource allocation for batch processing. Specifically, the batch allocation management unit 211 generates an execution plan for batch processing based on the usage status of the computer system and the policy for batch processing. The batch execution unit 212 controls the execution of batch processing based on the execution plan generated by the batch assignment management unit 211.
  • the display unit 213 displays various information.
  • the management information group 111 includes system configuration information 221, batch processing management information 222, job management information 223, budget information 224, free resource amount history information 225, fee history information 226, policy management information 227, change method definition information 228, and Execution plan management information 229 is included.
  • the management information group 111 includes other information such as business setting information provided using a tenant, but information that is not directly used in the processing of this embodiment is omitted.
  • System configuration information 221 is information for managing the tenant configuration. Details of the system configuration information 221 will be described with reference to FIGS. 5A and 5B.
  • the batch processing management information 222 is information for managing batch processing executed in each tenant. Details of the batch processing management information 222 will be described with reference to FIG.
  • the job management information 223 is information for managing jobs included in one batch process. Details of the job management information 223 will be described with reference to FIG.
  • budget information 224 manages the budget of users who use one or more tenants. Details of the budget information 224 will be described with reference to FIG.
  • the free resource amount history information 225 is history information related to the resource amount of free resources. Details of the free resource amount history information 225 will be described with reference to FIGS. 9A and 9B.
  • the fee history information 226 is history information related to the usage fee of the free resource. Details of the charge history information 226 will be described with reference to FIGS. 10A and 10B.
  • Policy management information 227 is information indicating a resource allocation policy for each batch process. Details of the policy management information 227 will be described with reference to FIG.
  • the change method definition information 228 is definition information of a resource allocation change method for batch processing. Details of the change method definition information 228 will be described with reference to FIG.
  • the execution plan management information 229 is information for managing an execution plan for batch processing generated by the batch assignment management unit 211.
  • the execution plan includes information related to the start time of batch processing, the amount of resources to be reserved, the type of resources to be reserved, and the like.
  • the batch execution unit 212 executes batch processing based on the execution plan management information 229. Details of the execution plan management information 229 will be described with reference to FIG.
  • FIG. 3 is a block diagram illustrating a hardware configuration and a software configuration example of the server 102 that realizes IaaS (Infrastructure as a Services) of the first embodiment.
  • FIG. 3 shows an example of a software group that can configure a multistage virtual machine. Note that the virtualization infrastructure may or may not be nested.
  • the server 102 includes a processor 301, a memory 302, a network interface 303, a disk interface 304, a BMC 305, and a PCI-Express interface 306.
  • the processor 301 executes a program stored in the memory 302.
  • the memory 302 stores a program executed by the processor 301 and information necessary for executing the program.
  • the program and information stored in the memory 302 will be described later.
  • the network interface 303 is an interface for communicating with other devices via the IP network.
  • the disk interface 304 is an interface for accessing the storage subsystem 105.
  • the BMC 305 performs power supply control and control of each interface.
  • the PCI-Express interface 306 is an interface for connecting to the PCIex-SW 107.
  • one network interface 303, one disk interface 304, and one PCI-Express interface 306 are shown, but a plurality of interfaces may be provided.
  • the server 102 may have a network interface connected to the NW-SW 103 and a network interface connected to the NW-SW 104.
  • the memory 302 stores a program for realizing the first virtualization unit 311 and the second virtualization unit 313, and stores a data group that is an entity of the first virtual server 312 (or logical partition) and the second virtual server 314. Store.
  • the first virtualization unit 311 allocates physical resources to a plurality of first virtual servers 312 (or logical partitions).
  • the second virtualization unit 313 allocates resources of the first virtual server 312 to the plurality of second virtual servers 314.
  • the first virtualization unit 311 that virtualizes the resources of the server 102 is deployed as a lower layer virtualization unit in the memory 302, and the resource (first cluster) is provided to the plurality of second virtualization units 313 that are upper layer virtualization units. 1 virtual server 312).
  • the second virtualization unit 313 generates a plurality of second virtual servers 314 and stores them in the memory 302.
  • the first virtualization unit 311 includes a virtualization unit management interface 351 as a control interface.
  • the second virtualization unit 313 also includes a virtualization unit management interface as a control interface.
  • the first virtualization unit 311 generates a plurality of first virtual servers 312 by virtualizing resources of the server 102 (or blade server) and allocating the virtualized resources to the plurality of first virtual servers 312.
  • the first virtualization unit 311 can be realized using, for example, a hypervisor or a VMM (Virtual Machine Monitor).
  • the second virtualization unit 313 further virtualizes the resource (first virtual server 312) provided by the first virtualization unit 311, and uses the resources of the first virtual server 312 virtualized by the plurality of second virtual servers 314. By assigning, a plurality of second virtual servers 314 are generated.
  • the second virtualization unit 313 can be realized using, for example, a hypervisor or a VMM.
  • the first virtual server 312 includes a virtual device (or logical device) provided by the first virtualization unit 311.
  • the virtual device of the present embodiment includes a virtual processor 321, a virtual memory 322, a virtual network interface 323, a virtual disk interface 324, a virtual BMC 325, and a virtual PCIex interface 326.
  • the virtual device described above is one that is assigned to each first virtual server 312 by the first virtualization unit 311.
  • the second virtual server 314 is also composed of similar virtual devices.
  • the virtual device provided to the second virtual server 314 is the resource (first virtual server 312) allocated by the first virtualization unit 311 to the plurality of second virtualization units 313 and the second virtualization unit 313. This is realized by allocating to each second virtual server 314.
  • the OS 331 is stored in the virtual memory 322.
  • the OS 331 manages virtual devices provided to the first virtual server 312 or the second virtual server 314.
  • An application 341 is executed on the OS 331.
  • the management program 342 running on the OS 331 realizes functions such as failure detection, virtual server power control, and inventory management.
  • the first virtualization unit 311 manages the association between the physical resources of the server 102 and the resources allocated to the second virtualization unit 313.
  • the example in which the first virtualization unit 311 allocates the resources of the first virtual server 312 to the second virtualization unit 313 has been described.
  • the first virtualization unit 311 allocates the resources of the physical server 102 to the second virtual unit 313. You may make it allocate directly to the conversion part 313. In this case, the first virtual server 312 can be omitted.
  • the first virtualization unit 311 can dynamically change the resource of the server 102 to be allocated to the plurality of second virtualization units 313 and can cancel the allocation of the resource.
  • the first virtualization unit 311 holds the resource amount, configuration information, and operation history of the resources allocated to the second virtualization unit 313.
  • the second virtualization unit 313 manages the association between the resources of the first virtual server 312 and the resources allocated to the second virtual server 314.
  • the second virtualization unit 313 can dynamically change the resources of the first virtual server 312 to be allocated to the plurality of second virtual servers 314 and can cancel the allocation of the resources. Further, the second virtualization unit 313 holds the resource amount, configuration information, and operation history of the resources allocated to the second virtual server 314.
  • the first virtualization unit 311 is the first layer
  • the second virtualization unit 313 is the second layer
  • the OS 331 is the third layer.
  • the third layer side is the upper layer
  • the first layer side is the lower layer.
  • the first virtualization unit 311 is the first layer
  • the OS 331 operates in the upper layer.
  • FIG. 4 is a block diagram illustrating a hardware configuration and a software configuration example of the server 102 that realizes PaaS (Platform as a Services) of the first embodiment.
  • the hardware configuration of the server 102 is the same as the hardware configuration of the server 102 shown in FIG.
  • the memory 302 stores a program for realizing the OS 401, the application 402, and the monitoring unit 403.
  • the application 402 and the monitoring unit 403 operate on the OS 401.
  • the memory 302 may store a program for realizing the first virtualization unit 311 and the like.
  • the user constructs a virtual board (tenant) for executing a predetermined task using one or more servers 102 as shown in FIG. 3 or FIG.
  • the user executes a plurality of batch processes using a tenant.
  • the user pays the cloud service provider according to the amount of resources used by the tenant.
  • a resource with a fixed usage charge is described as a fixed price resource regardless of the usage time.
  • a resource whose usage fee varies according to usage time is also referred to as a price variation resource.
  • the management server 101 generates an execution plan that defines resources to be allocated to batch processing so as to satisfy the user policy based on the resource amount of the price fluctuation resource and the usage charge prediction information. As a result, resource allocation for batch processing is dynamically changed. Furthermore, the management server 101 presents an additional batch process related to the batch process, and also generates an execution plan for the additional batch process.
  • 5A and 5B are diagrams illustrating an example of the system configuration information 221 according to the first embodiment.
  • the system configuration information 221 includes an identifier 501, a tenant ID 502, a system ID 503, a hardware characteristic 504, and a software characteristic 505.
  • the identifier 501 is an identifier for uniquely identifying an entry of the system configuration information 221. In this embodiment, it is assumed that an ascending value is automatically set in the identifier 501. A value of any column of the system configuration information 221 or a value obtained by combining values of a plurality of columns may be used as the identifier of the entry. In this case, the identifier 501 may be omitted.
  • the tenant ID 502 is an identifier for uniquely identifying a tenant. In this embodiment, it is assumed that one or more tenants exist for one user.
  • the system ID 503 is an identifier for identifying devices that constitute a tenant.
  • the identifier of the server 102 is stored in the system ID 503, and when the first virtual server 312 or the second virtual server 314 is assigned as a device to the tenant, The identifier of the virtual server is set in the system ID 503.
  • Hardware characteristics 504 indicate the hardware characteristics of the device corresponding to the system ID 503. For example, HBA, NIC, CNA, etc., HBA identifier WWN, NIC identifier MAC address, performance information, architecture information, generation information, model number, support function, vendor type, firmware information, driver information, I / F information, switch information, RAID information, virtualization type, virtualization correspondence information, and the like are stored.
  • Software characteristic 505 indicates the software characteristic of the device corresponding to the system ID 503. For example, OS type, OS version, middleware type, middleware version, application information, management program information, and the like are stored.
  • the information stored in each column of the system configuration information 221 is an example and does not limit the present invention.
  • FIG. 6 is a diagram illustrating an example of the batch processing management information 222 according to the first embodiment.
  • the batch processing management information 222 includes a tenant ID 601, job net ID 602, type 603, start time 604, target time 605, instance number 606, instance type 607, business type 608, execution time 609, and fee 610.
  • the tenant ID 601 is the same as the tenant ID 502.
  • the job net ID 602 is an identifier for uniquely identifying batch processing executed in the tenant.
  • the batch processing includes a plurality of jobs that are the minimum unit of processing.
  • a job net includes a plurality of jobs, and each job is connected to at least one job.
  • batch processing is managed as a job net.
  • Type 603 is a type of batch processing.
  • the type 603 stores at least one of “normal” and “addition”.
  • “Normal” indicates a batch process planned by the user.
  • “Addition” indicates a batch process newly added by an execution plan generation process of a batch process to be described later.
  • a batch process planned by the user is described as a main batch process, and a batch process added in an execution plan generation process and an execution plan update process described later is described as an additional batch process.
  • the start time 604 is the start time of batch processing.
  • the target time 605 is a batch processing completion time when only the fixed price resource is used.
  • the instance number 606 indicates the number of instances allocated to batch processing.
  • the instance indicates a device that executes jobs such as the server 102, the first virtual server 312, and the second virtual server 314.
  • the number of instances of the fixed price resource is set in the instance number 606 of the main batch process. That is, in the initial setting, a value is set in the main batch process so that a fixed price resource is reserved.
  • the instance type 607 is an instance type. In this embodiment, it is assumed that a usage fee is set for each instance type.
  • the business type 608 is a type of batch processing.
  • the business type 608 stores the name of an application executed in batch processing.
  • the execution time 609 is the execution time of batch processing.
  • the fee 610 is a usage fee for resources used by batch processing.
  • the fee 610 stores a usage fee when the number of instances indicated by the instance number 606 is used for the time indicated by the execution time 609.
  • FIG. 7 is a diagram illustrating an example of the job management information 223 according to the first embodiment.
  • One job management information 223 exists for one batch process (job net).
  • the job management information 223 includes a job ID 701, a parallel degree 702, a maximum parallel degree 703, a parallelization time 704, a required performance 705, an execution time 706, and an output job ID 707.
  • the job ID 701 is an identifier that uniquely identifies a job included in a batch process (job net).
  • the degree of parallelism 702 is the number of jobs executed in parallel.
  • An instance (resource) matching the value of the degree of parallelism 702 is assigned to the job executed in parallel. For example, the number of parallel executions of a job whose job ID 701 is “job 1” in FIG. 7 is “2”. Therefore, two instances are assigned to the job, and the two instances execute the same job in parallel.
  • the maximum parallelism 703 is the maximum value of the number of jobs executed in parallel. As will be described later, when the value of the degree of parallelism 702 is smaller than the value of the maximum degree of parallelism 703, it indicates that the job can add resources.
  • the parallelization time 704 is a processing time required for executing jobs in parallel.
  • the required performance 705 is performance required for an instance executing a job, that is, a resource amount.
  • the execution time 706 is a job execution time.
  • the output job ID 707 is an identifier of a job to which a job processing result corresponding to the job ID 701 is output. Based on the output job ID 707, the management server 101 can grasp the connection relationship of jobs in the job net. In the case of a job that does not output the processing result to another job, the output job ID 707 is blank. For example, the output job ID 707 of the job executed at the end of the job net is blank.
  • the management server 101 holds the job management information 223 as job initial setting information. This makes it possible to compare the execution time before and after the resource allocation change, performance, price, and the like.
  • the batch process management information 222 and the job management information 223 are information generated from information input when the user constructs a tenant.
  • the management server 101 may generate the batch processing management information 222 and the job management information 223 based on the current tenant setting information and the like.
  • FIG. 8 is a diagram illustrating an example of the budget information 224 according to the first embodiment.
  • Budget information 224 includes tenant ID 801, date 802, and budget 803.
  • the tenant ID 801 is the same as the tenant ID 502.
  • One tenant entry includes budget rows with different dates.
  • a date 802 is a date on which the set budget is applied.
  • a budget 803 is a budget applied on the date designated by the date 802. The budget may be managed for each user.
  • a monthly budget for each tenant is set. Therefore, year and month are set for the date 802. In the budget 803, an operation budget for one month is set. Note that the budget setting period can be changed as appropriate.
  • the budget information 224 is information generated from information input when a user constructs a tenant or the like. Note that the management server 101 can appropriately update the budget information 224 based on a request from the user.
  • the free resource amount history information 225 of the present embodiment includes first resource amount history information 900 and second resource amount history information 910.
  • the first resource amount history information 900 is history information on the number of unused instances provided as price fluctuation resources.
  • the first resource amount history information 900 includes a date 901 and columns of a plurality of instance types.
  • the date 901 is the date when the history is acquired.
  • the first resource amount history information 900 includes columns corresponding to the types of instances.
  • the first resource amount history information 900 includes Physical Server 902, VM xlarge 903, VM large 904, VM medium 905, VM small 906, and VM tiny 907.
  • Each column stores the number of unused instances corresponding to the instance type.
  • the second resource amount history information 910 is history information on the amount of free resources of a device that allocates resources to instances provided as price fluctuation resources.
  • the second resource amount history information 910 includes a date 911, an instance type 912, a system ID 913, a processor 914, a memory 915, and an IOPS 916.
  • Date 911 is the same as date 901.
  • the instance type 912 is an instance type.
  • the system ID 913 is an identifier of an instance included in the price fluctuation resource.
  • the system ID 913 stores an identifier similar to the system ID 503.
  • the processor 914, the memory 915, and the IOPS 916 are free resource amounts of the instance.
  • the processor 914 stores the number of processors that are not used.
  • the memory 915 stores the capacity of the memory that is not used.
  • the IOPS 916 is an IOPS (I / O per Second) indicating the I / O performance of the instance.
  • the IOPS is not a free resource, but is used as one of resource allocation indexes. Therefore, the second resource amount history information 910 includes the IOPS of each instance.
  • FIGS. 10A and 10B are diagrams illustrating an example of the charge history information 226 according to the first embodiment.
  • the fee history information 226 of the present embodiment includes first fee history information 1000 and second fee history information 1010.
  • the first fee history information 1000 is usage fee history information for each instance type provided as a price fluctuation resource.
  • the first fee history information 1000 includes a date 1001 and a column of a plurality of instance types.
  • the date 1001 is the same as the date 901.
  • the first fee history information 1000 includes a physical server 1002, a VM xlarge 1003, a VM large 1004, a VM medium 1005, a VM small 1006, and a VM tiny 1007 as columns of instance types. Each column stores a usage fee for one instance corresponding to the instance type.
  • the second fee history information 1010 is the history information of the usage fee of the free resource of the device that allocates the resource to the instance provided as the price fluctuation resource.
  • the second fee history information 1010 includes a date 1011, an instance type 1012, a fee (processor) 1013, a fee (memory) 1014, and a fee (IOPS) 1015.
  • the date 1011 is the same as the date 1001.
  • the instance type 1012 is the same as the instance type 912.
  • a usage fee history is managed for each instance type.
  • the fee (processor) 1013 stores the usage fee of the processor of the instance corresponding to the instance type 1012.
  • the fee (memory) 1014 stores a memory usage fee of the instance corresponding to the instance type 1012.
  • the charge (IOPS) 1015 stores the IOPS usage charge of the instance corresponding to the instance type 1012.
  • FIG. 11 is a diagram illustrating an example of the policy management information 227 according to the first embodiment.
  • Policy management information 227 manages a policy preset by the user. For example, when registering a batch process, the user sets a policy for the batch process (job net). The timing for setting the policy is not limited to this.
  • the policy management information 227 includes a job net ID 1101, a policy ID 1102, a policy type 1103, a change method 1104, a batch processing addition condition 1105, and a selection flag 1106.
  • the job net ID 1101 is the same as the job net ID 602.
  • one or more policies are set for one job net.
  • the policy ID 1102 is an identifier for uniquely identifying the policy set for the job net.
  • the policy type 1103 is a policy type.
  • the change method 1104 is definition information of a resource allocation change method. Note that the change method 1104 may store a program, a processing code, and the like.
  • the batch process addition condition 1105 is a condition for adding a new batch process.
  • the batch processing addition condition 1105 of “Policy 2” indicates that the addition of the batch processing is permitted if it can be added within a fee exceeding 10% of the budget.
  • the batch processing addition condition 1105 of “Policy 3” indicates that the addition of the batch processing is permitted if it can be added within the budget.
  • the selection flag 1106 is a flag indicating whether or not the policy is selected by the user. In this embodiment, “ON” is set in the policy selection flag 1106 selected by the user. In this embodiment, when one policy is set for one job, “ON” is automatically set in the selection flag 1106. In addition, when a plurality of policies are set for one job, the policy to be applied by the user is selected.
  • FIG. 12 is a diagram illustrating an example of the change method definition information 228 according to the first embodiment.
  • the change method definition information 228 manages the resource allocation change method preset by the administrator.
  • the change method definition information 228 includes a method ID 1201, a process type 1202, a target 1203, and an additional amount 1204.
  • Method ID 1201 is an identifier for uniquely identifying the change method registered in the change method definition information 228.
  • the process type 1202 is a type of change method. In this embodiment, either “scale out” or “scale up” is stored in the processing type 1202.
  • Scaling out is a method of changing resources allocated to a job by adding instances.
  • Scale-up is a method of changing the resource allocated to a job by adding the performance of the instance, that is, the resource allocated to the instance.
  • Target 1203 is a resource to be added.
  • the addition amount 1204 is a change amount of the resource to be added.
  • FIG. 13 is a diagram illustrating an example of the execution plan management information 229 according to the first embodiment.
  • one entry corresponds to one batch processing execution plan.
  • One entry includes a job net ID 1301, method ID 1302, job ID 1303, parallelism 1304, parallelization time 1305, required performance 1306, execution time 1307, fee 1308, efficiency 1309, confirmation flag 1310, and execution flag 1311.
  • the job net ID 1301 is the same as the job net ID 602.
  • the method ID 1302 is the same as the method ID 1201.
  • the job ID 1303 is the same as the job ID 701.
  • the parallelism 1304, the parallelization time 1305, the required performance 1306, and the execution time 1307 are the same as the parallelism 702, the parallelization time 704, the required performance 705, and the execution time 706.
  • values after the resource allocation is changed are stored in the degree of parallelism 1304, the parallelization time 1305, the required performance 1306, and the execution time 1307.
  • the fee 1308 is a fee for using resources used when executing a job.
  • Efficiency 1309 is an index indicating cost performance due to a change in resource allocation.
  • the confirmation flag 1310 is a flag indicating that the execution plan is actually used. That is, the confirmation flag 1310 indicates that the job is executed based on the generated execution plan.
  • the value of “0” or “1” is stored in the confirmation flag 1310 of this embodiment. “0” indicates that the execution plan is not adopted, and “1” indicates that the execution plan is adopted.
  • the execution flag 1311 is a flag indicating whether or not the job has been executed.
  • the execution flag 1311 of this embodiment stores either “0” or “1”. “0” indicates that the job has been executed, and “1” indicates that the job has not been executed.
  • 14A and 14B are flowcharts illustrating an example of an execution plan generation process for batch processing according to the first embodiment.
  • the batch allocation management unit 211 starts processing at a predetermined opportunity. For example, it is executed when a batch process is newly registered, when the free resource amount history information 225 or the like is updated, or when the change rate of the free resource amount of the price fluctuation resource is larger than a predetermined threshold. Also, the batch allocation management unit 211 periodically refers to the start time 604 of the batch processing management information 222 and determines whether there is a batch process that is executed within one hour from the current time. Good.
  • a list including a plurality of entries including the identifier of the newly registered batch process (job net) and the identifier of the tenant on which the batch process is executed is input to the batch assignment management unit 211 as input information. .
  • the batch allocation management unit 211 predicts the state of the computer system (step S1401). Specifically, the following processing is executed.
  • the batch allocation management unit 211 performs machine learning using the free resource amount history information 225, and generates a free resource amount prediction function with time as a variable as resource amount prediction information.
  • the prediction function generated based on the first resource amount history information 900 is described as a first resource amount prediction function
  • the prediction function generated based on the second resource amount history information 910 is referred to as a second resource.
  • quantity prediction function Also described as quantity prediction function.
  • the batch allocation management unit 211 can calculate the number of instances using the first resource amount prediction function, and calculate the resource amount allocated to one instance using the second resource amount prediction function. Can do. Note that there are as many first resource amount prediction functions and second resource amount prediction functions as the number of instance types.
  • the batch allocation management unit 211 performs machine learning using the fee history information 226, and generates a function for predicting the usage fee of the price fluctuation resource with time as a variable, as usage fee prediction information.
  • the prediction function generated based on the first fee history information 1000 is described as a first fee prediction function
  • the prediction function generated based on the second fee history information 1010 is referred to as a second fee prediction function. Describe. Note that there are as many first charge prediction functions and second charge prediction functions as the number of instance types.
  • the batch allocation management unit 211 executes machine learning using history information in units of one week, and generates each prediction function from the present to one week later. Since machine learning using history information is a well-known technique, description thereof is omitted. The above is the description of the processing in step S1401.
  • the batch assignment management unit 211 starts a loop process for batch processing (step S1402). Specifically, one target batch process is selected from a plurality of batch processes. In the following description, the batch process selected in step S1402 is also referred to as a selected batch process.
  • the batch allocation management unit 211 may select a batch processing group of a tenant with a large operation budget and select a plurality of batch processing of the tenant using the method described above.
  • the batch assignment management unit 211 determines a policy for the selected batch process (step S1403). Specifically, the following processing is executed.
  • the batch assignment management unit 211 refers to the policy management information 227 and searches for an entry in which the job net identifier corresponding to the selected batch process is stored in the job net ID 1101.
  • the batch assignment management unit 211 When a plurality of entries are searched, the batch assignment management unit 211 presents a selectable policy to the user via the display unit 213, and accepts input from the user. In this case, the batch assignment management unit 211 sets “ON” in the selection flag 1106 of the entry corresponding to the policy selected by the user.
  • step S1414 If there is no policy applicable to the selected batch process, or if the user does not select a policy, the batch assignment management unit 211 proceeds to step S1414 without executing any particular process.
  • the above is the description of the process in step S1403.
  • step S1404 the batch assignment management unit 211 starts a loop process of the changing method. Specifically, the following processing is executed.
  • the batch allocation management unit 211 refers to the change method definition information 228 and selects one change method to be used. For example, the batch assignment management unit 211 sequentially selects entries from the change method definition information 228 in order. Further, based on the policy, applicable change methods may be listed, and one change method to be used may be selected from the list.
  • the batch allocation management unit 211 adds an entry to the execution plan management information 229, and sets the job net identifier corresponding to the selected batch process in the job net ID 1301. Further, the batch assignment management unit 211 sets the identifier of the selected change method in the method ID 1302 of the added entry.
  • the batch assignment management unit 211 refers to the job management information 223 associated with the identifier of the job net corresponding to the selected batch process, and adds as many lines as the number of jobs to the added entry.
  • the batch allocation management unit 211 includes a job ID 701, a degree of parallelism 702, a parallelization time 704, a required performance 705, a job ID 1303, a parallelism 1304, a parallelization time 1305, a required performance 1306, and an execution time 1307 of each added row. And the value of the execution time 706 is set. That is, the batch assignment management unit 211 copies the contents of the job management information 223 to the added entry.
  • the batch assignment management unit 211 acquires the number of instances 606 of the selected batch process, the execution time 609, and the charge 610 from the batch process management information 222.
  • the batch allocation management unit 211 calculates a charge per unit time (first charge) of one instance using the number of instances 606, the execution time 609, and the charge 610.
  • the batch allocation management unit 211 can calculate the first fee by dividing the value of the fee 610 by the value of the number of instances 606 and further dividing the calculated value by the execution time 609.
  • the batch allocation management unit 211 calculates a fee required for job execution based on the parallelism 702, the parallelization time 704, and the execution time 706 of each job and the first fee. For example, the batch allocation management unit 211 can calculate the above-described fee by multiplying the first fee by the degree of parallelism 702 and multiplying the calculated value by a value obtained by adding the parallelization time 704 and the execution time 706.
  • the batch allocation management unit 211 sets the calculated value in the charge 1308. Further, the batch allocation management unit 211 sets “1” for the efficiency 1309 of the added entry, and sets “0” for the confirmation flag 1310 and the execution flag 1311. The above is the description of step S1404.
  • step S1405 the batch assignment management unit 211 starts a loop process of the selected batch process job.
  • the job selected in step S1405 is also referred to as a selected job. Specifically, the following processing is executed.
  • the batch assignment management unit 211 grasps the connection relation of a plurality of jobs included in the selected batch process based on the output job ID 707 of the job management information 223 for the selected batch process.
  • the batch allocation management unit 211 selects jobs in the execution order based on the connection relation of jobs. Note that when there are a plurality of jobs having a connection relationship to be output to the same job, the batch assignment management unit 211 selects one job from the plurality of jobs based on the job ID 701. The above is the description of the processing in step S1405.
  • the batch assignment management unit 211 determines whether or not a price fluctuation resource is available for the selected job (step S1406).
  • the determination method differs depending on the policy.
  • the batch allocation management unit 211 refers to the batch process management information 222 and acquires the time from the start time 604 of the entry corresponding to the selected batch process.
  • the batch allocation management unit 211 substitutes the time into the first fee prediction function corresponding to the type of the instance, and starts the selected batch process.
  • the price (second charge) of the price fluctuation resource (instance) is calculated.
  • the batch allocation management unit 211 determines whether or not the second fee is lower than the first fee. That is, it is determined whether the price of the price fluctuation resource is lower than the price of the fixed price resource.
  • the batch allocation management unit 211 determines that the price fluctuation resource is available because there is a possibility of reducing the fee.
  • the batch allocation management unit 211 calculates the free resource amount (number of instances) of the price fluctuation resource when executing the selected job by substituting the time into the first resource amount prediction function corresponding to the instance type.
  • the batch allocation management unit 211 refers to the entry corresponding to the selected job in the job management information 223.
  • the batch assignment management unit 211 determines whether or not the value of the parallel degree 702 of the referenced entry is smaller than the calculated number of instances. That is, it is determined whether or not the number of unused instances of the price fluctuation resource is larger than the number of instances assigned to the selected job.
  • the batch allocation management unit 211 determines that the price fluctuation resource is available because there is a possibility that the execution time of the batch processing may be shortened. To do.
  • the batch allocation management unit 211 uses a determination method in which (1) and (2) are combined. That is, the batch allocation management unit 211 determines whether or not the second fee is lower than the first fee and the value of the degree of parallelism 702 is smaller than the calculated number of instances. If any determination result is YES, the batch allocation management unit 211 determines that the price fluctuation resource is available.
  • step S1407 the batch allocation management unit 211 executes an execution plan change process. Details of the execution plan change process will be described with reference to FIG.
  • the batch assignment management unit 211 determines whether or not the processing has been completed for all jobs included in the selected batch processing (step S1408).
  • step S1405 selects a new job, and executes the same process.
  • the batch assignment management unit 211 determines whether processing has been completed for all change methods (step S1409). .
  • step S1404 selects a new change method, and executes the same processing.
  • the batch allocation management unit 211 determines whether there is an execution plan that satisfies the policy based on the entry group added to the execution plan management information 229. Is determined (step S1410). In this embodiment, as described below, the determination method differs depending on the policy.
  • the batch allocation management unit 211 calculates a fee for each execution plan. Specifically, the batch allocation management unit 211 calculates the charge for one execution plan by summing the charges 1308 for each row included in one execution plan entry. The batch allocation management unit 211 determines whether there is an execution plan for which the calculated fee is lower than the fee 610 for the selected batch process. If there is an execution plan whose calculated charge is lower than the charge 610 for the selected batch process, the batch allocation management unit 211 determines that there is an execution plan that satisfies the policy.
  • the batch allocation management unit 211 calculates the execution time of each execution plan. Specifically, the batch allocation management unit 211 calculates the execution time of one execution plan by summing the parallelization time 1305 and the execution time 1307 of each row included in one execution plan entry. The batch assignment management unit 211 determines whether there is an execution plan whose calculated execution time is shorter than the execution time 609 of the selected batch process. If there is an execution plan whose calculated execution time is smaller than the execution time 609 of the selected batch process, the batch assignment management unit 211 determines that there is an execution plan that satisfies the policy.
  • the batch allocation management unit 211 determines whether the total execution time of the main batch process and the execution time of the additional batch process is smaller than the target time 605. In addition, the batch allocation management unit 211 refers to the budget information 224, stores the tenant identifier for which the selected batch process is executed in the tenant ID 801, and sets the date and time corresponding to the time when the selected batch process is executed as the date 802. Search for entries. The batch assignment management unit 211 acquires the budget 803 of the searched entry. The batch allocation management unit 211 determines whether or not the batch processing additional condition 1105 is satisfied based on the sum of the main batch processing fee and the additional batch processing fee, and the budget 803.
  • the batch allocation management unit 211 determines that there is no execution plan that satisfies the policy.
  • the batch allocation management unit 211 calculates the execution efficiency of each execution plan. Specifically, the batch allocation management unit 211 calculates an average value of efficiency using the efficiency 1309 of each row included in one execution plan entry, and sets the average value as the execution efficiency of one execution plan. . The batch allocation management unit 211 determines whether there is an execution plan with the calculated execution efficiency greater than “1”. When there is an execution plan with the calculated execution efficiency greater than “1”, the batch allocation management unit 211 determines that there is an execution plan that satisfies the policy.
  • the batch allocation management unit 211 determines whether the execution efficiency of the main batch process is greater than “1”, and the execution efficiency of the additional batch process is greater than “1”. It is determined whether or not. Further, the batch allocation management unit 211 determines whether or not the batch processing additional condition 1105 is satisfied based on the total of the main batch processing fee and the additional batch processing fee and the budget 803. If any one of the conditions is not satisfied, the batch allocation management unit 211 determines that there is no execution plan that satisfies the policy.
  • the batch allocation management unit 211 selects one execution plan to be adopted (step S1411).
  • the batch allocation management unit 211 selects an execution plan that is most effective. For example, in the case of a policy whose policy type 1103 is “cost”, the batch allocation management unit 211 selects an execution plan with the lowest charge. When the policy type 1103 is a policy having “target time”, the batch allocation management unit 211 selects an execution plan that has the shortest execution time. When the policy type 1103 is a policy having “cost performance”, the batch allocation management unit 211 selects an execution plan having the highest execution efficiency. Note that the batch allocation management unit 211 may delete the execution plan that has not been selected, or may use the execution plan that has not been selected as new knowledge.
  • the batch allocation management unit 211 reserves resources based on the selected execution plan (step S1412).
  • the batch assignment management unit 211 secures resources so that they are not assigned to other batch processes. Since the resource reservation method is a known technique, the description thereof is omitted. At this time, the batch assignment management unit 211 sets “1” to the confirmation flag 1310 of each line of the selected execution plan.
  • the batch assignment management unit 211 determines whether addition of batch processing is permitted (step S1413).
  • the batch assignment management unit 211 refers to the policy batch processing addition condition 1105 and determines whether or not information indicating that the addition of batch processing is permitted is set.
  • the batch assignment management unit 211 determines whether the process has been completed for all the batch processes included in the list (step S1414).
  • the batch assignment management unit 211 If it is determined that the processing has not been completed for all the batch processes included in the list, the batch assignment management unit 211 returns to step S1402, selects a new batch process, and executes the same process. At this time, the batch assignment management unit 211 presents the processing result for the batch processing to the user via the display unit 213.
  • the batch assignment management unit 211 ends the execution plan generation process of the batch process.
  • step S1413 If it is determined in step S1413 that the addition of batch processing is permitted, the batch assignment management unit 211 presents a list of batch processes that can be added to the user via the display unit 213 (step S1420). Settings for additional batch processing are accepted (step S1421). Thereafter, the batch assignment management unit 211 returns to step S1403, and executes the same process with the additional batch process as the selected batch process. In this case, the loop process of the main batch process is continued.
  • the batch allocation management unit 211 may be considered to present a batch process for which an execution plan has been generated as an addable batch process.
  • the batch allocation management unit 211 may be presented as a batch process that can add another batch process executed in the tenant.
  • the batch assignment management unit 211 When the batch assignment management unit 211 receives the setting, the batch assignment management unit 211 updates the batch processing management information 222 and the job management information 223. Note that “addition” is set in the additional batch processing type 603.
  • a batch process added in advance by the user may be defined in the batch process management information 222.
  • the batch assignment management unit 211 selects a batch process to be automatically added based on the batch process management information 222.
  • the process of step S1422 can be omitted.
  • step S1410 determines whether the selected batch process is an additional batch process (step S1417).
  • the batch assignment management unit 211 determines whether the type 603 of the row corresponding to the selected batch process in the batch process management information 222 is “addition”. When the type 603 is “addition”, the batch assignment management unit 211 determines that the selected batch process is an additional batch process.
  • the batch assignment management unit 211 reserves a resource for the batch process based on the job management information 223 (step S1418). Thereafter, the batch assignment management unit 211 proceeds to step S1414.
  • the batch allocation management unit 211 deletes all execution plans for the selected batch process registered in the execution plan management information 229 and generates an execution plan for the selected batch process based on the job management information 223. That is, an execution plan for the selected batch process is generated according to the initial setting. In this case, an entry having the same content as the entry generated in step S1404 is generated in the execution plan management information 229. That is, the price fluctuation resource is not used.
  • the batch allocation management unit 211 deletes all execution plans for the additional batch process from the execution plan management information 229 (step S1419). Thereafter, the batch assignment management unit 211 proceeds to step S1414.
  • the batch assignment management unit 211 presents the processing result for the main batch process to the user via the display unit 213.
  • step S1406 determines whether the price fluctuation resource is not available. If it is determined in step S1406 that the price fluctuation resource is not available, the batch assignment management unit 211 determines whether the selected batch process is an additional batch process (step S1415). The process of step S1415 is the same as that of step S1417.
  • step S1408 the batch assignment management unit 211 proceeds to step S1408. That is, for the selected batch process, the execution plan change process is not executed, and the loop process of the selected batch process ends.
  • the batch assignment management unit 211 deletes the execution plan of the additional batch process from the execution plan management information 229 (step S1416). Thereafter, the batch assignment management unit 211 proceeds to step S1414. At this time, the batch assignment management unit 211 presents the processing result for the main batch process to the user via the display unit 213.
  • FIG. 15 is a flowchart illustrating an example of an execution plan change process according to the first embodiment.
  • the batch allocation management unit 211 determines whether or not the processing type 1202 of the change method selected in step S1404 is “scale-out” (step S1501).
  • the batch allocation management unit 211 executes a resource amount calculation process (scale-out) (step S1502), and then changes the execution plan. The process ends. Details of the resource amount calculation process (scale-out) will be described with reference to FIG.
  • the batch allocation management unit 211 executes a resource amount calculation process (scale up) (step S1503), and then changes the execution plan. The process ends. Details of the resource amount calculation process (scale-up) will be described with reference to FIG.
  • FIG. 16 is a flowchart illustrating an example of a resource amount calculation process (scale out) according to the first embodiment.
  • the batch assignment management unit 211 determines whether or not the parallelism of the selected job can be increased (step S1601). Specifically, the following processing is executed.
  • the batch assignment management unit 211 refers to the entry of the selected job in the job management information 223 and determines whether the value of the parallel degree 702 is smaller than the value of the maximum parallel degree 703.
  • the batch assignment management unit 211 determines that the degree of parallelism of the selected job cannot be increased.
  • the batch allocation management unit 211 calculates the additional degree of parallelism by subtracting the value of the degree of parallelism 702 from the value of the maximum degree of parallelism 703. The batch allocation management unit 211 determines whether or not the value of the additional amount 1204 of the change process selected in step S1404 is smaller than the additional parallelism.
  • the batch assignment management unit 211 determines that the parallelism of the selected job cannot be increased.
  • the batch assignment management unit 211 determines that the parallelism of the selected job can be increased. The above is the description of the processing in step S1601.
  • the batch allocation management unit 211 ends the resource amount calculation process (scale-out).
  • the batch allocation management unit 211 calculates a resource amount necessary for increasing the degree of parallelism (step S1602).
  • the batch allocation management unit 211 calculates the number of instances (resource amount) required when the degree of parallelism is increased using the selected addition amount 1204 of the change process and the degree of parallelism 702. For example, when the additional amount 1204 is “twice”, the value obtained by multiplying the value of the degree of parallelism 702 by “2” is the number of instances (resource amount) required when the degree of parallelism is increased.
  • the batch allocation management unit 211 determines whether there is a resource amount necessary for the price fluctuation resource (step S1603).
  • the method for determining whether or not the necessary resource amount exists in the resource pool is a known method, and therefore detailed description thereof is omitted. For example, the following method can be used.
  • the batch allocation management unit 211 refers to the second resource amount history information 910 and determines whether or not the number of instances of a predetermined type having a resource with the required performance 1306 or higher is greater than or equal to the degree of parallelism after the change. When the above-described conditions are satisfied, the batch allocation management unit 211 determines that there is a necessary resource amount for the price fluctuation resource.
  • the batch allocation management unit 211 ends the resource amount calculation process (scale-out).
  • the batch allocation management unit 211 calculates the execution time and usage fee of the selected job after the change of the parallelism (step S1604). Further, the batch allocation management unit 211 updates the value of the row corresponding to the selected job in the execution plan management information 229 (step S1605), and then ends the resource amount calculation process (scale out). Specifically, the following processing is executed.
  • the batch allocation management unit 211 calculates the change ratio by dividing the parallel degree after the change by the parallel degree before the change.
  • the batch assignment management unit 211 calculates a first evaluation value by multiplying the change ratio by a predetermined coefficient.
  • the batch allocation management unit 211 calculates a new execution time by dividing the value of the execution time 1307 by the first evaluation value. For example, when the first evaluation value is “2”, the execution time of the selected job is half the time before the change.
  • the batch assignment management unit 211 calculates a second evaluation value by multiplying the change ratio by a predetermined coefficient.
  • the batch allocation management unit 211 calculates a new fee by multiplying the value of the fee 1308 by the second evaluation value. For example, when the second evaluation value is “2”, the charge for the selected job is double the charge before the change.
  • the batch allocation management unit 211 sets the calculated execution time and fee in the execution time 1307 and fee 1308 of the row corresponding to the selected job. The above is the description of the processing in steps S1604 and S1605.
  • FIG. 17 is a flowchart illustrating an example of a resource amount calculation process (scale-up) according to the first embodiment.
  • the batch allocation management unit 211 calculates a resource amount necessary when the required performance of the instance is changed (step S1701).
  • the batch allocation management unit 211 calculates the required performance of the instance based on the selected addition amount 1204 of the change process and the required performance 1306. For example, when the additional amount 1204 is “double”, the batch assignment management unit 211 multiplies each value of the required performance 1306 in the row of the selected job by “2”.
  • the batch allocation management unit 211 determines whether there is a necessary resource amount for the price fluctuation resource (step S1702).
  • the method for determining whether or not the necessary resource amount exists in the resource pool is a known method, and therefore detailed description thereof is omitted. For example, the following method can be used.
  • the batch allocation management unit 211 refers to the second resource amount history information 910 and determines whether or not the number of instances of a predetermined type having a resource equal to or higher than the calculated required performance is greater than or equal to the value of the parallelism 1304. . When the above-described conditions are satisfied, the batch allocation management unit 211 determines that there is a necessary resource amount for the price fluctuation resource.
  • the batch allocation management unit 211 ends the resource amount calculation process (scale-up).
  • the batch allocation management unit 211 calculates the execution time and usage fee of the selected job after changing the requested performance of the instance (step S1703). Furthermore, the batch allocation management unit 211 updates the value of the row corresponding to the selected job in the execution plan management information 229 (step S1704), and then ends the resource amount calculation process (scale-up). Specifically, the following processing is executed.
  • the batch allocation management unit 211 calculates the change ratio by dividing the required performance after the change by the required performance before the change. When conditions are set for a plurality of resources, the batch allocation management unit 211 calculates a change ratio for each resource, and uses an average value of the change ratios for each resource.
  • the batch allocation management unit 211 calculates a third evaluation value by multiplying the change ratio by a predetermined coefficient.
  • the batch allocation management unit 211 calculates a new execution time by dividing the value of the execution time 1307 by the third evaluation value. For example, when the third evaluation value is “2”, the execution time of the selected job is half the time before the change.
  • the batch allocation management unit 211 calculates the fourth evaluation value by multiplying the change ratio by a predetermined coefficient.
  • the batch allocation management unit 211 calculates a new fee by multiplying the value of the fee 1308 by the fourth evaluation value. For example, when the fourth evaluation value is “2”, the charge for the selected job is double the charge before the change.
  • the batch allocation management unit 211 sets the calculated execution time and fee in the execution time 1307 and fee 1308 of the row corresponding to the selected job. The above is the description of the processing in steps S1703 and S1704.
  • FIG. 18 is a flowchart illustrating an example of the execution process of the batch process according to the first embodiment.
  • the batch execution unit 212 periodically refers to the start time 604 of the batch process management information 222 and identifies the target batch process (step S1801). For example, the batch execution unit 212 identifies a batch process executed within one hour from the current time as the target batch process.
  • the batch execution unit 212 refers to the execution plan management information 229 and specifies an execution plan corresponding to the specified batch process (step S1802).
  • the batch execution unit 212 searches for an entry in which the job net ID 1301 matches the identified identifier of the batch process, and the confirmation flag 1310 is set to “1”.
  • the batch execution unit 212 deploys a job to be executed first based on the specified execution plan, and instructs the start of the job (step S1803).
  • the batch execution unit 212 allocates a resource to the job to be executed first, and deploys necessary software to the resource (instance).
  • the batch execution unit 212 instructs the job to be executed after the start time 604 has elapsed.
  • the batch execution unit 212 sets “0” in the determination flag 1310 of the line of the job instructed to execute, and sets “1” in the execution flag 1311.
  • the batch execution unit 212 determines whether there is a job to be executed next (step S1804).
  • the batch execution unit 212 refers to the job management information 223 based on the value of the job net ID 1301. The batch execution unit 212 determines whether there is a job to be executed next to the started job based on the output job ID 707 of the job management information 223.
  • the job specified in step S1804 is also referred to as a target job.
  • the batch execution unit 212 ends the execution process of the batch process.
  • the batch execution unit 212 sets the start time of the execution plan update process for the job (step S1805). For example, a method is conceivable in which 10 minutes before the target job is started is set as the start time of the execution plan update process.
  • the start time of the target job can be calculated using the start time of the job that is the output source of the target job and the execution time 1307 of the job.
  • the batch execution unit 212 determines whether or not the set start time has elapsed (step S1806).
  • the batch execution unit 212 If it is determined that the set start time has not elapsed, the batch execution unit 212 returns to step S1806 and waits until the start time elapses.
  • the batch execution unit 212 If it is determined that the set start time has elapsed, the batch execution unit 212 outputs an execution instruction for execution plan update processing to the batch assignment management unit 211 (step S1807).
  • the execution instruction includes an identifier for batch processing and an identifier for the target job.
  • the batch execution unit 212 determines whether or not a processing completion notification has been received from the batch assignment management unit 211 (step S1808).
  • the batch execution unit 212 If it is determined that the process completion notification has not been received from the batch allocation management unit 211, the batch execution unit 212 returns to step S1808 and waits until a completion notification is received.
  • the batch execution unit 212 allocates resources to the target job based on the execution plan, and the target job is output after completion of the output source job.
  • the job execution is instructed (step S1809). Thereafter, the batch execution unit 212 returns to step S1804 and executes the same processing.
  • 19A and 19B are flowcharts for explaining an example of an execution plan update process for a job according to the first embodiment.
  • the batch allocation management unit 211 When the batch allocation management unit 211 receives an execution instruction for job execution plan update processing from the batch execution unit 212, the batch allocation management unit 211 starts processing described below.
  • the batch allocation management unit 211 predicts the state of the computer system (step S1901).
  • the process of step S1901 is the same as the process of step S1401. Since each prediction function is generated from the history information at the time of execution of step S1901, it differs from the prediction function generated in step S1401.
  • the batch assignment management unit 211 determines a policy for batch processing including the target job (step S1902).
  • batch processing including a target job is also referred to as target batch processing.
  • the batch allocation management unit 211 refers to the policy management information 227, stores the identifier of the job net corresponding to the target batch process in the job net ID 1101, and stores “ON” in the selection flag 1106. Search for entries. If a batch processing policy is selected during execution of a batch processing execution plan change process, the target batch processing policy is uniquely determined.
  • step S1903 the batch assignment management unit 211 starts a loop process of the change method.
  • the process in step S1903 is the same as the process in step S1404.
  • step S1904 whether the batch allocation management unit 211 is in a state where the price fluctuation resource is available for the target job based on the determined policy.
  • the process in step S1904 is the same as the process in step S1406.
  • step S1906 If it is determined that the price fluctuation resource is not available, the batch allocation management unit 211 proceeds to step S1906.
  • step S1905 the batch allocation management unit 211 executes an execution plan change process.
  • the process in step S1905 is the same as the process in step S1407.
  • the execution plan change process the resource reservation for the target job is updated. It does not change the reservation of resources for other jobs.
  • step S1906 determines whether or not processing has been completed for all the change methods.
  • step S1906 is the same as the process in step S1409.
  • the batch assignment management unit 211 returns to step S1903, selects a new change method, and executes the same processing.
  • the batch allocation management unit 211 determines whether there is an execution plan that satisfies the policy based on the entry group added to the execution plan management information 229. Is determined (step S1907).
  • the process in step S1907 is the same as the process in step S1410.
  • the batch assignment management unit 211 ends the execution plan update process.
  • step S1908 If it is determined that there is an execution plan that satisfies the policy, the batch allocation management unit 211 selects one execution plan to be adopted (step S1908).
  • the process in step S1908 is the same as the process in step S1411.
  • the batch assignment management unit 211 reserves the resource of the target job based on the selected execution plan (step S1909).
  • the batch assignment management unit 211 secures the resource of the target job so that it is not assigned to other batch processing. Note that the reservation of resources for other jobs is not performed.
  • step S1910 determines whether or not addition of batch processing is permitted.
  • the process in step S1910 is the same as the process in step S1413.
  • the batch assignment management unit 211 ends the execution plan update processing.
  • step S1911 the batch assignment management unit 211 presents a list of batch processes that can be added to the user via the display unit 213 (step S1911), and The setting is accepted (step S1912). Note that the processing in step S1911 and step S1912 is the same as the processing in step S1420 and step S1421. The processes after step S1912 are processes related to the additional batch process.
  • step S1913 the batch assignment management unit 211 determines a policy for additional batch processing.
  • the process in step S1913 is the same as the process in step S1403.
  • the batch assignment management unit 211 starts a loop process of the change method (step S1914). In addition, the batch assignment management unit 211 starts a loop process of the job of the selected batch process (step S1915).
  • the processes in steps S1914 and S1915 are the same as the processes in steps S1404 and S1405.
  • step S1916 whether the batch allocation management unit 211 is in a state where the price fluctuation resource is available based on the determined policy.
  • the process in step S1916 is the same as the process in step S1406.
  • step S1923 the batch allocation management unit 211 deletes all execution plans for the additional batch processing from the execution plan management information 229. Thereafter, the batch assignment management unit 211 ends the execution plan update process.
  • step S1923 is the same as the process of step S1416.
  • step S1917 When it is determined that the price fluctuation resource is available, the batch allocation management unit 211 executes an execution plan change process (step S1917).
  • the process of step S1917 is the same as the process of step S1407.
  • step S1918 the batch assignment management unit 211 determines whether or not processing has been completed for all jobs included in the additional batch processing.
  • the process of step S1918 is the same as the process of step S1408.
  • the batch allocation management unit 211 returns to step S1915, selects a new job, and executes similar processing.
  • step S1919 determines whether the processing has been completed for all the change methods. .
  • the process in step S1919 is the same as the process in step S1409.
  • the batch assignment management unit 211 returns to step S1914, selects a new job, and executes the same processing.
  • step S1920 determines whether there is an execution plan that satisfies the policy based on the entry group added to the execution plan management information 229. Is determined (step S1920).
  • the process of step S1920 is the same as the process of step S1410.
  • the batch allocation management unit 211 deletes all execution plans for the additional batch processing from the execution plan management information 229 (step S1923). Thereafter, the batch assignment management unit 211 ends the execution plan update process.
  • the batch allocation management unit 211 selects one execution plan to be adopted (step S1921). Further, the batch allocation management unit 211 reserves resources based on the selected execution plan (step S1922). Thereafter, in the batch assignment management unit 211, the processes in steps S1921 and S1922 are the same as the processes in steps S1411 and S1412.
  • the execution plan is updated so as to satisfy the policy based on the latest prediction information. As a result, finer control can be realized.
  • FIG. 20 is a diagram illustrating an example of a user interface displayed by the display unit 213 according to the first embodiment.
  • the user interface 2000 displays the processing results of the execution plan generation process and the execution plan update process.
  • the user interface 2000 shown in FIG. 20 is a display format for displaying the processing result of one batch process using one tab screen 2001.
  • the tab screen 2001 includes a start time column 2011, a target time column 2012, a scheduled completion time column 2013, and an additional batch process candidate column 2014.
  • the start time column 2011 is the start time of batch processing set by the user. Note that the value set in the start time column 2011 may be automatically calculated based on the execution history of similar batch processing.
  • the target time column 2012 is a batch processing completion time set by the user. In the start time column 2011 and the target time column 2012, an allowable time gap may be input.
  • the scheduled completion time column 2013 is the completion time of the batch process when the resource allocation is changed by the execution plan generation process and the execution plan update process. Note that the scheduled completion time column 2013 may include items for displaying a policy type, a fee, a reserved resource amount, and the like.
  • the additional batch processing candidate column 2014 is a column for displaying additional batch processing candidates.
  • the additional batch processing candidate column 2014 includes an additional batch processing display column 2020 for each policy type.
  • the additional batch processing display field 2020 includes one or more detailed information fields 2021.
  • the detailed information column 2021 includes parameters, start time, and completion time set for the additional batch processing.
  • the detailed information column 2021 includes a cancel button 2022.
  • a cancel button 2022 is an operation button for canceling the addition of the additional batch process. When the operation button is operated, the batch assignment management unit 211 deletes the execution plan for the additional batch process from the execution plan management information 229.
  • the detailed information column 2021 may include an operation button that permits addition of additional batch processing.
  • the batch assignment management unit 211 sets “1” to the execution plan confirmation flag 1310 of the additional batch process in the execution plan management information 229.
  • FIG. 21 is a diagram illustrating an example of the effect of the process executed by the management server 101 according to the first embodiment.
  • a curve 2101 is a graph showing the free resource amount of the price fluctuation resource.
  • a rectangle 2102 with a pattern indicates one instance of a fixed price resource.
  • a rectangle 2103 indicates one instance using a price fluctuation resource. The heights of the rectangles 2102 and 2103 correspond to the required performance of the instance.
  • a resource group 2104 surrounded by a thick frame indicates resources for additional batch processing.
  • Pattern 1 shows an image of an execution plan for batch processing that does not use price fluctuation resources. In this case, batch processing is executed using instances having the same required performance.
  • Pattern 2 shows an image of an execution plan for batch processing using only price fluctuation resources.
  • Pattern 3 shows an image of an execution plan for batch processing using a fixed price resource and a price fluctuation resource.
  • Pattern 4 shows an image of an execution plan with additional batch processing added. It is possible to improve the business by executing the additional batch process while shortening the completion time of the main batch process using the price fluctuation resource.
  • the main batch process is a cost calculation process
  • an additional batch process for calculating a more detailed cost or an additional batch process corresponding to a cost calculation process with a changed parameter is executed.
  • the influence of setting can be analyzed from various perspectives.
  • this invention is not limited to the above-mentioned Example, Various modifications are included. Further, for example, the above-described embodiments are described in detail for easy understanding of the present invention, and are not necessarily limited to those provided with all the described configurations. Further, a part of the configuration of each embodiment can be added to, deleted from, or replaced with another configuration.
  • each of the above-described configurations, functions, processing units, processing means, and the like may be realized by hardware by designing a part or all of them with, for example, an integrated circuit.
  • the present invention can also be realized by software program codes that implement the functions of the embodiments.
  • a storage medium in which the program code is recorded is provided to the computer, and a CPU included in the computer reads the program code stored in the storage medium.
  • the program code itself read from the storage medium realizes the functions of the above-described embodiments, and the program code itself and the storage medium storing it constitute the present invention.
  • Non-temporary storage media such as a nonvolatile memory card and ROM are used.
  • program code for realizing the functions described in this embodiment can be implemented by a wide range of programs or script languages such as assembler, C / C ++, Perl, Shell, PHP, Java, and the like.
  • the program code is stored in a storage means such as a hard disk or memory of a computer or a storage medium such as a CD-RW or CD-R.
  • the CPU included in the computer may read and execute the program code stored in the storage unit or the storage medium.
  • control lines and information lines indicate those that are considered necessary for the explanation, and do not necessarily indicate all the control lines and information lines on the product. All the components may be connected to each other.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • Health & Medical Sciences (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Debugging And Monitoring (AREA)

Abstract

L'invention concerne un ordinateur de gestion pour gérer une pluralité d'ordinateurs fournissant des ressources informatiques, dans lequel : un système commercial est construit sur la pluralité d'ordinateurs ; le système commercial exécute un traitement par lots composé d'une pluralité de travaux ; l'ordinateur de gestion possède une unité de gestion d'affectation de lots et une unité d'exécution de lots ; l'unité de gestion d'affectation de lots gère des informations de gestion de traitement par lots comprenant des informations concernant une première ressource ayant une taxe d'utilisation fixe, des informations de gestion de travaux pour gérer une composition de travaux, des informations de gestion de politique pour définir une politique de fonctionnement du système commercial, et des informations d'historique d'une seconde ressource ayant une taxe d'utilisation fluctuante ; et l'unité de gestion d'affectation de lots génère des informations de prédiction à partir des informations d'historique, détermine si la seconde ressource peut ou non être utilisée sur la base des informations de prédiction et des informations de gestion de politique, et si la seconde ressource peut être utilisée, génère des informations de plan d'exécution par calcul d'une quantité de ressource de la seconde ressource nécessaire pour chacun de la pluralité de travaux.
PCT/JP2015/085993 2015-12-24 2015-12-24 Ordinateur de gestion et procédé d'exécution de traitement par lots WO2017109890A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2015/085993 WO2017109890A1 (fr) 2015-12-24 2015-12-24 Ordinateur de gestion et procédé d'exécution de traitement par lots

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2015/085993 WO2017109890A1 (fr) 2015-12-24 2015-12-24 Ordinateur de gestion et procédé d'exécution de traitement par lots

Publications (1)

Publication Number Publication Date
WO2017109890A1 true WO2017109890A1 (fr) 2017-06-29

Family

ID=59089740

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2015/085993 WO2017109890A1 (fr) 2015-12-24 2015-12-24 Ordinateur de gestion et procédé d'exécution de traitement par lots

Country Status (1)

Country Link
WO (1) WO2017109890A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPWO2021111611A1 (fr) * 2019-12-06 2021-06-10
CN113742052A (zh) * 2020-05-29 2021-12-03 北京京东振世信息技术有限公司 批量任务处理方法和装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120310765A1 (en) * 2011-05-31 2012-12-06 Jonathan Masters Automated cost assessment of cloud computing resources
WO2014024251A1 (fr) * 2012-08-06 2014-02-13 富士通株式会社 Dispositif de sélection de services en nuage, système de sélection de services en nuage, procédé de sélection de services en nuage, et programme de sélection de services en nuage
JP2015524581A (ja) * 2012-11-09 2015-08-24 株式会社日立製作所 管理計算機、計算機システム、及びインスタンス管理方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120310765A1 (en) * 2011-05-31 2012-12-06 Jonathan Masters Automated cost assessment of cloud computing resources
WO2014024251A1 (fr) * 2012-08-06 2014-02-13 富士通株式会社 Dispositif de sélection de services en nuage, système de sélection de services en nuage, procédé de sélection de services en nuage, et programme de sélection de services en nuage
JP2015524581A (ja) * 2012-11-09 2015-08-24 株式会社日立製作所 管理計算機、計算機システム、及びインスタンス管理方法

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPWO2021111611A1 (fr) * 2019-12-06 2021-06-10
WO2021111611A1 (fr) * 2019-12-06 2021-06-10 日本電信電話株式会社 Dispositif de synchronisation de fils, procédé de synchronisation de fils et programme
JP7384220B2 (ja) 2019-12-06 2023-11-21 日本電信電話株式会社 スレッド同期装置、スレッド同期方法、およびプログラム
CN113742052A (zh) * 2020-05-29 2021-12-03 北京京东振世信息技术有限公司 批量任务处理方法和装置
CN113742052B (zh) * 2020-05-29 2023-09-01 北京京东振世信息技术有限公司 批量任务处理方法和装置

Similar Documents

Publication Publication Date Title
Gill et al. BULLET: particle swarm optimization based scheduling technique for provisioned cloud resources
US11656895B1 (en) Computing resource provisioning
US8266254B2 (en) Allocating resources in a distributed computing environment
JP6254948B2 (ja) 分散コンピューティング環境内で仮想マシンのプールにジョブを割り当て仮想マシン上でタスクを実行するための方法、プログラム、プログラムを格納した記憶媒体、及びシステム
JP5400482B2 (ja) 管理計算機、リソース管理方法、リソース管理プログラム、記録媒体および情報処理システム
JP6025856B2 (ja) 共有リソース・システム、リソースを割り振る方法、およびコンピュータ・プログラム製品（共有リソースをプロビジョニングするための、コストを意識したテンプレート選択のためのシステム、方法、およびプログラム製品）
EP2802998B1 (fr) Attribution de ressources dans des groupes de machines virtuelles
JP5951111B2 (ja) 管理計算機、計算機システム、及びインスタンス管理方法
JP5476485B2 (ja) サービスの予約管理方法、仮想計算機システム及び記憶媒体
JP5767480B2 (ja) 情報処理装置、情報処理システム、配置構成決定方法、プログラムおよび記録媒体
US10120724B2 (en) Optimized resource metering in a multi tenanted distributed file system
US20110154353A1 (en) Demand-Driven Workload Scheduling Optimization on Shared Computing Resources
US20130179289A1 (en) Pricing of resources in virtual machine pools
Chard et al. Cost-aware cloud provisioning
US20160156568A1 (en) Computer system and computer resource allocation management method
US20210157644A1 (en) Selecting an optimal combination of cloud resources within budget constraints
US20210109787A1 (en) Estimating resource requests for workloads to offload to host systems in a computing environment
US20170359221A1 (en) Method and management system for calculating billing amount in relation to data volume reduction function
JP6293683B2 (ja) 計算機システム及び計算機システムの性能障害の対処方法
US20180136980A1 (en) Provisioning of computing resources for a workload
US20150235156A1 (en) Enabling Capacity On Demand In A Computing System Using A Calendar
WO2017109890A1 (fr) Ordinateur de gestion et procédé d'exécution de traitement par lots
US10877814B2 (en) Profiling workloads in host systems allocated to a cluster to determine adjustments to allocation of host systems to the cluster
US20140164594A1 (en) Intelligent placement of virtual servers within a virtualized computing environment
US10230664B1 (en) Strategic resource allocation in a web-based computing system

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15911328

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15911328

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP