LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 40-42 of 486
-
Exploiting Superword Level Parallelism with Multimedia Instruction Sets
(1999-11)Increasing focus on multimedia applications has prompted the addition of multimedia extensions to most existing general-purpose microprocessors. This added functionality comes primarily in the addition of short SIMD ... -
Strength Reduction of Integer Division and Modulo Operations
(1999-11)Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behavior in queues using ring buffers, array ... -
A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm
(1999-06)We have developed a practical algorithm for state-machine replication [7,11] that tolerates Byzantine faults. The algorithm is described in [4]. It offers a strong safety property - it implements a linearizable [5] object ...
