Fast CRC Computation for iSCSI Polynomial Using CRC32 Instruction
Cyclic Redundancy Check (CRC) codes are widely used for integrity checking of data in fields such as storage and networking. There is an ever-increasing need for very high-speed CRC computations on microarchitectures for end-to-end integrity checks. We present fast and efficient methods of computing CRC on IA microarchitectures for the fixed (degree-32) iSCSI polynomial using the CRC32 instruction introduced in the Nehalem-based microarchitecture. Various methods are thoroughly explained in this paper with real code examples.
Please disable any pop-up blockers for proper viewing of this Whitepaper.