Performance of inline assembly: An analysis based on the computation of Fibonacci sequence
|
|
Using the Fibonacci sequence computation as an example, this article analyzes the speed advantage of an inline assembly implementation in comparison to the performance of other programming techniques such as the recursive algorithm, the dynamic programming implementation, the iterative approach, and the optimized matrix power algorithm. The target audience is software engineers interested in further accelerating the execution of their applications by handcrafting the assembler codes for the most performance-critical sections.
|
|
Full Story |
This topic does not have any threads posted yet!
You cannot post until you login.
