Abstract:
PROBLEM TO BE SOLVED: To provide a system allowing scalable execution of a transaction by dividing the transaction and executing in distributed environment. SOLUTION: This system includes: a means dividing transaction processing into (optimistic) processing wherein contention is difficult to occur and (pessimistic) processing wherein the contention is easy to occur; a first server; and a second server. The first server has: a first transaction execution part executing the optimistic processing; and a transaction log transmission part for transmitting an execution result of the optimistic processing to the second server. The second server has: a transaction log reception part for receiving a transaction log; and a second transaction execution part executing the pessimistic processing. COPYRIGHT: (C)2008,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To allow execution of a black box test for even a system wherein correspondence of input/output is not uniquely determined, by allowing analysis of a causal relation (dependency relation) of a program in state units of objects to analyze a causal relation of input and output in the test. SOLUTION: This program analysis system includes a causal relation extraction part 10 and a text execution part 20. The causal relation extraction part 10 executes a target program step by step and acquires change histories of fields of objects and information of fields of objects causing the changes, in each step and extracts causal relations in state units of each object, and the text execution part 20 takes a prescribed object as a verification target and analyzes a causal relation to the object being the verification target, on the basis of inter-object causal relations extracted by the causal relation extraction part 10 and executes a test on the basis of an assertion of the test, which is set between the object being the verification target and an object being a cause. COPYRIGHT: (C)2006,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To suppress the occurrence of a stack overflow or a stack underflow to prevent the execution performance of a program from being degraded by them in program code generation for a processor which has an architecture using a register stack. SOLUTION: A compiler 10 is provided with a register allocator 11 which allocates registers to instructions in a program as the compilation object and a code generator 12 which generates object codes on the basis of the result of register allocation by the register allocator 11. The register allocator 11 allocates logical registers to instruction in the program as the compilation object and allocates the logical registers allocated to instructions in the program to physical registers so that physical registers existing at the time of calling procedures in the program as the compilation object may be allocated in order from the bottom of the register stack. COPYRIGHT: (C)2003,JPO
Abstract:
PROBLEM TO BE SOLVED: To execute the start of a program at high speed by loading an object from the route object of plural objects into a main memory and removing the specified object from a load object. SOLUTION: When loading an object orientated program into the main memory, a CPU 1 generates a main memory managing list by loading the route object from an HDD 5 to a main memory 3. By referring to this list, it is discriminated whether the object to be loaded is an object to be accessed from only one other object or not. In this case, when the object is discriminated as the object to be accessed only from one other object, the object to be accessed from only one other object and the object to be accessed from the object to be accessed only from one other object are removed from the load object and the main memory managing list is updated.
Abstract:
PROBLEM TO BE SOLVED: To provide a technique for achieving high speed and stable dispatch of a code resulted from a conversion from a code written in a programming language based on type reification into a code in a programming language employing type erasure.SOLUTION: The technique is implemented by a program having a function of adding a synthetic class having the same name as a suffix for name mangling of a normal method in a first programming language based on type reification, adding a dummy parameter of the type of the synthetic class to a constructor definition, and adding an appropriate value (normally, null) that matches the type of the dummy parameter to a constructor invocation in order to convert to a code in a second programming language employing type erasure.
Abstract:
PROBLEM TO BE SOLVED: To provide a data processor, a workflow system, a data processing method, and a computer program, can function a materialized view as a self-maintainable view, without increasing a storage capacity, when retrieving or updating information as to a progress situation of process instance in a prescribed condition, using the materialized view including information as to an inquiry result to a database defined in advance. SOLUTION: A flow description code for constructing a workflow is obtained to be analyzed statically. Selection condition information as to an attribute of a selection condition for the process instance in each node is generated and stored in response to a static analytical result. The node not having the possibility of providing the selection condition is extracted based on the stored selection condition information, to delete information as to the inquiry result corresponding to the extracted node and a node transited after the node, from the materialized view. COPYRIGHT: (C)2010,JPO&INPIT