Patent application number | Description | Published |
20090328006 | INSTRUCTION-TRACE GENERATION PROGRAM, INSTRUCTION-TRACE GENERATING DEVICE, AND INSTRUCTION-TRACE GENERATING METHOD - An instruction-trace generating device generates an instruction trace of a first instruction string from a second instruction string obtained by sampling, at predetermined intervals, the first instruction string executed a plurality of times. The device includes a dividing unit dividing the second instruction string into partial instruction strings and causes the divided partial instruction strings to be stored in a storage unit; a similarity calculating unit calculating a similarity for each combination of all of the stored partial instruction strings; a selecting unit selecting one of the combinations of the partial instruction strings based on the similarity; a combination-pattern generating unit generating a plurality of combination patterns by combining instructions included in the selected partial instruction strings; a likelihood calculating unit calculating a likelihood for each of the combination patterns; and a partial-instruction-string replacing unit causing the combination patterns to be stored in the storage unit based on the likelihood. | 12-31-2009 |
20100145983 | HOMOLOGY SEARCHING METHOD - An apparatus for controlling devices for searching homology of queries in a base sequence in parallel, includes: a memory for storing a base sequence and an appearing frequency of each of first strings each having a fixed length appearing in the base sequence; and a processor for executing a process including: obtaining queries for searching homology in the base sequence; retrieving each of second strings each having a longer fixed length then that of first strings and partially appearing in each of the queries; determining an approximate appearing frequency of each of the second string on the basis of the appearing frequency of the first strings; evaluating for each of the query sequences a load of task for searching homology; and allocating each task for searching homology for each of the queries among the devices on the basis of the result of evaluation of the load of the each task. | 06-10-2010 |
20110029755 | PROCESSOR AND ARITHMATIC OPERATION METHOD - A processor has a first table including an entry that associates a logical address with a physical address of a page that manages a virtual space address. The processor determines, when a target logical address accessed by one of threads is translated to the physical address, whether an entry corresponding to the target logical address is present in the first table, the target logical address is of a page accessed by a program. The processor determines, when the entry corresponding to the target logical address is not present in the first table, whether the target logical address has been accessed during the running of the program. The processor delays, when the target logical address has not yet been accessed, the process of reading the entry corresponding to the target logical address from a page table into the first table by a predetermined time to thereby delay the one thread. | 02-03-2011 |
20110125824 | COMPUTER FOR PERFORMING INTER-PROCESS COMMUNICATION, COMPUTER-READABLE MEDIUM STORING INTER-PROCESS COMMUNICATION PROGRAM, AND INTER-PROCESS COMMUNICATION METHOD - In response to an all-to-all inter-process communication request from a local process, a computer repeatedly determines a destination server in accordance with a destination-server determination procedure so that, in a same round of destination-server determinations repeatedly performed by the respective servers during all-to-all inter-process communication, the servers determine servers that are different from one another as destination servers. Each time the destination server is determined, the computer sequentially determines a process running on the determined destination server as a destination process. Each time the destination process is determined, the computer obtains transmission data for the destination process from a send buffer in which the transmission data is stored as a result of execution of the local process and transmits the obtained transmission data to the destination server so as to enable reading of the transmission data during execution of the determined destination process in the destination server. | 05-26-2011 |
20120016997 | RECORDING MEDIUM STORING COMMUNICATION PROGRAM, INFORMATION PROCESSING APPARATUS, AND COMMUNICATION PROCEDURE - A computer acquires correspondence data including a plurality of combinations of identifiers of selected computers, in which parallel processes are started, and identifiers of the parallel processes, wherein the selected computers are among a plurality of computers connected to a multipath network having relay devices extending over two or more hierarchies. The computer specifies a network identifier to be used for distributing communication paths among the selected computers for every selected computer that includes an identifier in the correspondence data, wherein the specified network identifiers is among network identifiers of respective communication paths in the multipath network, and the specified network identifier corresponds to each identifier of a plurality of computers, and is used for routing. | 01-19-2012 |
20120020372 | PROHIBITION TURN DETERMINATION APPARATUS - A prohibition turn determination apparatus determines an initial path so that the communication amounts of respective links connecting switches to each other are most efficiently distributed between a communication pair, that is, a pair of servers communicating with each other via a network. Then, the prohibition turn determination apparatus calculates the communication amounts of respective turns formed along the initial path based on the communication amounts set between end nodes which are the communication pair. Next, the prohibition turn determination apparatus determines prohibition turns, which are not used for packet communication, based on the communication amounts of respective turns by an Up/down method or a TP method. Finally, the prohibition turn determination apparatus determines the final routing to avoid the prohibition turns. | 01-26-2012 |
20120106556 | COMMUNICATION TECHNIQUE IN NETWORK INCLUDING LAYERED RELAY APPARATUSES - This method includes: obtaining first data including identifiers of selected computers for invocation of parallel processes among plural computers connected to lowest-layer relay apparatuses in a network including relay apparatuses in plural layers, wherein the network includes paths between a relay apparatus in a first layer and plural relay apparatuses in a second layer that is an immediately upper layer than the first layer; and selecting, for each of the selected computers and from network identifiers for respective communication routes, network identifiers to be used for communication with other selected computers so as to avoid coincidence of communication routes between the selected computers for which a same difference value is calculated between identification numbers, wherein the network identifiers are associated in advance with an identifier of each of the plural computers and are used for routing in the network, and the identification numbers are assigned for ordering the selected computers. | 05-03-2012 |
20120151090 | APPARATUS AND METHOD FOR STORING A PORT NUMBER IN ASSOCIATION WITH ONE OR MORE ADDRESSES - A port number is stored in a memory in association with one or more addresses using a data block by which at least one port number associated with a predetermined number of consecutive addresses is written into the memory. Further, a first port number assigned to output ports each being provided for different one of a plurality of relay nodes is stored in association with first consecutive addresses in such a manner that one or more data blocks including the first port number associated with the first consecutive addresses are written into the memory. | 06-14-2012 |