TC
2011
13 years 5 months ago
2011
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
TC
2011
13 years 5 months ago
2011
— Implementing shared memory consistency models on top of hardware caches gives rise to the well-known cache coherence problem. The standard solution involves implementing cohere...
TC
2011
13 years 6 months ago
2011
—Increasing energy consumption in server consolidation environments leads to high maintenance costs for data centers. Main memory, no less than processor, is a major energy consu...
TC
2011
13 years 6 months ago
2011
—This paper considers the problem of dividing a two-word integer by a single-word integer, together with a few extensions and applications. Due to lack of efficient division ins...
TC
2011
13 years 6 months ago
2011
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
TC
2011
13 years 6 months ago
2011
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
TC
2011
13 years 6 months ago
2011
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
TC
2011
13 years 6 months ago
2011
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...
TC
2011
13 years 6 months ago
2011
—Mounting concerns over variability, defects and noise motivate a new approach for digital circuitry: stochastic logic, that is to say, logic that operates on probabilistic signa...
TC
2011
13 years 6 months ago
2011
