A systolic algorithm is described for generating, in lexicographlcally ascending order, all combinations of m objects chosen from {1 .... ,n). The algorithm is designed to he executed on a linear array of m processors, each having constant size memory, and each being responsible for producing one dement of a given combination. There is a constant delay per combination, leading to an O(C(m, n)) ...

In this report new unranking algorithms are developed for a large class of choice functions representing various classes of combinatorial objects: combinations, complementary combinations, conjugative nondecreasing choice functions, ordered partitions. Presented algorithms differ with the type of lexicographical order they deal with and the method of binomial coefficient evaluation. The proofs ...

This work explores the potential of sharing different arithmetic hardware operators tightly coupled to the integer pipeline of the open-source LEON3 processor. The idea is to map these modules to the same silicon area saving power consumption and area utilisation. The same strategy can be used to extend the architecture of processors optimized for applications with specific energy constraints. ...

Modern processors use speculative execution to improve performance. However, speculative execution requires a checkpoint/restore mechanism to repair the machine’s state whenever speculation fails. Existing checkpoint/restore mechanisms do not scale well for processors with relatively large windows (i.e., 128 or more). This work presents Turbo-ROB, a checkpoint/restore recovery accelerator that ...

Abstract -This paper presents a study of different power metrics for varying microarchitectural configurations and proposes an efficient scheme to reduce the energy requirements of superscalar, out-of-order processors. Specifically, we propose the use of multiple supply voltages at microarchitectural level by exploiting the difference in latencies of different pipeline stages or modules. The pr...

Peer-to-peer markets going mobile spur spontaneity in trading considerably. Spontaneity, however, imposes severe informational requirements on the market participants. Informational requirements are twofold: Firstly, participants have to agree on a common vocabulary for that spontaneous market. Secondly, they need precise information about how the trading process is organized. Due to the lack o...