https://github.com/ivanbgd/branch_prediction

Compares execution speed of processing sorted and unsorted arrays, with and without branching. Disassembly and results included.
https://github.com/ivanbgd/branch_prediction

branch-prediction c-plus-plus cplusplus cpp

Last synced: 12 months ago
JSON representation

Compares execution speed of processing sorted and unsorted arrays, with and without branching. Disassembly and results included.

• Host: GitHub
• URL: https://github.com/ivanbgd/branch_prediction
• Owner: ivanbgd
• License: mit
• Created: 2016-12-14T00:40:07.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2016-12-14T01:09:51.000Z (over 9 years ago)
• Last Synced: 2025-02-03T10:11:58.602Z (over 1 year ago)
• Topics: branch-prediction, c-plus-plus, cplusplus, cpp
• Language: C++
• Homepage:
• Size: 43.9 KB
• Stars: 1
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Branch_Prediction

Compares execution speed of processing sorted and unsorted arrays, with and without branching. Loop interchange has also been tested.

Disassembly from MSVS 2015 is included in the source file, and results are in screenshots.

Motivation:

Why is it faster to process a sorted array than an unsorted array?

http://stackoverflow.com/questions/11227809/why-is-it-faster-to-process-a-sorted-array-than-an-unsorted-array