135 results about "Processor time" patented technology

According to an embodiment of the present invention, a system assigns at least one workload a hard share quantity and at least one other workload a soft share quantity or a hard share quantity. The system allocates a resource to the workloads based on the hard share quantity and the soft share quantity of active workloads in a predefined interval. A hard share quantity indicates a maximum resource allocation and a soft share quantity enables allocation of additional available processor time. Embodiments of the present invention further include a method and computer program product for allocating a resource to workloads in substantially the same manner as described above.

Methods, apparatus, and articles of manufacture for retaining packet order in multiprocessor systems utilizing multiple transmit queues are disclosed herein. Embodiments of the present invention define multiple transmit queues for a given priority level of packets to enable the multiprocessor system to process and queue packets of equal priority in different transmit queues. Queuing packets of equal priority in different transmit queues minimizes processor time spent attempting to acquire queue-specific resources associated with one particular transmit queue. In addition, embodiments of the present invention provide an assignment mechanism to ensure that packets corresponding to a common flow are queued in the same transmit queue in order to eliminate, to the extent possible, out-or-order packets, which many times results in lost packets and a reduction in realized network throughput.

A time-partitioned system for accounting for processor time consumed by operating system services provided on behalf of an application runs in a real-time environment. The time utilized by the operating system is treated as application processing time, rather than viewing the resultant processor time consumed as an operating system overhead. Each application consists of one or more threads. A time budget is assigned to each thread and to each interrupt. The processor time consumed by the operating system when executing on behalf of a thread or interrupt is charged back to the application or interrupt as part of the application's time budget. Operating system overheads and processor interrupts are thus accounted for accurately enough to determine a schedule for the applications that is enforceable by the operating system at run time.

Mechanisms in which a memory controller efficiently manages time-division multiple access to system memory for multiple processors and for one or more other memory consumers present in the system. At least one processor is guaranteed access to system memory during its time slot in a memory access cycle, while at least one of the other processors is only conditionally granted access to system memory during its time of the memory access cycle. In particular, these other processors are only granted access if one of more certain other memory consumers has not also requested memory access at the same time. Accordingly, urgent, time-sensitive processes may run on these guaranteed processors, while allowing less time-sensitive processes to run on the other processors. Hence, access to system memory is managed more efficiently.

Processes are balanced among multiple computer systems. The allocation policies and resource demands of multiple processes executing on multiple computer systems are used to determine the resource imbalance of the computer systems. Resource imbalance can be used to determine whether a process should be migrated from one computer system to another. Resource imbalance of multiple resources can be combined to determine overall imbalance of the computer systems. Overall imbalance can be used to determine whether a process should be migrated from one computer system to another. Imbalance of resources can be determined for resources such as processor time, memory, network bandwidth, and storage. Virtual machines can be balanced among multiple computer systems operating in a cluster.

Disclosed is as system for reducing memory and computational requirements of graphics operations. The system provides techniques for combining otherwise individual operations to apply filters to images. The combined filter emerging from the combination spares the processor time and the creation of an entire intermediary image. The system further provides for application of these techniques in many contexts including where the operations are fragment programs in for a programmable GPU.

A system for processing radio frequency (RF) signals includes a searcher and a plurality of Cluster Path Processor (CPPs). The searcher detects a maximum signal energy level and position of at least one of a plurality of individual distinct path signals in a signal cluster of a first information signal, wherein at least a portion of the plurality of individual distinct path signals is received within a duration of a corresponding delay spread. The sampling position is used as a starting sampling location by the plurality of CPPs, including a first information signal CPP and a second information signal CPP. Fine sampling positions of the plurality of CPPs are based upon channel energy estimates for the plurality of individual distinct path signals. CPP outputs are employed to produce channel estimates, which are themselves used in subsequent equalization operations. Sampling positions may change over time in order to satisfy alignment criteria.

In a processor capping method in a virtual machine system, a complement virtual machine is created having a possessive processor time equal to the difference of subtraction of a possessive processor time given to the processor capping enabled virtual machine from a possessive processor time of the whole physical computer; a processor time by which each virtual machine utilizes the physical processor per unit time is determined; schedule priorities of each virtual machine and of the complement virtual machine are determined on the basis of their possessive processor times and the determined utilization processor time as well; and the schedule priority of the processor capping enabled virtual machine is compared with that of the complement virtual machine corresponding to the processor capping enabled computer to decide whether the schedule for the physical processor of the virtual processor the processor capping enabled virtual machine has is permissible or prohibitive.

Data compression efficacy in a data storage system is analyzed, and data compression modified in accordance with the results of such analysis, thereby saving otherwise wasted processor time when data compression is poor. Multiple input data blocks are received for storage in a data storage subsystem, and a predetermined compression process is applied thereto. Application of the predetermined compression process is evaluated according to a predetermined compression criteria. If the compression fails to satisfy the predetermined compression criteria, application of the predetermined compression process ceases.

A system and a method are disclosed for an activity manager providing a centralized component for allocating resources of a mobile computing device among various activities. An activity represents work performed using computing device resources, such as processor time, memory, storage device space or network connections. An application or system service requests generation of an activity by the activity manager, causing the activity manager to associate a priority level with the activity request and identify resources used by the activity. Based on the priority level, resources used and current resource availability of the mobile computing device, the activity manager determines when the activity is allocated mobile computing device resources. Using the priority level allows the activity manager to optimize performance of certain activities, such as activities receiving data from a user.

