Timeline for x86 MUL operation at hardware level
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 1, 2023 at 18:01 | comment | added | Justme | Feel free to look the Intel CPU documentation how many clock cycles it takes in each case. There is no way to know how a specific Intel CPU does it. There is also no generic method to do it. Likely Wikipedia lists multiple different methods of computing multiplication in computers. Have you done any research before asking, and is this some kind of homework question? | |
Mar 1, 2023 at 17:00 | answer | added | Voltage Spike♦ | timeline score: 1 | |
Mar 1, 2023 at 16:49 | comment | added | periblepsis | Weier, You mentioned an instr. set that has a long history and for which there isn't a single answer (it was done different ways at different times) and then you ask for how it is done, generally. Folks that do these things apply a lot of knowledge to varying goals. So I think the better answer for you is to start by learning about the Booth algorithm. I've not read this, An effective educational module for Booth's multiplication algorithm, but the title sounds good. | |
Mar 1, 2023 at 16:48 | comment | added | Marcus Müller | Also, is it executed in a single CPU cycle? That depends on your CPU. But in general, no. Modern processors are heavily pipelined, pretty nothing is executed in one cycle, though it might have a througput of 1 / cycle. | |
Mar 1, 2023 at 16:37 | comment | added | Eugene Sh. | Did you try to google something like "hardware multiplier" or "binary multiplier"? | |
S Mar 1, 2023 at 16:21 | review | First questions | |||
Mar 1, 2023 at 16:50 | |||||
S Mar 1, 2023 at 16:21 | history | asked | Weier | CC BY-SA 4.0 |