For many years, Herlihy’s elegant computability based Consensus Hierarchy has been our best explanation of the relative power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this hierarchy is treating synchronization instructions as distinct objects, an approach that is far from the real-world, where multiprocessor programs apply...

This paper describes a novel memory hierarchy and line-pixel-lookahead (LPL) for an H.264/AVC video decoder. The memory system is the bottleneck of most video processors, particularly in the newly announced H.264/AVC. This is because it utilizes the neighboring pixels to create a reliable predictor, leading to a dependency on a long past history of data. This problem can be resolved by allocati...

To gain higher density and lower leakage, STT-RAM has been considered an alternative to SRAM for implementing last-level caches (LLCs). However, STT-RAM requires high write energy to program. Consequently, frequent write-backs from the upper-level caches or cache fills from the main memory will result in high LLC power. Both the broadcast and write-back traffic are affected by the cache coheren...

A methodology for power optimization of the data memory hierarchy and instruction memory, is introduced. The effect of the methodology on a set of widely used multimedia application kernels, namely Full Search (FS), Hierarchical Search (HS), and Parellel Hierarchical One Dimension Search (PHODS), is demonstrated . Three different target architecture models are used. The issues of the data memor...

A problem domain can be represented as a hierarchy of abstraction spaces in which successively finer levels of detail are introduced. The problem solver ABSTRIPS, a modification of STRIPS, can define an abstraction space hierarchy from the STRIPS representation of a problem domain, and it can utilize the hierarchy in solving problems. Examples of the system's performance are presented that demo...

When restricted to proving Σqi formulas, the quantified propositional proof system Gi is closely related to the Σ b i theorems of Buss’s theory S i 2. Namely, G ∗ i has polynomial-size proofs of the translations of theorems of S 2, and S i 2 proves that G ∗ i is sound. However, little is known about Gi when proving more complex formulas. In this paper, we prove a witnessing theorem for Gi simil...