in reply to Re^2: how to multiply an array of number as fast as posible
in thread how to multiply an array of number as fast as posible
The CPU is already working at 100% calculating the number.
Yes, one core is working at 100% to calculate the product. By splitting the list in half, two cores are working at 100% - the OP cites having a dual core. It just so happens that in this case:
loop_overhead + n*multiplication < thread_overhead + loop_overhead + (n/2)*multiplication
as I would expect for this kind of simple operation. But throw in transcendental functions and maybe the balance shifts.
|
|---|