Abstract: An estimating apparatus includes a processor configured to update a state of a first particle group indicating a state of a mobile body, from a current state to a next state through a simulation that is based on a state equation of the mobile body in a space using a particle filter; measure at each update, a distance between the mobile body and an object in the space; generate at each update, a second particle group indicating a state of a specific area in the space; calculate a level of likelihood for each particle of the first particle group and for each particle of the second particle group, based on the measured distance, the updated first particle group, and the generated second particle group; and identify a position of the mobile body in the space, based on the level of likelihood calculated for each particle.

Abstract: A disclosed priority control program recorded in a computer-readable medium causes a computer to execute, in job allocation for computational resources, a first step of lowering a job allocation priority of a user based on an estimated utilization amount of a job associated with the user, the job allocation priority indicating a degree of priority of the user in obtaining an allocation of the computational resource, and the estimated utilization amount being an amount of the computational resources estimated to be used for the job and being submitted to and recorded in a memory device on a job-to-job basis; and a second step of increasing the job allocation priority over time at a restoration rate which corresponds to a user-specific amount of the computational resources available for the user per unit time, the user-specific amount being recorded in the memory device on a user-to-user basis.

Abstract: 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.

Abstract: In an accounting apparatus, a conflict determination unit determines whether or not the accounting mode is in a conflict state where a process is executing in another logical CPU and stores the determination result in an accounting information storage unit, when a process of the user starts to be executed in a logical CPU of an SMT processor. And a CPU use time acquisition unit collects the CPU use time of the process in the conflict state or the non-conflict state distinctively and stores it in an accounting information storage unit. Thereafter, a CPU use time conversion unit converts the CPU use time in the conflict state, with a predetermined weighting, based on the CPU use time in the conflict state and the non-conflict state, after the end of executing the process, and an accounting calculation unit calculates the accounting amount for the process from an effective use time.

Abstract: 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.

Abstract: In the computer apparatus which has a processing unit, a power consumption measuring unit, and a power counter, the power consumption of running programs on the processing unit is measured at arbitrary constant period, wherein the measuring value is integrated to the power counter. When the power counter overflows, the processing unit is interrupted for sampling information required for analysis. Then the processing unit which received the interruption executes a sampling of the power consumption base. So, power consumption based sampling and profiling becomes to be enabled.

Abstract: A job scheduling apparatus determines an assignment order, which is the order in which jobs are assigned to a computational resource, on the basis of priority levels and being associated with the assignment order. The apparatus assigns the jobs to the computational resource on the basis of the assignment order. The apparatus reduces the priority levels for the jobs that have been assigned to the computational resource. The apparatus increases the priority levels with time. Regarding a priority level among the priority levels, if, at a future time, which is a fixed time period from the start of execution of the jobs, an amount of an increase in the priority level is expected to be equal to or larger than an amount of a reduction in the priority level for a job, assignment of the job to the computational resource is executed.

Abstract: When allocating an unallocated queued job, by using a CDA having a mesh structure to which active jobs are allocated, a job scheduling apparatus scans an event list that includes information about allocation events and release events for jobs, determines the coordinates and the time at which submeshes corresponding to the queued jobs are reserved, and arranges the submeshes by overlapping them on the CDA.

Abstract: In response to a route-changing event, original routes on the network are changed to new routes. A destination-reachable range is identified as a range from which packets can reach an information processing device specified by a destination address. Modification of forwarding data is performed for a neighbor communication device which is located outside the destination-reachable range and adjacent to a communication device in the destination-reachable range, so as to enable forwarding of packets to that communication device in the destination-reachable range. The modified forwarding data is then transmitted to the neighbor communication device. The modification made to the forwarding data results in an additional destination-reachable range, which is thus added to the destination-reachable range. Another cycle of processing is then performed on the basis of the expanded destination-reachable range.

Abstract: A cluster control apparatus controls an allocation of a job to each node in a cluster system formed by mutually connecting a plurality of nodes by a high-speed network. A node selecting unit selects an allocation node for allocating the job and a similar node that is similar to the allocation node. A data-redundancy command unit issues a command to store data created from the job executed by the allocation node in the allocation node and the similar node.

