Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Faster version of ISA&BWT #1

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open

Conversation

manpen
Copy link

@manpen manpen commented Nov 9, 2017

Here a slightly tuned version of ISA&BWT. On my laptop, I observe a speed-up of ~320%

Questions:
In the original version, the target index of the BWT-pairs was isa-second+1. IHMO the addition is wrong, as the shift in the BWT-transform is already caused by the 1-shift between ISA and Textfile?!

Changes:

  • Use STXXL-based file access for reading and writing (wont be faster, but more consistent)
  • Use buffered readers and writers (probably biggest performance impact)
  • Overlap writing of ISA-file and filling of BWT-sorter
  • Moved from ksort to sorter which reduces the I/Os required, but does not perform an integer sort. On my laptop this causes a slow-down of ~5%. But experiments were conducted with a RAM-Disk. Hence it should be faster on secondary memory. Also, as discussed, we want to have an integer-based sorter "soon"

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant