Abstract: Embodiments related to selecting a runahead poison policy from a plurality of runahead poison policies during microprocessor operation are provided. The example method includes causing the microprocessor to enter runahead upon detection of a runahead event and implementing a first runahead poison policy selected from a plurality of runahead poison policies operative to manage runahead poison injection during runahead. The example method also includes during microprocessor operation, selecting a second runahead poison policy operative to manage runahead poison injection differently from the first runahead poison policy.

Abstract: Embodiments related to re-dispatching an instruction selected for re-execution from a buffer upon a microprocessor re-entering a particular execution location after runahead are provided. In one example, a microprocessor is provided. The example microprocessor includes fetch logic, one or more execution mechanisms for executing a retrieved instruction provided by the fetch logic, and scheduler logic for scheduling the retrieved instruction for execution. The example scheduler logic includes a buffer for storing the retrieved instruction and one or more additional instructions, the scheduler logic being configured, upon the microprocessor re-entering at a particular execution location after runahead, to re-dispatch, from the buffer, an instruction that has been previously dispatched to one of the execution mechanisms.

Abstract: A method and apparatus for compressing data automatically selects either direct compression of sub-blocks or of compression of transformed sub-blocks to achieve fast and effective data compression. A method and apparatus for decompression automatically performs either direct decompression or decompression and transform operations for respective sub-blocks.

Abstract: An approach for improving efficiency of speculative execution of instructions is disclosed. In one embodiment, a branch predictor entry associated with a particular branch instruction is accessed when the particular branch instruction is to be speculatively executed. The branch predictor entry may take on different values indicating whether a first possible path or a second possible path should be executed. Based upon a current value of the branch predictor entry, a predicted path for the particular branch instruction may be determined. Instructions along the predicted path may be executed, before the particular branch instruction is resolved. Once the particular branch instruction is resolved, a cost associated with executing the one or more instructions may be determined. Accordingly, the branch predictor entry may be updated by an amount that is commensurate with the cost.

Abstract: A computing system comprises a processor, a data storage unit, and a block size table (BST). The processor includes at least one cache configured to store data. The data storage unit is configured to store data in a compressed format in fixed size units. The BST is configured to store block size entries corresponding to data blocks stored in the data storage unit. In response to a miss in the cache corresponding to a target data block, the processor is configured to identify an entry in the BST corresponding to the target data block, utilize information stored in the entry to determine the location of the target data block in the data storage unit, and cause the target data block to be retrieved from the data storage unit, decompressed, and stored in the cache.

Abstract: A method and apparatus for compressing data automatically selects either direct compression of sub-blocks or of compression of transformed sub-blocks to achieve fast and effective data compression. A method and apparatus for decompression automatically performs either direct decompression or decompression and transform operations for respective sub-blocks.

Abstract: A mechanism is disclosed for enabling a plurality of nodes on a network to collaboratively exchange sets of rendering information respecting a file. In one implementation, each node maintains its own copy of the file, and each node may access its copy of the file. Whenever a node does access the locations of the file, that node sends out a rendering information message. The rendering information message comprises the set of rendering information for the file that has been updated. The rendering information message is forwarded to each of the other nodes. When each of the other nodes receives the rendering information message, it stores the set of rendering information contained therein to a rendering history associated with a user. In this manner, histories of access in the file by all users are exchanged among the nodes, and the user on each node is able to see rendering information generated by users on the other nodes. Collaboration among the users is thus achieved.

Abstract: A method and apparatus for compressing uncompressed data by applying a transform prior to the application of a data compression scheme. At decompression time, a transform can be applied after a data decompression scheme has been applied to compressed data.

Abstract: A multiprocessor system is described including a plurality of processors. At least one level of cache memory is operatively connected to each of the processors. At least one memory unit is shared by at least two of the processors. A status memory, in correspondence to each processor, is configured to store a current status in correspondence to memory regions capable of being stored in the cache memories. The current status indicates whether a memory region is non-shared. The system includes logic, in correspondence to and operatively connected to each processor, for generating minimum cache-coherence activities in response to a memory access request by a respective processor.

Abstract: Immobilized biologically active substances comprising microporous, spherical particles in gel form and in the form of a three-dimensional network. These particles contain the biologically active substance entrapped in the meshes of the network. The particles have sizes below 10 .mu.m and the average diameter of the particles is in the range of from 0.5 to 4 .mu.m, preferably 1 .mu.m. The biologically active substance is capable of exerting its biological activity against substances which cannot penetrate into the meshes of the network of the particles. Preferably, the particles are gel grains obtained by copolymerization of acrylic compounds with cross-linkers. The immobilized biologically active substances are used for labelling or separation of cells, cell fragments, viruses or tissue structures having specific receptors or of substances having specific surface structures.