| commit | a979704026ba384654288890bb4185c31b2eb811 | |
| author | Berk Hess <hess@kth.se> | |
| Sat, 14 May 2016 15:09:04 +0000 (14 17:09 +0200) | ||
| committer | Mark Abraham <mark.j.abraham@gmail.com> | |
| Wed, 22 Jun 2016 08:18:05 +0000 (22 10:18 +0200) | ||
| tree | 80f0493eed0cb8777827792d3f184008693dc6e2 | treesnapshot (tar.gz zip) |
| parent | 18e384d3e37503add2d7fa01f7642706e160d7fd | commitdiff |
Add nbnxn pair-list rebalancing
The nbnxn CPU pair-lists, and the non-bonded tasks can be unbalanced
over threads, especially for small systems. This change implements
pair-list rebalancing that result in near perfect load-balancing.
This increases the search cost by 3%, but this is outweighed by the
more balanced non-bonded kernel times.
Change-Id: I64e7395127faf193cabe48146e554c696bf76a51
The nbnxn CPU pair-lists, and the non-bonded tasks can be unbalanced
over threads, especially for small systems. This change implements
pair-list rebalancing that result in near perfect load-balancing.
This increases the search cost by 3%, but this is outweighed by the
more balanced non-bonded kernel times.
Change-Id: I64e7395127faf193cabe48146e554c696bf76a51
| src/gromacs/mdlib/nbnxn_pairlist.h | diffblobblamehistory | |
| src/gromacs/mdlib/nbnxn_search.cpp | diffblobblamehistory |