interleaved-algorithms

testbed for instruction stream interleaving

binary search is the only algorithm at the moment

Run

Compilation (optionally depends on google benchmark library):

$ mkdir build
$ cmake ..
$ make

Generate some simple test data (creates by default 'newdata.dat'):

$ ./gen

Run test program (uses by default 'newdata.dat'):

$ ./binary_search -k $((4*1024*1024))

Use -h to access the help for each program.

If you compiled with google benchmark support (file name 'newdata.dat' hardcoded atm):

$ ./binary_search_bench