Stack Exchange
open access
CC BY-SA
Why is addition as fast as bit-wise operations in modern processors?
I know that bit-wise operations are so fast on modern processors, because they can operate on 32 or 64 bits on parallel, so bit-wise operations take only one clock cycle. However addition is a complex operation that consists of at least one and possibly up to a dozen bit-wise operations, so I naturally thought it will be 3-4 times slower. I was surprised to see after a simple benchmark that addition is exactly as fast as any of the bit-wise operations(XOR, OR, AND etc). Can anyone shed light on this?
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Gender differences in computation strategies: Evidence across adolescent and adult samples.#285308
- Wavelet analysis reveals non-stationary cardiovascular rhythms associated with delirium and deep sedation in ICU patients#216666
- Complexity is a unified cognitive kind#228465
- An empirical validation of power-performance scaling: DVFS vs. multi-core scaling in big.LITTLE processor#69462
- Comparison of SITA-Standard Compared to SITA-Fast Visual Fields.#290886
Record · ID 796559
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive