Abstract: A management server calculates a required amount of computational resource required to execute the application based on a processing speed of each application and a computational resource model. When a usage rate of the computational resource within an execution time limit of the workflow exceeds an upper limit, the management server calculates, using the computational resource model, a first executable time during which the application is executable on an available capacity of the computational resource. The management server sets a target execution time of the application in executing the workflow as a first executable time, and adjusts to add an extension time of the target execution time according to the first executable time to a target execution time of another application that does not exceed the computational resource upper limit so as to postpone an end time-of-day of the application and advance a start time-of-day of the other application.

Abstract: A storage system is capable of sharing files between a plurality of sites each having a storage which provides a file system without having to mutually hold the associated files of all files between such sites. The storage has a storage apparatus storing data of a file and a controller connected to the storage apparatus; the storage system includes an associated file which is associated with the file and refers to the file; when the file is to be updated, the controller updates the file and the associated file based on a reference status from the associated file; and when an access request for accessing a file stored in another site is received, the controller makes an inquiry to the other site, and creates an associated file for accessing the file corresponding to the access request in a site of a controller that received the access request.

Abstract: In tiered storage subsystems in which pages are automatically allocated to appropriate storage media based on the access frequency in page units, since the number of storage media is not simply proportional to the performance, it was difficult to design in advance a tier configuration satisfying the required performance. According to the present invention, a cumulative curve of I/O distribution is created based on a result of measurement of I/O accesses performed to the storage subsystem, and RAID groups (RG) are allocated sequentially in order from RGs belonging to tiers having higher performances to the cumulative curve of I/O distribution. When either a performance limitation value or a capacity of the RG exceeds the cumulative curve of I/O distribution, a subsequent RG is allocated, and the process is repeated so as to compute the optimum tier configuration.

Abstract: A suitable Tier ratio is determined according to the I/O performance and I/O characteristic of a virtual volume. A storage apparatus which is connected via a network to a host computer which requests data writing comprises storage devices of a plurality of types of varying performance; and a controller which manages storage areas provided by each of the storage devices of a plurality of types by means of storage tiers of a plurality of different types, and which assigns the storage areas in page units to virtual volumes from any of the storage tiers among the storage tiers of the plurality of types according to the data write request from the host computer, wherein the controller monitors performance information which includes I/O characteristic information for each of the virtual volumes and determines the storage tiers corresponding to the performance information thus monitored, and assigns the storage areas in page units to the virtual volumes from the determined storage tiers.

Abstract: In tiered storage subsystems in which pages are automatically allocated to appropriate storage media based on the access frequency in page units, since the number of storage media is not simply proportional to the performance, it was difficult to design in advance a tier configuration satisfying the required performance. According to the present invention, a cumulative curve of I/O distribution is created based on a result of measurement of I/O accesses performed to the storage subsystem, and RAID groups (RG) are allocated sequentially in order from RGs belonging to tiers having higher performances to the cumulative curve of I/O distribution. When either a performance limitation value or a capacity of the RG exceeds the cumulative curve of I/O distribution, a subsequent RG is allocated, and the process is repeated so as to compute the optimum tier configuration.

Abstract: A suitable Tier ratio is determined according to the I/O performance and I/O characteristic of a virtual volume. A storage apparatus which is connected via a network to a host computer which requests data writing comprises storage devices of a plurality of types of varying performance; and a controller which manages storage areas provided by each of the storage devices of a plurality of types by means of storage tiers of a plurality of different types, and which assigns the storage areas in page units to virtual volumes from any of the storage tiers among the storage tiers of the plurality of types according to the data write request from the host computer, wherein the controller monitors performance information which includes I/O characteristic information for each of the virtual volumes and determines the storage tiers corresponding to the performance information thus monitored, and assigns the storage areas in page units to the virtual volumes from the determined storage tiers.

Abstract: It is intended to provide koji mold-origin phospholipase A2 and a DNA encoding it. Namely, phospholipase A2 comprising the following protein (a) or (b): (a) a protein having an amino acid sequence represented by SEQ ID NO: 1 or 2; and (b) a protein having an amino acid sequence derived from an amino acid sequence represented by SEQ ID NO: 1 or 2 by a partial modification and serving as phospholipase A2.

