A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
| inline |
side by side
Avoid overflowing in the MPI_Prod version by using larger datatype
[simgrid.git]
/
teshsuite
/
smpi
/
coll-reduce
/
coll-reduce.c
diff --git
a/teshsuite/smpi/coll-reduce/coll-reduce.c
b/teshsuite/smpi/coll-reduce/coll-reduce.c
index
9b63466
..
b7da72a
100644
(file)
--- a/
teshsuite/smpi/coll-reduce/coll-reduce.c
+++ b/
teshsuite/smpi/coll-reduce/coll-reduce.c
@@
-19,16
+19,16
@@
int main(int argc, char *argv[])
{
int rank, size;
int i;
-
int
*sb;
-
int
*rb;
+
unsigned long long
*sb;
+
unsigned long long
*rb;
int status;
MPI_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &size);
- sb = (
int *) xbt_malloc(size * sizeof(int
));
- rb = (
int *) xbt_malloc(size * sizeof(int
));
+ sb = (
unsigned long long *) xbt_malloc(size * sizeof(unsigned long long
));
+ rb = (
unsigned long long *) xbt_malloc(size * sizeof(unsigned long long
));
for (i = 0; i < size; ++i) {
sb[i] = rank*size + i;
@@
-36,17
+36,17
@@
int main(int argc, char *argv[])
}
printf("[%d] sndbuf=[", rank);
for (i = 0; i < size; i++)
- printf("%
d
", sb[i]);
+ printf("%
llu
", sb[i]);
printf("]\n");
int root=0;
- status = MPI_Reduce(sb, rb, size, MPI_
INT
, MPI_SUM, root, MPI_COMM_WORLD);
+ status = MPI_Reduce(sb, rb, size, MPI_
UNSIGNED_LONG_LONG
, MPI_SUM, root, MPI_COMM_WORLD);
MPI_Barrier(MPI_COMM_WORLD);
if (rank == root) {
printf("[%d] rcvbuf=[", rank);
for (i = 0; i < size; i++)
- printf("%
d
", rb[i]);
+ printf("%
llu
", rb[i]);
printf("]\n");
if (status != MPI_SUCCESS) {
printf("all_to_all returned %d\n", status);
@@
-56,17
+56,17
@@
int main(int argc, char *argv[])
printf("[%d] second sndbuf=[", rank);
for (i = 0; i < 1; i++)
- printf("%
d
", sb[i]);
+ printf("%
llu
", sb[i]);
printf("]\n");
root=size-1;
- status = MPI_Reduce(sb, rb, 1, MPI_
INT
, MPI_PROD, root, MPI_COMM_WORLD);
+ status = MPI_Reduce(sb, rb, 1, MPI_
UNSIGNED_LONG_LONG
, MPI_PROD, root, MPI_COMM_WORLD);
MPI_Barrier(MPI_COMM_WORLD);
if (rank == root) {
printf("[%d] rcvbuf=[", rank);
for (i = 0; i < 1; i++)
- printf("%
d
", rb[i]);
+ printf("%
llu
", rb[i]);
printf("]\n");
if (status != MPI_SUCCESS) {
printf("all_to_all returned %d\n", status);