The mappings generated by our models improve the BlueGene/L performance of several engineering applications by up to 22% compared to the standard approach.
The mappings generated by our models, reduced communication by 51% for 3D-mesh and 31% for 3D-torus over the default MPI rank order mapping.
for all with In this case, the sequence of mappings generated by is defined as follows: For.
In this paper, we define an iterative method to approximate a common fixed point of a -strict pseudocontraction and of two sequences of nonexpansive mappings generated by two sequences of firmly nonexpansive mappings and two nonlinear mappings.
For every n ∈ ℕ, we define the mapping S n : C → C as follows: This mapping is called S-mapping generated by T n,..., T1 and α n, αn-1,..., α1.
This mapping is called S-mapping generated by T1,..., T N and α1, α2,..., α N. Lemma 2.4.
This mapping is called S-mapping generated by T 1, T 2, …, T N and α 1, α 2, …, α N. Lemma 2.4 (See [18]).
This mapping is called S-mapping generated by T n, …, T 1 and α n, α n − 1, …, α 1. Lemma 2.13 [19].
This mapping is called S-mapping generated by T 1, T 2, …, T N and α 1, α 2, …, α N. Furthermore, they obtained the following important lemma.
Such a mapping W is called W-mapping generated by T 1, T 2, … and γ 1, γ 2, … .
Such a mapping S is called S-mapping generated by T n, Tn-1,... and α n, αn- 1,... Remark 2.11.