Abstract: It is intended to provide koji mold-origin phospholipase A2 and a DNA encoding it. Namely, phospholipase A2 comprising the following protein (a) or (b): (a) a protein having an amino acid sequence represented by SEQ ID NO: 1 or 2; and (b) a protein having an amino acid sequence derived from an amino acid sequence represented by SEQ ID NO: 1 or 2 by a partial modification and serving as phospholipase A2.

Abstract: Lysyl oxidase derived from filamentous fungi and a DNA encoding thereof are provided. Lysyl oxidase including a protein described in of the following (a) or (b): (a) a protein having an amino acid sequence set forth in SEQ ID NO: 2; or (b) a protein having an amino acid sequence obtained by modifying a part of the amino acid sequence set forth in SEQ ID NO: 2, and functioning as lysyl oxidase.

Abstract: The purpose of the present invention is to isolate a gene encoding novel exo-, or endo-?-1,3-glucanase, to obtain a microorganism having an enhanced expression of said gene and to degrade ?-1,3-glucan to its low molecular weight form by means of said enzymes. The present invention relates to a gene or DNA encoding novel enzymes having ?-1,3-glucanase activity (exo-, or endo-?-1,3-glucanase), a recombinant expression vector comprising them, a microorganism having the recombinant expression vector, the novel enzymes having ?-1,3-glucanase activity, and a method for the production of said enzymes.

Abstract: A completely novel glutaminase is provided: (a) a protein consisting of an amino acid sequence represented by SEQ ID NO: 2, or (b) a protein consisting of an amino acid sequence derived from the amino acid sequence represented by SEQ ID NO: 2 by deletion, substitution or addition of one or more amino acids, and possessing glutaminase activity. This protein is a novel glutaminase possessing excellent thermostability and the like.

Abstract: It is intended to provide koji mold-origin phospholipase A2 and a DNA encoding it. Namely, phospholipase A2 comprising the following protein (a) or (b): (a) a protein having an amino acid sequence represented by SEQ ID NO: 1 or 2; and (b) a protein having an amino acid sequence derived from an amino acid sequence represented by SEQ ID NO: 1 or 2 by a partial modification and serving as phospholipase A2.

Abstract: The present invention provides DNA encoding novel pyroglutamyl peptidase derived from Aspergillus oryzae, pyroglutamyl peptidase which is produced by using the DNA, and a method for producing a protein lysate with a good flavor at a high hydrolysis rate.

Abstract: The purpose of the present invention is to isolate a gene encoding novel exo-, or endo-?-1,3-glucanase, to obtain a microorganism having an enhanced expression of said gene and to degrade ?-1,3-glucan to its low molecular weight form by means of said enzymes. The present invention relates to a gene or DNA encoding novel enzymes having ?-1,3-glucanase activity (exo-, or endo-?-1,3-glucanase), a recombinant expression vector comprising them, a microorganism having the recombinant expression vector, the novel enzymes having ?-1,3-glucanase activity, and a method for the production of said enzymes.

Abstract: Lysyl oxidase derived from filamentous fungi and a DNA encoding thereof are provided. Lysyl oxidase including a protein described in of the following (a) or (b): (a) a protein having an amino acid sequence set forth in SEQ ID NO: 2; or (b) a protein having an amino acid sequence obtained by modifying a part of the amino acid sequence set forth in SEQ ID NO: 2, and functioning as lysyl oxidase.

Abstract: A completely novel glutaminase is provided: (a) a protein consisting of an amino acid sequence represented by SEQ ID NO: 2, or (b) a protein consisting of an amino acid sequence derived from the amino acid sequence represented by SEQ ID NO: 2 by deletion, substitution or addition of one or more amino acids, and possessing glutaminase activity. This protein is a novel glutaminase possessing excellent thermostability and the like.

Abstract: A transfer data storage system is used in a control processing unit which receives a transfer data in which a plurality of kinds of data having arbitrary data lengths are allocated within each frame, extracts each data within the transfer data included in a predetermined number of frames by the kind of data, and successively stores the extracted data into a memory.