Abstract: A method for a computer including a processor that is capable of counting invalidation of translation lookaside buffers and generating an interrupt at the occurrence of the invalidation, the invalidation being performed by an operating system upon switching between application programs, includes acquiring identification information of application programs from the operating system and storing the identification information as a first list; detecting an interrupt generated from the processor at the occurrence of switching from a first application program to a second application program; and when the interrupt is detected, acquiring the identification information of the first and second application programs from the operating system or the mechanism and comparing the acquired identification information with the first list to determine whether either of the first and second application programs is a program that has been created or disappeared.

Abstract: A performance monitoring device has an interrupt detection unit that detects generation of an interrupt process to be executed by a processor in accordance with TLB entry invalidation executed in an operating system. A counter value acquisition unit acquires a counter value of a predetermined event counted by the processor when the interrupt process is detected by the interrupt detection unit. A process information acquisition unit acquires identification information for identifying a process executed on the processor from the operating system immediately before the interrupt process is detected by the interrupt detection unit. An associating unit associates the counter value acquired by the counter value acquisition unit during the interrupt process with the identification information acquired by the process information acquisition unit immediately before the interrupt process.

Abstract: 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.

Abstract: Information on an execution status of an information-collection target program is collected with an interrupt handler that is activated by an interrupt generated when a predetermined condition is satisfied. A target range for collecting the information with the interrupt handler is specified, and information to be collected by the interrupt handler when the interrupt is generated within the specified target range is set.

Abstract: A job scheduling apparatus determines an assignment order, which is the order in which jobs are assigned to a computational resource, on the basis of priority levels and being associated with the assignment order. The apparatus assigns the jobs to the computational resource on the basis of the assignment order. The apparatus reduces the priority levels for the jobs that have been assigned to the computational resource. The apparatus increases the priority levels with time. Regarding a priority level among the priority levels, if, at a future time, which is a fixed time period from the start of execution of the jobs, an amount of an increase in the priority level is expected to be equal to or larger than an amount of a reduction in the priority level for a job, assignment of the job to the computational resource is executed.

Abstract: 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.

Abstract: A method for a computer including a processor that is capable of counting invalidation of translation lookaside buffers and generating an interrupt at the occurrence of the invalidation, the invalidation being performed by an operating system upon switching between application programs, includes acquiring identification information of application programs from the operating system and storing the identification information as a first list; detecting an interrupt generated from the processor at the occurrence of switching from a first application program to a second application program; and when the interrupt is detected, acquiring the identification information of the first and second application programs from the operating system or the mechanism and comparing the acquired identification information with the first list to determine whether either of the first and second application programs is a program that has been created or disappeared.

Abstract: In response to a route-changing event, original routes on the network are changed to new routes. A destination-reachable range is identified as a range from which packets can reach an information processing device specified by a destination address. Modification of forwarding data is performed for a neighbor communication device which is located outside the destination-reachable range and adjacent to a communication device in the destination-reachable range, so as to enable forwarding of packets to that communication device in the destination-reachable range. The modified forwarding data is then transmitted to the neighbor communication device. The modification made to the forwarding data results in an additional destination-reachable range, which is thus added to the destination-reachable range. Another cycle of processing is then performed on the basis of the expanded destination-reachable range.

Abstract: When allocating an unallocated queued job, by using a CDA having a mesh structure to which active jobs are allocated, a job scheduling apparatus scans an event list that includes information about allocation events and release events for jobs, determines the coordinates and the time at which submeshes corresponding to the queued jobs are reserved, and arranges the submeshes by overlapping them on the CDA.

Abstract: An input/output device stores host status information about the status of a host, and controls the input/output of data. By referring to the input/output information and the host status information, the device performs optimization control of selecting notification either by an interrupt process or a non-interrupt process. When a notification by the interrupt process is selected, data transfer control is performed to the host, and the data is transferred to the host by an interrupt. When a notification by the non-interrupt process is selected, data transfer control is performed to the host, and notification control is performed to transfer the data to the host by polling.