15 Compartmental Population Balances by Means of Monte Carlo Methods
539
Fig. 11 Intern merge
pattern. All merge attempts
which are executed in
parallel within one stream or
compartment with different
compare distances C dist
performed, in order to address situations, in which the populations in the streams
are so different from the population in the compartment, that a merging is only possible with very high merging errors. These ‘internal merges’ are shown in Fig. 11.
The multiplication of the compared distance C dist with the factor of 2, ensures the
treatment of different pairs after each invocation of the routine.
The complete algorithm for the parallel merging is shown in Fig. 12, the following
settings are set arbitrarily:
Fig. 12 Sketch of the merge algorithm for MC particle insertion. The Compartment-Stream merge
pattern is shown in Fig. 10 and the internal merge pattern is shown in Fig. 11
539
Fig. 11 Intern merge
pattern. All merge attempts
which are executed in
parallel within one stream or
compartment with different
compare distances C dist
performed, in order to address situations, in which the populations in the streams
are so different from the population in the compartment, that a merging is only possible with very high merging errors. These ‘internal merges’ are shown in Fig. 11.
The multiplication of the compared distance C dist with the factor of 2, ensures the
treatment of different pairs after each invocation of the routine.
The complete algorithm for the parallel merging is shown in Fig. 12, the following
settings are set arbitrarily:
Fig. 12 Sketch of the merge algorithm for MC particle insertion. The Compartment-Stream merge
pattern is shown in Fig. 10 and the internal merge pattern is shown in Fig. 11