A fast loss less image compression system based on neighborhood comparisons compares pixel value differences with neighboring pixels and replaces such pixel values with the minimum of the differences. A marker is attached to a block of pixels, such that all the pixels in that block are compared with neighbors of one direction. The marker indicates how all of the pixels in that block are compared. Intermittent Huffman-tree construction is used such that one tree is used for several frames. Huffman coding is used to compress the resulting frame. A single Huffman-tree is constructed once every predetermined number of frames. The frequency of Huffman-tree construction can be performed according to the instantaneous availability of processor time to perform the construction. When more processing time is available, the Huffman-trees are computed more frequently. Such frequency variation can be implemented by using an input video frame buffer. If the buffer is a certain size, then processor time for Huffman-tree construction is available.

A method and system of a sparse sampling planner uses a finite number of measurements to determine a track's expected intermediate kinematic and classification state for a specific sensor action. It uses the expected track state to compute a reward function. The expected states are further propagated for actions at the next time step to determine the next states and so on. The sampling becomes sparse and the reward function is discounted as one propagates further in time. This produces a state-action tree that is more top-heavy while providing greater accuracy at times closer to the decision point. By doing so, the planner creates a plan comprising a sequence of actions that result in the highest reward. By employing various heuristics to further prune the tree gives highly accurate results with significant savings in computational processor time.

In one embodiment, an apparatus comprises one or more processors and a controller coupled to the processors. Each processor comprises at least one processor time stamp counter (TSC) and a first control unit configured to maintain the processor TSC. The controller comprises at least one controller TSC and a second control unit configured to maintain the controller TSC. The controller is configured to signal the processor responsive to determining that the processor TSC is out of synchronization with the controller TSC. In response to having been signalled that the processor TSC is out of synchronization, the processor is configured to resynchronize the processor TSC to the controller TSC before generating a result for a read TSC instruction. In response to having not been signalled that the processor TSC is out of synchronization, the processor is configured to generate the result responsive to the processor TSC without resynchronizing.

Embodiments of the invention provide a thread scheduling method and device, electronic equipment and a storage medium. The method comprises the steps of acquiring a pairing relation between each thread in a target virtual machine process and each local thread in an operating system; and according to the pairing relation, binding each thread to a corresponding processor in a target processor set, so that each thread is dispatched by the corresponding processor. According to the technical scheme, the phenomenon that time slices of the same processor are scrambled for when multiple threads are executed is avoided; the problem that multi-thread task queuing is blocked due to excessive service threads of the same processor and overlong service time of real-time threads is solved; the executiontime delay of other threads is shortened; and the real-time performance of thread execution is improved.

In one embodiment, a processor comprises at least one processor time stamp counter (TSC) and a control unit coupled to the processor TSC. The processor TSC corresponds to a TSC that is defined to increment at a TSC clock frequency even though the processor is configurable to operate at one of a plurality of clock frequencies. The control unit is configured to maintain the processor TSC, and is configured to update the processor TSC when the processor is operating at a current clock frequency of the plurality of clock frequencies, wherein the update comprises adding a value to the processor TSC, and wherein the value is based on the ratio of the TSC clock frequency and the current clock frequency.

The invention discloses an airborne SAR real-time imaging method. The airborne SAR real-time imaging method comprises the following steps: estimating kinematic error offset and phase error, and executing the range direction space-variant motion compensation processing to the original data so as to obtain the data after the motion compensation; executing the orientation direction pre-processing to the data after the motion compensation; executing the two-channel frequency band synthesis compressing to the data after the orientation direction pre-processing in the range direction; executing the three-page two-dimensional transposition to the data after the range direction compressing, and executing the range migration correction to the data after the transposition; and executing the improved PGA self-focusing to the data after the range migration correction; and executing the orientation compressing, reverse transposition and real-time compressing to the data after the self-focusing, to obtain the SAR compressing image. The method is suitable for an airborne SAR range direction two-channel frequency band synthesized real-time imaging processor, and has the higher image processing quality and lower processor time delay.

In an environment in which applications perform multi-tasking by using threads, the optimum number of threads to be provided to an application is determined based on historical data. Due to the use of the historical data, optimum number of threads can be accurately determined, leading to better response times for service requests, without creating unneeded overhead on system processing the service requests. In one embodiment, various status information (of potentially several prior weeks) such as number of tasks received and pending, system resources status (e.g. idle processor time and aggreate memory usage in the system), is maintained. In addition, a table may be maintained to indicate the optimum number of threads for a given combination of status information values. Thus, based on the expected status scenario, the optimum number of threads can be determined and provided at various points of time.

In the optical transport system a transport frame generator divides a transport frame accommodating plural client signals into plural transmission signals. Subcarrier transmission units convert the signals into optical signals using different optical carriers and transmit the converted optical signals. Subcarrier reception units receive the transmitted optical signals and convert the optical signals into reception signals. A transport frame termination unit combines the reception signals to restore the transport frame. A time-demultiplexing processor time-demultiplexes the restored transport frame to be separated into the client signals. A time slot control unit determines a new time slot allocation when time-multiplexing the client signals in the transport frame and stops supply of electric power to a subcarrier transmission unit and a subcarrier reception unit that transmit and receive an optical signal to which the client signals are not allocated.