How modern X86 processors actually compute multiplications?

by

Mitch Alsup (who worked on Motorola 88K, Ross SPARC, AMD x86, etc.) has stated on the comp.arch newsgroup:

All modern multiplier designers use the Dadda method for building the tree.

(Message-ID: <[email protected]> — 14 December 2018)

and (with respect to availability of recent references for what multiplication mechanisms are used by AMD/Intel/NVIDIA):

Only in the patent office.

(Message-ID: <[email protected]> — 14 January 2020)

See Wikipedia for information on Dadda tree multipliers.

More Related Contents:

  1. Adding a redundant assignment speeds up code when compiled without optimization
  2. how are barriers/fences and acquire, release semantics implemented microarchitecturally?
  3. How do the store buffer and Line Fill Buffer interact with each other?
  4. Are load ops deallocated from the RS when they dispatch, complete or some other time?
  5. Portable efficient alternative to PDEP without using BMI2?
  6. Are two store buffer entries needed for split line/page stores on recent Intel?
  7. complexity in terms of big O
  8. Find all paths between two graph nodes
  9. Why is the constant always dropped from big O analysis?
  10. How can building a heap be O(n) time complexity?
  11. Which algorithm is faster O(N) or O(2N)?
  12. find the only unpaired element in the array
  13. Sort points in clockwise order?
  14. Determine font color based on background color
  15. Nearest neighbors in high-dimensional data?
  16. Why do we use Base64?
  17. Heap vs Binary Search Tree (BST)
  18. Counting the adjacent swaps required to convert one permutation into another
  19. Algorithm for finding similar images
  20. design a stack such that getMinimum( ) should be O(1)
  21. Largest circle inside a non-convex polygon
  22. Generate a list of primes up to a certain number
  23. Best Fit Scheduling Algorithm
  24. Algorithm to find multiple string matches
  25. O(n) algorithm to find the median of n² implicit numbers
  26. Finding how similar two strings are
  27. Why did Intel change the static branch prediction mechanism over these years?
  28. Why is bubble sort O(n^2)?
  29. Location of highest density on a sphere
  30. Why is the “start small” algorithm for branch displacement not optimal?

Leave a Comment