| کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
|---|---|---|---|---|
| 427783 | 686556 | 2012 | 7 صفحه PDF | دانلود رایگان |
Intel has recently introduced a new instruction, namely CRC32, to address a computational bottleneck in protocols such as ISCSI and RDMA that use CRC32C for data integrity checks. This instruction is designed to accumulate the CRC32C value of a buffer of arbitrary length, by a sequence of invocations that consume consecutive chunks of 8 bytes of the buffer per invocation. This instruction has latency of 3 cycles, and therefore using it serially allows software to process data at the rate of ∼2.67 bytes per cycle. We introduce here an alternative algorithm for computing the CRC32C value of a buffer, using the same instruction. This algorithm converts the latency bounded computations to throughput oriented ones, and maximizes the utilization of the pipelined hardware that underlies the instruction, achieving speedup of a factor of almost 3.
Journal: Information Processing Letters - Volume 112, Issue 5, 28 February 2012, Pages 179-185