Number of Threads for BWA MEM
2
1
Entering edit mode
5.8 years ago
haiying.kong ▴ 360

Is it recommended to use number of threads for BWA MEM, 2**N (4, 8, 16, 32...)? Or any number is as good as well as long as the memory can support?

bwa • 11k views
ADD COMMENT
1
Entering edit mode

You can't use more than what is available on your computer for a start. Experiment with a small set of reads (100K) to see what core # works best with your system in terms of time to complete. You will saturate something (PCI-E/memory bus) and will see a plateau in performance beyond a certain number of cores/threads.

ADD REPLY
0
Entering edit mode

If your machine/cluster can support it, using many threads with -t should be fine.

ADD REPLY
0
Entering edit mode

It does not have advantage if the number of thread is 2**N, is this correct?

ADD REPLY
0
Entering edit mode

I'd stick to the greatest number of threads your processor can support, unless you're on a workstation and you actually need to do other stuff while bwa runs.

ADD REPLY
2
Entering edit mode
5.2 years ago

Are you looking for something like this ?

alt text

Source: http://en.community.dell.com/techcenter/high-performance-computing/b/genomics

ADD COMMENT
0
Entering edit mode
5.2 years ago
fwuffy ▴ 100

Bump. You can not run bwa with 1000 threads on one host and expect it to be 1000x faster than single thread. There will be a theoretical optimum which is a function of memory available per thread and reference genome size. Has anyone actually done tests?

ADD COMMENT
2
Entering edit mode

This will very likely depend on your computer architecture, for example I/O speed.

ADD REPLY
1
Entering edit mode

+1 - for most setups, alignment will be I/O bound before any other bottleneck gets hit.

ADD REPLY
0
Entering edit mode

There will be a theoretical optimum

Did you mean Amdahl's law?

ADD REPLY

Login before adding your answer.

Traffic: 1787 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6