Power consumption, off-chip memory bandwidth, chip area and Network on Chip (NoC) capacity are among main chip resources limiting the scalability of Chip Multiprocessors (CMP). A closed form analytical solution for optimizing the CMP cache hierarchy and optimally allocating area among hierarchy levels under such constrained resources is developed. The optimization framework is extended by incor...

We investigate an imperative and a functional programming language. The computational power of fragments of these languages induce two hierarchies of complexity classes. Our first main theorem says that these hierarchies match, level by level, a complexity-theoretic alternating space-time hierarchy known from the literature. Our second main theorems says that a slightly different complexity-the...

We study the effect of query order on computational power, and show that Pj k—the languages computable via a polynomial-time machine given one query to the jth level of the boolean hierarchy followed by one query to the kth level of the boolean hierarchy—equals Rpj+2k−1-tt(NP) if j is even and k is odd, and equals Rpj+2k-tt(NP) otherwise. Thus, unless the polynomial hierarchy collapses, it hold...

As the scale of wind power bases rises, it becomes significant in power system planning and operation to provide detailed correlation characteristic of wind speed in different geographical hierarchies, that is among wind turbines, within a wind farm and its regional wind turbines, and among different wind farms. A new approach to analyze the correlation characteristics of wind speed in differen...

The power consumed by the memory hierarchy of a microprocessor can contribute to as much as 50% of the total microprocessor system power, and is thus a good candidate for power and energy optimizations. We discuss four methods for tuning a microprocessors’ cache subsystem to the needs of any executing application for low-energy embedded systems. We introduce onchip hardware implementing an effi...

In this contribution we study partial orders in the set of zero-sum arrays. Concretely, these partial orders relate to local and global hierarchy and dominance theories. The exact relation between hierarchy and dominance curves is explained. Based on this investigation we design a new approach for measuring dominance or stated otherwise, power structures, in networks. A new type of Lorenz curve...

We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy over the class of finite directed graphs. This is a response to an open problem posed in [4] and [8]. We also provide modal characterizations of the expressive power of Monadic Second-Order Logic (MSO) and address a number of p...

This paper is concerned with the expressive power of Parikh's Game Logic interpreted in Kripke structures. We show that the syntactical alternation hierarchy of this logic is strict, by expressing the winning condition for parity games with n priorities. Moreover, it follows that Game Logic is not captured by any nite level of the -calculus alternation hierarchy. We can further conclude that mo...

We extend a widely used concept of rewrite systems with a mechanism for computing with partial information in a form similar to the one used in concurrent constraint programming. We present how this extension changes the expressive power of rewrite systems classes which are included in Mayr’s PRS hierarchy [May97b]. The new classes (fcBPA, fcBPP, fcPA, fcPAD, fcPAN, fcPRS) are described and ins...