Abstract: Methods, systems, and techniques for data compression. A cluster fingerprint of an uncompressed data block is determined to correspond to a cluster fingerprint of a base block stored in a base array. This determining involves looking up the cluster fingerprint of the first base block from the base array using the cluster fingerprint of the first uncompressed data block. The difference between the uncompressed data block and the base block is determined, and a compressed data block is encoded using this difference. The compressed data block is then stored in a data array.

Abstract: Methods, systems, and techniques for data compression. A cluster fingerprint of an uncompressed data block is determined to correspond to a cluster fingerprint of a base block stored in a base array. This determining involves looking up the cluster fingerprint of the first base block from the base array using the cluster fingerprint of the first uncompressed data block. The difference between the uncompressed data block and the base block is determined, and a compressed data block is encoded using this difference. The compressed data block is then stored in a data array.

Abstract: An execution migration approach includes bringing the computation to the locus of the data: when a memory instruction requests an address not cached by the current core, the execution context (current program counter, register values, etc.) moves to the core where the data is cached.

Abstract: An execution migration approach includes bringing the computation to the locus of the data: when a memory instruction requests an address not cached by the current core, the execution context (current program counter, register values, etc.) moves to the core where the data is cached.

Abstract: A system and method for Term Rewriting System hardware design employs a scheduler that incorporates a preference order in scheduling conflicting rules. The scheduler schedules a conflicting rule to execute when its predicate is true, and it is preferred over other conflicting rules in the preference order. The preference order may be, in one embodiment, a user-specified preference order enumerated by a designer. Such an order may be chosen according to efficiency criteria, such that the conflicting rule most essential for efficient hardware will be scheduled to execute on a given state rather than less essential conflicting rules The system and method advantageously permits a schedule to be computed in a time frame polynomially related to the number of rules, and produces more predictable and more easily understood schedules than conventional methods.