Patent application number | Description | Published |
20080215584 | Shared-Memory Multiprocessor System and Method for Processing Information - Large-scale table data stored in a shared memory are sorted by a plurality of processors in parallel. According to the present invention, the records subjected to processing are first divided for allocation to the plurality of processors. Then, each processor counts the numbers of local occurrences of the field value sequence numbers associated with the records to be processed. The numbers of local occurrences of the field value sequence numbers counted by each processor is then converted into global cumulative numbers, i.e., the cumulative numbers used in common by the plurality of processors. Finally, each processor utilizes the global cumulative numbers as pointers to rearrange the order of the allocated records. | 09-04-2008 |
20080262997 | Information Processing Method and Information Processing System - There is provided an information processing method for managing a large amount of data by dividing the data between a plurality of processors. Each processing module holds a local information block containing a pointer arrangement containing information specifying the item value number in the order of records of the table-formatted data and a value list containing item values in the order of the item value numbers corresponding to the item values of the table-formatted data. Each processing module assigns a global order number uniquely determined between a plurality of processing modules to the record of the table-formatted data in the local processing module, compares the value list of the local processing module to the value list of the other processing module, and assigns a global item value number uniquely determined between the processing modules to the item value of the value list of the local processing module. | 10-23-2008 |
20080270435 | Method for Handling Tree-Type Data Structure, Information Processing Device, and Program - It is possible to express a tree-type data structure so as to effectively trace the relationship between data in the tree-type data structure (for example, parent-child, ancestor, descendant, brothers, generations). In the tree-type data structure, for each of non root nodes which are the nodes excluding the root node, their parent nodes are correlated so that the parent-child relationship between the nodes is expressed by using “child->parent” relationship. Accordingly, by specifying a child node, it is possible to promptly specify the only one parent node corresponding to the child node. | 10-30-2008 |
20080281843 | Distributed Memory Type Information Processing System - It is possible to realize high-speed data processing between processing modules with a small communication amount when performing information processing of a large amount of data employing the parallel computer architecture. Each of the processing modules transmits a first list as a list of values stored in the memory of the local processing module to another processing module in the information processing system and receives at least one second list as a list of values transmitted from the another processing module to the local processing module so as to compare the values in the second list with the values in the first list. When the values in the second list coincide with the values in the first list, counters corresponding to the values in the first list which have coincided are incremented by one. | 11-13-2008 |
20080313196 | Method, Information Processing Apparatus, and Program For Generating Array - A relationship among data in a tree data structure is effectively traced by assigning nodes respective unique node identifiers, a parent-child relationship is represented by a C->P array containing node identifiers for parent nodes associated with node identifiers for non-root nodes that are nodes other than a root node, a list of vertex nodes is provided by storing node identifiers for respective vertex nodes in order to represent one or more node groups, each node group including a particular node, which is the vertex node, and descendant nodes of the particular node, and the node identifier for the vertex node belonging to other vertex nodes are deleted from the list of vertex nodes by referring to the C->P array such that neither vertex nodes nor respective descendant nodes of the vertex nodes duplicate each other across vertex nodes identified by the node identifiers included in the list of vertex nodes. | 12-18-2008 |
20080313423 | Distributed Memory Type Information Processing System - An information processing system includes a plurality of PMM and data transmission paths for connection between the PMM and transmitting a value of a PMM to another PMM. A memory of each PMM holds a list of values of first items arranged in the ascending order or descending order without overlap and/or a list of values of the second item to be shared. A memory module of each PMM transmits a value contained in the value list to another PMM, receives a value contained in the value list from the another PMM, references the value list of the first item and the value list of the second item of the another PMM, and generates a list of common values considering the values contained in the value lists of the first item and the second item of all the other PMM. | 12-18-2008 |
20090019067 | METHOD, APPARATUS, AND PROGRAM FOR INSERTING NODE - A method for inserting a node into a tree data structure is disclosed. An information processing apparatus represents parent-child relationships between the nodes in the tree data structure by means of “child->parent” relationships, which associate node identifiers assigned to parent nodes with the node identifiers assigned to child nodes of the respective parent nodes, identifies descendant nodes of a slave-side specific node in slave-side data, and inserts the descendant nodes included in the slave-side data into master-side data as the descendant nodes of a master-side specific node in the master-side data, the master-side specific node corresponding to the slave-side specific node. | 01-15-2009 |
20090106194 | METHOD, INFORMATION PROCESSING APPARATUS, AND PROGRAM OF SEARCHING FOR, AGGREGATING AND SORTING TREES - A searching method for tree data structure topology employs an array generated as a search key array representing a tree serving as search key to represent a parent-child relationship between nodes. The array has the node identifier assigned to a parent node associated with a corresponding non-root node. Non-root nodes are nodes other than a root node, and the node identifier assigned to the parent node corresponds to the node identifier assigned to associated non-root nodes. An offset is applied to node identifiers in the search key array, the node identifiers to which offset is applied are compared with corresponding node identifiers contained in a portion in a C-P array, the portion determined according to the offset, and a vertex node list indicating a search result is stored, wherein the search result contains node identifiers included in a portion of the C-P array whose all nodes matched in comparison. | 04-23-2009 |
20090106289 | Array Generation Method And Array Generation Program - A tree-type data structure representation method that can effectively trace relationships among data in a tree-type data structure, such as parent-child, ancestors, descendents, siblings, and generations, is provided. In a memory, data having a tree-type data structure in which unique node identifiers are assigned to nodes and a parent-child relationship between the nodes is represented by a C-P array including pairs, each pair being formed of a node identifier assigned to each of non-root nodes, which are nodes other than a root node, and a node identifier of a parent node with which each of the non-root nodes is associated is stored. In the memory, a vertex node list storing, in order to represent at least one node group, each including a specific node and a descendent node of the specific node, node identifiers of the specific nodes, which serve as vertex nodes, is also stored. A system | 04-23-2009 |
20090106298 | INFORMATION PROCESSING METHOD, INFORMATION PROCESSING DEVICE, AND INFORMATION PROCESSING PROGRAM - A partial tree is efficiently removed from a tree, or another tree is inserted into a tree. A flag is set for the node identifier of a node constituting a partial tree to be removed in an erasure flag array. Referencing the value of the erasure flag array, node identifiers which are consecutive integers given to the nodes while giving precedence to the nodes in the same generation over the child nodes are given to the nodes in the tree from which the partial tree has been removed. The given node identifiers are associated with those of the nodes in the tree before the partial tree is removed and stored in a new node identifier array, which is stored in a storage device. According to a parent-child relation definition array and the node identifier array, the parent-child definition array of the tree from which the partial tree is removed where the node identifiers of the parent node of the nodes having the node identifiers are stored in association with the new node identifiers is stored in the storage device. | 04-23-2009 |
20090106299 | SHARED-MEMORY MULTIPROCESSOR SYSTEM AND INFORMATION PROCESSING METHOD - Large-scale table format data on a common memory is sorted in parallel by a plurality of processors. A record to be processed is divided and assigned at first to the processors. Next, each processor counts the number of local appearances of item value numbers related to the record to be processed. Next, the number of local appearances of the item value numbers counted at the processors is converted into the global accumulation of item value numbers, i.e., the accumulation to be commonly used between the processors. Finally, each processor utilizes the global accumulation as a pointer to change the order of the assigned records. | 04-23-2009 |
20090187718 | INFORMATION PROCESSING SYSTEM AND INFORMATION PROCESSING METHOD - An ascending ordered list without duplication is generated based on a value list divided and held by multiple memory modules. An information processing system has multiple PMMs, and the PMMs are interconnected via a data transmission path. The memory in the PMM has a list of values, which are ordered in ascending or descending order without duplication. The PMM determines, for a storage value in the value list (LOCAL_LIST) held by the PMM, whether or not the memory module is a representative module representing one or more memory modules holding the storage value based on rankings determined for the individual PMMs and the value lists received from the other PMMs, and if the memory module is determined to be the representative module (RV- | 07-23-2009 |