1 #include "colls_private.h"
3 static int bcast_NTSL_segment_size_in_byte = 8192;
5 #define HEADER_SIZE 1024
8 /* Non-topology-specific pipelined linear-bcast function */
9 int smpi_coll_tuned_bcast_arrival_nb(void *buf, int count,
10 MPI_Datatype datatype, int root,
16 MPI_Request *send_request_array;
17 MPI_Request *recv_request_array;
18 MPI_Status *send_status_array;
19 MPI_Status *recv_status_array;
21 MPI_Status temp_status_array[MAX_NODE];
28 int flag_array[MAX_NODE];
29 int already_sent[MAX_NODE];
31 int header_buf[HEADER_SIZE];
32 char temp_buf[MAX_NODE];
35 extent = smpi_datatype_get_extent(datatype);
42 rank = smpi_comm_rank(MPI_COMM_WORLD);
43 size = smpi_comm_size(MPI_COMM_WORLD);
46 /* segment is segment size in number of elements (not bytes) */
47 int segment = bcast_NTSL_segment_size_in_byte / extent;
50 int pipe_length = count / segment;
52 /* use for buffer offset for sending and receiving data = segment size in byte */
53 int increment = segment * extent;
55 /* if the input size is not divisible by segment size =>
56 the small remainder will be done with native implementation */
57 int remainder = count % segment;
59 /* if root is not zero send to rank zero first
60 this can be modified to make it faster by using logical src, dst.
64 smpi_mpi_send(buf, count, datatype, 0, tag, comm);
65 } else if (rank == 0) {
66 smpi_mpi_recv(buf, count, datatype, root, tag, comm, &status);
70 /* value == 0 means root has not send data (or header) to the node yet */
71 for (i = 0; i < MAX_NODE; i++) {
76 /* when a message is smaller than a block size => no pipeline */
77 if (count <= segment) {
81 while (sent_count < (size - 1)) {
83 // for (j=0;j<1000;j++) {
84 for (i = 1; i < size; i++) {
85 if (already_sent[i] == 0)
86 smpi_mpi_iprobe(i, MPI_ANY_TAG, MPI_COMM_WORLD, &flag_array[i],
92 /* recv 1-byte message */
93 for (i = 1; i < size; i++) {
96 if ((flag_array[i] == 1) && (already_sent[i] == 0)) {
97 smpi_mpi_recv(temp_buf, 1, MPI_CHAR, i, tag, MPI_COMM_WORLD, &status);
98 header_buf[header_index] = i;
102 /* will send in the next step */
107 /* send header followed by data */
108 if (header_index != 0) {
109 header_buf[header_index] = -1;
111 smpi_mpi_send(header_buf, HEADER_SIZE, MPI_INT, to, tag, comm);
112 smpi_mpi_send(buf, count, datatype, to, tag, comm);
115 /* randomly MPI_Send to one */
117 /* search for the first node that never received data before */
118 for (i = 1; i < size; i++) {
119 if (already_sent[i] == 0) {
122 smpi_mpi_send(header_buf, HEADER_SIZE, MPI_INT, i, tag, comm);
123 smpi_mpi_send(buf, count, datatype, i, tag, comm);
138 /* send 1-byte message to root */
139 smpi_mpi_send(temp_buf, 1, MPI_CHAR, 0, tag, comm);
141 /* wait for header and data, forward when required */
142 smpi_mpi_recv(header_buf, HEADER_SIZE, MPI_INT, MPI_ANY_SOURCE, tag, comm,
144 smpi_mpi_recv(buf, count, datatype, MPI_ANY_SOURCE, tag, comm, &status);
146 /* search for where it is */
148 while (rank != header_buf[myordering]) {
152 /* send header followed by data */
153 if (header_buf[myordering + 1] != -1) {
154 smpi_mpi_send(header_buf, HEADER_SIZE, MPI_INT, header_buf[myordering + 1],
156 smpi_mpi_send(buf, count, datatype, header_buf[myordering + 1], tag, comm);
163 (MPI_Request *) xbt_malloc((size + pipe_length) * sizeof(MPI_Request));
165 (MPI_Request *) xbt_malloc((size + pipe_length) * sizeof(MPI_Request));
167 (MPI_Status *) xbt_malloc((size + pipe_length) * sizeof(MPI_Status));
169 (MPI_Status *) xbt_malloc((size + pipe_length) * sizeof(MPI_Status));
176 for (i = 0; i < 1000; i++)
178 while (sent_count < (size - 1)) {
180 //start = MPI_Wtime();
183 for (k = 0; k < 3; k++) {
184 for (i = 1; i < size; i++) {
185 if ((already_sent[i] == 0) && (will_send[i] == 0)) {
186 smpi_mpi_iprobe(i, MPI_ANY_TAG, MPI_COMM_WORLD, &flag_array[i],
187 &temp_status_array[i]);
188 if (flag_array[i] == 1) {
190 smpi_mpi_recv(&temp_buf[i], 1, MPI_CHAR, i, tag, MPI_COMM_WORLD,
198 //total = MPI_Wtime() - start;
200 //printf("Iprobe time = %.2f\n",total);
203 //start = MPI_Wtime();
204 /* recv 1-byte message */
205 for (i = 1; i < size; i++) {
207 if ((will_send[i] == 1) && (already_sent[i] == 0)) {
208 header_buf[header_index] = i;
212 /* will send in the next step */
216 //printf("sent_count = %d\n",sent_count);
219 //total = MPI_Wtime() - start;
221 //printf("Recv 1-byte time = %.2f\n",total);
224 if (header_index != 0) {
225 printf("header index = %d node = ",header_index);
226 for (i=0;i<header_index;i++) {
227 printf("%d ",header_buf[i]);
233 /* send header followed by data */
234 if (header_index != 0) {
235 header_buf[header_index] = -1;
238 //start = MPI_Wtime();
241 smpi_mpi_send(header_buf, HEADER_SIZE, MPI_INT, to, tag, comm);
243 //total = MPI_Wtime() - start;
245 //printf("\tSend header to %d time = %.2f\n",to,total);
247 //start = MPI_Wtime();
249 /* send data - non-pipeline case */
252 //if (header_index == 1) {
253 smpi_mpi_send(buf, count, datatype, to, tag, comm);
257 /* send data - pipeline */
259 for (i = 0; i < pipe_length; i++) {
260 smpi_mpi_send((char *)buf + (i * increment), segment, datatype, to, tag, comm);
262 //smpi_mpi_waitall((pipe_length), send_request_array, send_status_array);
264 //total = MPI_Wtime() - start;
266 //printf("\tSend data to %d time = %.2f\n",to,total);
272 /* randomly MPI_Send to one node */
274 /* search for the first node that never received data before */
275 for (i = 1; i < size; i++) {
276 if (already_sent[i] == 0) {
281 //start = MPI_Wtime();
282 smpi_mpi_send(header_buf, HEADER_SIZE, MPI_INT, to, tag, comm);
284 /* still need to chop data so that we can use the same non-root code */
285 for (j = 0; j < pipe_length; j++) {
286 smpi_mpi_send((char *)buf + (j * increment), segment, datatype, to, tag,
290 //smpi_mpi_send(buf,count,datatype,to,tag,comm);
291 //smpi_mpi_wait(&request,MPI_STATUS_IGNORE);
293 //total = MPI_Wtime() - start;
295 //printf("SEND TO SINGLE node %d time = %.2f\n",i,total);
307 //total = MPI_Wtime() - start2;
309 //printf("Node zero iter = %d time = %.2f\n",iteration,total);
311 /* probe before exit in case there are messages to recv */
312 for (i = 1; i < size; i++) {
313 smpi_mpi_iprobe(i, MPI_ANY_TAG, MPI_COMM_WORLD, &flag_array[i],
314 &temp_status_array[i]);
315 if (flag_array[i] == 1)
316 smpi_mpi_recv(&temp_buf[i], 1, MPI_CHAR, i, tag, MPI_COMM_WORLD, &status);
324 /* if root already send a message to this node, don't send one-byte message */
325 smpi_mpi_iprobe(0, MPI_ANY_TAG, MPI_COMM_WORLD, &flag_array[0], &status);
327 /* send 1-byte message to root */
328 if (flag_array[0] == 0)
329 smpi_mpi_send(temp_buf, 1, MPI_CHAR, 0, tag, comm);
331 /* wait for header forward when required */
332 request = smpi_mpi_irecv(header_buf, HEADER_SIZE, MPI_INT, MPI_ANY_SOURCE, tag, comm);
333 smpi_mpi_wait(&request, MPI_STATUS_IGNORE);
335 /* search for where it is */
337 while (rank != header_buf[myordering]) {
341 /* send header when required */
342 if (header_buf[myordering + 1] != -1) {
343 smpi_mpi_send(header_buf, HEADER_SIZE, MPI_INT, header_buf[myordering + 1],
350 //if (header_buf[1] == -1) {
351 request = smpi_mpi_irecv(buf, count, datatype, 0, tag, comm);
352 smpi_mpi_wait(&request, MPI_STATUS_IGNORE);
353 //printf("\t\tnode %d ordering = %d receive data from root\n",rank,myordering);
355 for (i = 0; i < pipe_length; i++) {
356 recv_request_array[i] = smpi_mpi_irecv((char *)buf + (i * increment), segment, datatype, MPI_ANY_SOURCE,
362 if (header_buf[myordering + 1] != -1) {
363 for (i = 0; i < pipe_length; i++) {
364 smpi_mpi_wait(&recv_request_array[i], MPI_STATUS_IGNORE);
365 send_request_array[i] = smpi_mpi_isend((char *)buf + (i * increment), segment, datatype,
366 header_buf[myordering + 1], tag, comm);
368 smpi_mpi_waitall((pipe_length), send_request_array, send_status_array);
373 free(send_request_array);
374 free(recv_request_array);
375 free(send_status_array);
376 free(recv_status_array);
379 /* when count is not divisible by block size, use default BCAST for the remainder */
380 if ((remainder != 0) && (count > segment)) {
381 XBT_WARN("MPI_bcast_arrival_nb use default MPI_bcast.");
382 smpi_mpi_bcast((char *)buf + (pipe_length * increment), remainder, datatype, root, comm);