Methods and apparatus are provided for processing information items. Processing comprises one of context filtering, context prioritizing, or both context filtering and context prioritizing. In some embodiments the set of context items form which processing criteria are derived includes a user's calendar or appointments, schedule changes, exceptions, and the like.

Context-based information processing

The present disclosure includes apparatuses and methods related to performing logical operations using sensing circuitry. An example apparatus comprises an array of memory cells and sensing circuitry comprising a primary latch coupled to a sense line of the array. The sensing circuitry can be configured to perform a first operation phase of a logical operation by sensing a memory cell coupled to the sense line, perform a number of intermediate operation phases of the logical operation by sensing a respective number of different memory cells coupled to the sense line, and accumulate a result of the first operation phase and the number of intermediate operation phases in a secondary latch coupled to the primary latch without performing a sense line address access.

Apparatuses and methods for performing logical operations using sensing circuitry

Techniques for dynamic management of virtual machine environments are disclosed. For example, a technique for automatically managing a first set of virtual machines being hosted by a second set of physical machines comprises the following steps/operations. An alert is obtained that a service level agreement (SLA) pertaining to at least one application being hosted by at least one of the virtual machines in the first set of virtual machines is being violated. Upon obtaining the SLA violation alert, the technique obtains at least one performance measurement for at least a portion of the machines in at least one of the first set of virtual machines and the second set of physical machines, and a cost of migration for at least a portion of the virtual machines in the first set of virtual machines. Based on the obtained performance measurements and the obtained migration costs, an optimal migration policy is determined for moving the virtual machine hosting the at least one application to another physical machine.

Systems and methods for dynamically managing virtual machines

A hypervisor negotiates to reserve at least one available local resource in a host system that meets a performance parameter for at least one resource specified in a reservation request by a particular logical partition from among one or more logical partitions of virtualized pools of resources managed by the hypervisor in the host system, wherein the at least one performance parameter is specified by a particular application initiating the reservation request. The hypervisor, responsive to determining that the at least one available resource is not available in the host system, negotiates for offers to migrate the particular logical partition to at least one other host system comprising at least one available remote resource that meets the performance parameter, wherein the at least one other host system is managed by at least one other hypervisor that manages one or more other logical partitions of virtualized pools of resources.

Application initiated negotiations for resources meeting a performance parameter in a virtualized computing environment

An apparatus and method are described for comparing elements between two immediate values. For example, a method according to one embodiment includes the following operations: reading values of a first set of elements stored in a first immediate value, each element having a defined element position in the first immediate value; comparing each element from the first set of elements with each of a second set of elements stored in a second immediate value; counting the number of times the value of each element of the first set of elements is found in the second set of elements to arrive at a final count for each element of the first set of elements; and transferring the final count for each element to a third immediate value, wherein the final count is stored in an element position in the third immediate value corresponding to the defined element position in the first immediate value.

Apparatus and method for vector compute and accumulate

Method, apparatus, and program means for performing a packed multiply high with round and shift operation. The method of one embodiment comprises receiving a first operand having a first set of L data elements. A second operand having a second set of L data elements is received. L pairs of data elements are multiplied together to generate a set of L products. Each of the L pairs includes a first data element from the first set of L data element and a second data element from a corresponding data element position of the second set of L data elements. Each of the L products are rounded to generate L rounded values. Each of said L rounded values are scaled to generate L scaled values. Each of the L scaled values are truncated for storage at a destination. Each truncated value is to be stored at a data element position corresponding to its pair of data elements.

SIMD integer multiply high with round and shift

A method for computing a decimation-in-time Fast Fourier Transform of a sample is provided, the method including inputting first 2B-bit values representing the sample into a radix-4 first section of the decimation-in-time Fast Fourier Transform and performing first complex 2B-bit integer additions and subtractions on the first 2B-bit values to form second 2B-bit values, without performing a multiplication. The method also includes rounding the second 2B-bit values to form B-bit values output from the radix-4 first section of the decimation-in-time Fast Fourier Transform.

Reducing peak spectral error in inverse Fast Fourier Transform using MMX™ technology

Disclosed are embodiments of a system, methods and mechanism for management and translation of mapping between logical sequencer addresses and physical or logical sequencers in a multi-sequencer multithreading system A mapping manager may manage assignment and mapping of logical sequencer addresses or pages to actual sequencers or frames of the system Rationing logic associated with the mapping manager may take into account sequencer attributes when such mapping is performed Relocation logic associated with the mapping manager may manage spill and fill of context information to/from a backing store when re-mapping actual sequencers Sequencers may be allocated singly, or may be allocated as part of partitioned blocks The mapping manager may also include translation logic that provides an identifier for the mapped sequencer each time a logical sequencer address is used in a user program Other embodiments are also described and claimed

Sequencer address management

A system and a method of automatically prioritizing and analyzing performance data for one or more system configurations are provided. Performance data is obtained about a system using a first tool. The performance data is sorted by a number of contexts, each context divided into a number of sub-contexts. The performance data for at least one sub-context is automatically prioritized using a pre-determined criteria. An insight is obtained using a second tool for at least one sub-context based on the prioritized performance data. An advice associated with that insight is obtained using the second tool.

James C. Abel

Papers

Apparatus and method for vector compute and accumulate

SIMD integer multiply high with round and shift

Reducing peak spectral error in inverse Fast Fourier Transform using MMX™ technology

Sequencer address management

Method and system for automatically prioritizing and analyzing performance data for one or more, system configurations