1
1
This commit was SVN r19061.
Этот коммит содержится в:
Adrian Knoth 2008-07-28 13:33:08 +00:00
родитель 96a74c2d09
Коммит 5096512c3a
3 изменённых файлов: 3 добавлений и 3 удалений

Просмотреть файл

@ -106,7 +106,7 @@ common global key is ``{\tt cpu}''. This key takes an integer value
and indicates to Open MPI how many CPUs are available for Open MPI to use. If and indicates to Open MPI how many CPUs are available for Open MPI to use. If
the key is not present, the value of 1 is assumed. This number does the key is not present, the value of 1 is assumed. This number does
{\em not} need to reflect the physical number of CPUs -- it can be {\em not} need to reflect the physical number of CPUs -- it can be
smaller then, equal to, or greater than the number of physical CPUs in smaller than, equal to, or greater than the number of physical CPUs in
the machine. It is solely used as a shorthand notation for the machine. It is solely used as a shorthand notation for
\icmd{mpirun}'s ``C'' notation, meaning ``launch one process per CPU \icmd{mpirun}'s ``C'' notation, meaning ``launch one process per CPU
as specified in the boot schema file.'' For example, in the following as specified in the boot schema file.'' For example, in the following

Просмотреть файл

@ -497,7 +497,7 @@ OpenFabrics BTL will therefore be deactivated for this run.
# #
[non optimal rd_win] [non optimal rd_win]
WARNING: rd_win specification is non optimal. For maximum performance it is WARNING: rd_win specification is non optimal. For maximum performance it is
advisable to configure rd_win smaller then (rd_num - rd_low), but currently advisable to configure rd_win smaller than (rd_num - rd_low), but currently
rd_win = %d and (rd_num - rd_low) = %d. rd_win = %d and (rd_num - rd_low) = %d.
# #
[apm without lmc] [apm without lmc]

Просмотреть файл

@ -733,7 +733,7 @@ uint32_t opal_graph_dijkstra(opal_graph_t *graph, opal_graph_vertex_t *vertex, o
/** /**
* if the distance from the first vertex in the queue to the I * if the distance from the first vertex in the queue to the I
* vertex in the queue plus the distance of the first vertex in * vertex in the queue plus the distance of the first vertex in
* the queue from the referenced vertex is smaller then the * the queue from the referenced vertex is smaller than the
* distance of the I vertex from the referenced vertex, assign * distance of the I vertex from the referenced vertex, assign
* the lower distance to the I vertex. * the lower distance to the I vertex.
*/ */