Research Article
Analysis of a New MPI Process Distribution for the Weather Research and Forecasting (WRF) Model
Algorithm 2
New WRF process distribution algorithm and
implementation.
| Require: , , and | | (1) | function F implementation | | (2) | for to n do Iterate possible decrements | | (3) | | | (4) | | | (5) | if then | | (6) | break Nearest divisor below x has been found | | (7) | end if | | (8) | end for | | (9) | for to n do Iterate possible increments | | (10) | | | (11) | | | (12) | if then | | (13) | break Nearest divisor over x has been found | | (14) | end if | | (15) | end for | | (16) | if then Return the nearest to x | | (17) | return | | (18) | else | | (19) | return | | (20) | end if | | (21) | end function | | (22) | procedure DISTRIBUTE Distribution algorithm | | (23) | Get the first candidate | | (24) | Get the nearest divisor of n to x | | (25) | | | (26) | Distribute processes using the distribution | | (27) | end procedure |
|
