model-net-mpi-replay.c 49.7 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
/*
 * Copyright (C) 2014 University of Chicago.
 * See COPYRIGHT notice in top-level directory.
 *
 */
#include <ross.h>
#include <inttypes.h>

#include "codes/codes-workload.h"
#include "codes/codes.h"
#include "codes/configuration.h"
#include "codes/codes_mapping.h"
#include "codes/model-net.h"
#include "codes/rc-stack.h"
#include "codes/quicklist.h"
16
#include "codes/codes-jobmap.h"
17

18
19
/* turning on track lp will generate a lot of output messages */
#define TRACK_LP -1
20
#define TRACE -1
21
#define MAX_WAIT_REQS 512
22
23
24
25
#define CS_LP_DBG 0
#define lprintf(_fmt, ...) \
        do {if (CS_LP_DBG) printf(_fmt, __VA_ARGS__);} while (0)
#define MAX_STATS 65536
26
27
28
29
30
31

char workload_type[128];
char workload_file[8192];
char offset_file[8192];
static int wrkld_id;
static int num_net_traces = 0;
32
static int alloc_spec = 0;
33
34
35
36
37
38
39

/* Doing LP IO*/
static char lp_io_dir[256] = {'\0'};
static lp_io_handle io_handle;
static unsigned int lp_io_use_suffix = 0;
static int do_lp_io = 0;

40
41
42
43
44
45
46
47
48
49
50
/* variables for loading multiple applications */
/* Xu's additions start */
char workloads_conf_file[8192];
char alloc_file[8192];
int num_traces_of_job[5];
char file_name_of_job[5][8192];

struct codes_jobmap_ctx *jobmap_ctx;
struct codes_jobmap_params_list jobmap_p;
/* Xu's additions end */

51
52
typedef struct nw_state nw_state;
typedef struct nw_message nw_message;
53
typedef int32_t dumpi_req_id;
54
55
56
57
58

static int net_id = 0;
static float noise = 5.0;
static int num_net_lps, num_nw_lps;

59
60
61
62
63
FILE * workload_log = NULL;
FILE * workload_agg_log = NULL;
FILE * workload_meta_log = NULL;

static uint64_t sample_bytes_written = 0;
64

65
66
67
68
69
70
71
72
73
74
75
76
long long num_bytes_sent=0;
long long num_bytes_recvd=0;

double max_time = 0,  max_comm_time = 0, max_wait_time = 0, max_send_time = 0, max_recv_time = 0;
double avg_time = 0, avg_comm_time = 0, avg_wait_time = 0, avg_send_time = 0, avg_recv_time = 0;

/* global variables for codes mapping */
static char lp_group_name[MAX_NAME_LENGTH], lp_type_name[MAX_NAME_LENGTH], annotation[MAX_NAME_LENGTH];
static int mapping_grp_id, mapping_type_id, mapping_rep_id, mapping_offset;

/* runtime option for disabling computation time simulation */
static int disable_delay = 0;
77
78
79
static int enable_sampling = 0;
static double sampling_interval = 5000000;
static double sampling_end_time = 3000000000;
80
static int enable_debug = 1;
81
82
83
84
85
86
87
88
89
90
91
92

/* MPI_OP_GET_NEXT is for getting next MPI operation when the previous operation completes.
* MPI_SEND_ARRIVED is issued when a MPI message arrives at its destination (the message is transported by model-net and an event is invoked when it arrives. 
* MPI_SEND_POSTED is issued when a MPI message has left the source LP (message is transported via model-net). */
enum MPI_NW_EVENTS
{
	MPI_OP_GET_NEXT=1,
	MPI_SEND_ARRIVED,
    MPI_SEND_ARRIVED_CB, // for tracking message times on sender
	MPI_SEND_POSTED,
};

93
94
95
96
struct mpi_workload_sample
{
    /* Sampling data */
    int nw_id;
97
    int app_id;
98
99
100
101
102
    unsigned long num_sends_sample;
    unsigned long num_bytes_sample;
    unsigned long num_waits_sample;
    double sample_end_time;
};
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
/* stores pointers of pending MPI operations to be matched with their respective sends/receives. */
struct mpi_msgs_queue
{
    int op_type;
    int tag;
    int source_rank;
    int dest_rank;
    int num_bytes;
    tw_stime req_init_time;
	dumpi_req_id req_id;
    struct qlist_head ql;
};

/* stores request IDs of completed MPI operations (Isends or Irecvs) */
struct completed_requests
{
	dumpi_req_id req_id;
    struct qlist_head ql;
};

/* for wait operations, store the pending operation and number of completed waits so far. */
struct pending_waits
{
    int op_type;
127
    int32_t req_ids[MAX_WAIT_REQS];
128
	int num_completed;
129
130
	int count;
    tw_stime start_time;
131
132
133
134
135
136
137
138
139
140
141
142
143
    struct qlist_head ql;
};

typedef struct mpi_msgs_queue mpi_msgs_queue;
typedef struct completed_requests completed_requests;
typedef struct pending_waits pending_waits;

/* state of the network LP. It contains the pointers to send/receive lists */
struct nw_state
{
	long num_events_per_lp;
	tw_lpid nw_id;
	short wrkld_end;
144
145
    int app_id;
    int local_rank;
146
147

    struct rc_stack * processed_ops;
148
    struct rc_stack * matched_reqs;
149
150
151
152
153
154
155
156
157
158

    /* count of sends, receives, collectives and delays */
	unsigned long num_sends;
	unsigned long num_recvs;
	unsigned long num_cols;
	unsigned long num_delays;
	unsigned long num_wait;
	unsigned long num_waitall;
	unsigned long num_waitsome;

159

160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
	/* time spent by the LP in executing the app trace*/
	double start_time;
	double elapsed_time;
	/* time spent in compute operations */
	double compute_time;
	/* time spent in message send/isend */
	double send_time;
	/* time spent in message receive */
	double recv_time;
	/* time spent in wait operation */
	double wait_time;
	/* FIFO for isend messages arrived on destination */
	struct qlist_head arrival_queue;
	/* FIFO for irecv messages posted but not yet matched with send operations */
	struct qlist_head pending_recvs_queue;
	/* List of completed send/receive requests */
	struct qlist_head completed_reqs;
177

178
179
    tw_stime cur_interval_end;

180
181
    /* Pending wait operation */
    struct pending_waits * wait_op;
182
183
184
185

    unsigned long num_bytes_sent;
    unsigned long num_bytes_recvd;

186
187
188
189
    /* For sampling data */
    int sampling_indx;
    int max_arr_size;
    struct mpi_workload_sample * mpi_wkld_samples;
190
    char output_buf[512];
191
192
193
194
195
196
197
198
};

/* data for handling reverse computation.
* saved_matched_req holds the request ID of matched receives/sends for wait operations.
* ptr_match_op holds the matched MPI operation which are removed from the queues when a send is matched with the receive in forward event handler. 
* network event being sent. op is the MPI operation issued by the network workloads API. rv_data holds the data for reverse computation (TODO: Fill this data structure only when the simulation runs in optimistic mode). */
struct nw_message
{
199
   // forward message handler 
200
   int msg_type;
201
202
   int op_type;
   
203
204
205
206
207
208
209
210
211
212
213
214
   struct
   {
       tw_lpid src_rank;
       tw_lpid dest_rank;
       int num_bytes;
       int num_matched;
       int data_type;
       double sim_start_time;
       // for callbacks - time message was received
       double msg_send_time;
       int16_t req_id;   
       int tag;
215
       int app_id;
216
217
218
219
220
221
222
223
224
225
       int found_match;
       short wait_completed;
   } fwd;
   struct
   {
       double saved_send_time;
       double saved_recv_time;
       double saved_wait_time;
       double saved_delay;
       int saved_num_bytes;
226
       struct codes_workload_op * saved_op;
227
   } rc;
228
229
230
231
};

/* executes MPI isend and send operations */
static void codes_exec_mpi_send(
232
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op);
233
234
/* execute MPI irecv operation */
static void codes_exec_mpi_recv(
235
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp, struct codes_workload_op * mpi_op);
236
237
/* reverse of mpi recv function. */
static void codes_exec_mpi_recv_rc(
238
        nw_state* s, tw_bf * bf, nw_message* m, tw_lp* lp);
239
240
/* execute the computational delay */
static void codes_exec_comp_delay(
241
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op);
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
/* gets the next MPI operation from the network-workloads API. */
static void get_next_mpi_operation(
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp);
/* reverse handler of get next mpi operation. */
static void get_next_mpi_operation_rc(
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp);
/* Makes a call to get_next_mpi_operation. */
static void codes_issue_next_event(tw_lp* lp);
/* reverse handler of next operation */
static void codes_issue_next_event_rc(tw_lp* lp);


///////////////////// HELPER FUNCTIONS FOR MPI MESSAGE QUEUE HANDLING ///////////////
/* upon arrival of local completion message, inserts operation in completed send queue */
/* upon arrival of an isend operation, updates the arrival queue of the network */
257
258
259
260
261
262
263
264
static void update_completed_queue(
        nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp, dumpi_req_id req_id);
/* reverse of the above function */
static void update_completed_queue_rc(
        nw_state*s,
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp);
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
static void update_arrival_queue(
        nw_state*s, tw_bf* bf, nw_message* m, tw_lp * lp);
/* reverse of the above function */
static void update_arrival_queue_rc(
        nw_state*s, tw_bf* bf, nw_message* m, tw_lp * lp);
/* callback to a message sender for computing message time */
static void update_message_time(
        nw_state*s, tw_bf* bf, nw_message* m, tw_lp * lp);
/* reverse for computing message time */
static void update_message_time_rc(
        nw_state*s, tw_bf* bf, nw_message* m, tw_lp * lp);

/* conversion from seconds to eanaoseconds */
static tw_stime s_to_ns(tw_stime ns);

280
/* Debugging functions, may generate unused function warning */
281
static void print_waiting_reqs(int32_t * reqs, int count)
282
283
284
285
{
    printf("\n Waiting reqs: ");
    int i;
    for(i = 0; i < count; i++ )
286
        printf(" %d ", reqs[i]);
287
288
289
290
291
292
293
294
295
}
static void print_completed_queue(struct qlist_head * head)
{
    printf("\n Completed queue: ");
      struct qlist_head * ent = NULL;
      struct completed_requests* current = NULL;
      qlist_for_each(ent, head)
       {
            current = qlist_entry(ent, completed_requests, ql);
296
            printf(" %d ", current->req_id);
297
298
       }
}
299
static int clear_completed_reqs(nw_state * s,
300
        tw_lp * lp,
301
        int32_t * reqs, int count)
302
{
303
    int i, matched = 0;
304
305
306
307
308
309
310
311
312
    for( i = 0; i < count; i++)
    {
      struct qlist_head * ent = NULL;
      qlist_for_each(ent, &s->completed_reqs)
       {
            struct completed_requests* current = 
                qlist_entry(ent, completed_requests, ql);
            if(current->req_id == reqs[i])
            {
313
                ++matched;
314
315
316
317
318
                qlist_del(&current->ql);
                rc_stack_push(lp, current, free, s->matched_reqs);
            }
       }
    }
319
    return matched;
320
321
}
static void add_completed_reqs(nw_state * s, 
322
323
        tw_lp * lp,
        int count)
324
325
326
327
328
329
330
331
{
    int i;
    for( i = 0; i < count; i++)
    {
       struct completed_requests * req = rc_stack_pop(s->matched_reqs); 
       qlist_add(&req->ql, &s->completed_reqs); 
    }
}
332

333
334
335
336
337
338
/* helper function - maps an MPI rank to an LP id */
static tw_lpid rank_to_lpid(int rank)
{
    return codes_mapping_get_lpid_from_relative(rank, NULL, "nw-lp", NULL, 0);
}

339
340
341
static int notify_posted_wait(nw_state* s,
        tw_bf * bf, nw_message * m, tw_lp * lp, 
        dumpi_req_id completed_req)
342
{
343
344
    struct pending_waits* wait_elem = s->wait_op;
    int wait_completed = 0;
345

346
347
    m->fwd.wait_completed = 0;
    
348
349
    if(!wait_elem)
        return 0;
350
    
351
    int op_type = wait_elem->op_type;
352

353
354
355
356
357
358
359
360
361
362
363
364
365
    if(op_type == CODES_WK_WAIT &&
            (wait_elem->req_ids[0] == completed_req))
    {
            wait_completed = 1;
    }
    else if(op_type == CODES_WK_WAITALL 
            || op_type == CODES_WK_WAITANY 
            || op_type == CODES_WK_WAITSOME)
    {
        int i;
        for(i = 0; i < wait_elem->count; i++)
        {
            if(wait_elem->req_ids[i] == completed_req)
366
            {
367
                wait_elem->num_completed++;
368
                if(wait_elem->num_completed > wait_elem->count)
369
                    printf("\n Num completed %d count %d LP %llu ",
370
371
372
                            wait_elem->num_completed,
                            wait_elem->count,
                            lp->gid);
373
374
                assert(wait_elem->num_completed <= wait_elem->count);
                if(wait_elem->num_completed == wait_elem->count)
375
                {
376
377
                    if(enable_debug)
                        fprintf(workload_log, "\n(%lf) APP ID %d MPI WAITALL COMPLETED AT %ld ", s->app_id, tw_now(lp), s->nw_id);
378
                    wait_completed = 1;
379
                }
380
           
381
                m->fwd.wait_completed = 1;
382
            }
383
        }
384
    }
385
    return wait_completed;
386
}
387

388
/* reverse handler of MPI wait operation */
389
static void codes_exec_mpi_wait_rc(nw_state* s, tw_lp* lp)
390
{
391
    if(s->wait_op)
392
     {
393
394
395
         struct pending_waits * wait_op = s->wait_op;
         free(wait_op);
         s->wait_op = NULL;
396
397
398
399
     }
   else
    {
        codes_issue_next_event_rc(lp);
400
        completed_requests * qi = rc_stack_pop(s->processed_ops);
401
        qlist_add(&qi->ql, &s->completed_reqs);
402
    }
403
    return;
404
}
405

406
/* execute MPI wait operation */
407
static void codes_exec_mpi_wait(nw_state* s, tw_lp* lp, struct codes_workload_op * mpi_op)
408
{
409
410
    /* check in the completed receives queue if the request ID has already been completed.*/
    assert(!s->wait_op);
411
    dumpi_req_id req_id = mpi_op->u.wait.req_id;
412
    struct completed_requests* current = NULL;
413

414
415
416
417
418
419
420
    struct qlist_head * ent = NULL;
    qlist_for_each(ent, &s->completed_reqs)
    {
        current = qlist_entry(ent, completed_requests, ql);
        if(current->req_id == req_id)
        {
            qlist_del(&current->ql);
421
            rc_stack_push(lp, current, free, s->processed_ops);
422
423
424
425
            codes_issue_next_event(lp);
            return;
        }
    }
426
427
428
429
430
    /* If not, add the wait operation in the pending 'waits' list. */
    struct pending_waits* wait_op = malloc(sizeof(struct pending_waits));
    wait_op->op_type = mpi_op->op_type;
    wait_op->req_ids[0] = req_id;
    wait_op->count = 1;
431
432
    wait_op->num_completed = 0;
    wait_op->start_time = tw_now(lp);
433
    s->wait_op = wait_op;
434

435
    return;
436
437
}

438
439
440
441
static void codes_exec_mpi_wait_all_rc(
        nw_state* s, 
        tw_bf * bf,
        nw_message * m,
442
        tw_lp* lp)
443
{
444
445
446
447
448
449
450
451
452
453
454
  if(bf->c1)
  {
    int sampling_indx = s->sampling_indx;
    s->mpi_wkld_samples[sampling_indx].num_waits_sample--;

    if(bf->c2)
    {
        s->cur_interval_end -= sampling_interval;
        s->sampling_indx--;
    }
  }
455
456
457
458
459
460
461
462
  if(s->wait_op)
  {
      struct pending_waits * wait_op = s->wait_op;
      free(wait_op);
      s->wait_op = NULL;
  }
  else
  {
463
      add_completed_reqs(s, lp, m->fwd.num_matched);
464
465
466
      codes_issue_next_event_rc(lp);
  }
  return;
467
468
}
static void codes_exec_mpi_wait_all(
469
470
471
472
473
        nw_state* s, 
        tw_bf * bf,
        nw_message * m,
        tw_lp* lp, 
        struct codes_workload_op * mpi_op)
474
{
475
476
477
  if(enable_debug)
    fprintf(workload_log, "\n MPI WAITALL POSTED AT %ld ", s->nw_id);
  
478
479
480
481
482
483
484
485
  if(enable_sampling)
  {
    bf->c1 = 1;
    if(tw_now(lp) >= s->cur_interval_end)
    {
        bf->c2 = 1;
        int indx = s->sampling_indx;
        s->mpi_wkld_samples[indx].nw_id = s->nw_id;
486
        s->mpi_wkld_samples[indx].app_id = s->app_id;
487
488
489
490
491
492
        s->mpi_wkld_samples[indx].sample_end_time = s->cur_interval_end;
        s->cur_interval_end += sampling_interval;
        s->sampling_indx++;
    }
    if(s->sampling_indx >= MAX_STATS)
    {
493
        struct mpi_workload_sample * tmp = calloc((MAX_STATS + s->max_arr_size), sizeof(struct mpi_workload_sample));
494
495
496
497
498
499
500
501
        memcpy(tmp, s->mpi_wkld_samples, s->sampling_indx);
        free(s->mpi_wkld_samples);
        s->mpi_wkld_samples = tmp;
        s->max_arr_size += MAX_STATS;
    }
    int indx = s->sampling_indx;
    s->mpi_wkld_samples[indx].num_waits_sample++;
  }
502
  int count = mpi_op->u.waits.count;
503
504
  /* If the count is not less than max wait reqs then stop */
  assert(count < MAX_WAIT_REQS);
505

506
  int i = 0, num_matched = 0;
507
  m->fwd.num_matched = 0;
508

509
  /*if(lp->gid == TRACK)
510
  {
511
      printf("\n MPI Wait all posted ");
512
513
      print_waiting_reqs(mpi_op->u.waits.req_ids, count);
      print_completed_queue(&s->completed_reqs);
514
  }*/
515
516
517
518
519
520
521
522
523
524
525
526
527
      /* check number of completed irecvs in the completion queue */ 
  for(i = 0; i < count; i++)
  {
      dumpi_req_id req_id = mpi_op->u.waits.req_ids[i];
      struct qlist_head * ent = NULL;
      struct completed_requests* current = NULL;
      qlist_for_each(ent, &s->completed_reqs)
       {
            current = qlist_entry(ent, completed_requests, ql);
            if(current->req_id == req_id)
                num_matched++;
       }
  }
528

529
  m->fwd.found_match = num_matched;
530
531
532
533
  if(num_matched == count)
  {
    /* No need to post a MPI Wait all then, issue next event */
      /* Remove all completed requests from the list */
534
535
536
      m->fwd.num_matched = clear_completed_reqs(s, lp, mpi_op->u.waits.req_ids, count);
      struct pending_waits* wait_op = s->wait_op;
      free(wait_op);
537
538
      s->wait_op = NULL;
      codes_issue_next_event(lp);
539
540
  }
  else
541
542
543
544
545
546
547
548
549
550
551
  {
      /* If not, add the wait operation in the pending 'waits' list. */
	  struct pending_waits* wait_op = malloc(sizeof(struct pending_waits));
	  wait_op->count = count;
      wait_op->op_type = mpi_op->op_type;
      assert(count < MAX_WAIT_REQS);

      for(i = 0; i < count; i++)
          wait_op->req_ids[i] =  mpi_op->u.waits.req_ids[i];

	  wait_op->num_completed = num_matched;
552
	  wait_op->start_time = tw_now(lp);
553
      s->wait_op = wait_op;
554
  }
555
556
  return;
}
557
558
559
560

/* search for a matching mpi operation and remove it from the list. 
 * Record the index in the list from where the element got deleted. 
 * Index is used for inserting the element once again in the queue for reverse computation. */
561
562
563
564
565
static int rm_matching_rcv(nw_state * ns, 
        tw_bf * bf,
        nw_message * m, 
        tw_lp * lp, 
        mpi_msgs_queue * qitem)
566
567
{
    int matched = 0;
568
    int index = 0;
569
570
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;
571

572
573
    qlist_for_each(ent, &ns->pending_recvs_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
574
        if((qi->num_bytes == qitem->num_bytes)
575
576
                && ((qi->tag == qitem->tag) || qi->tag == -1)
                && ((qi->source_rank == qitem->source_rank) || qi->source_rank == -1))
577
578
579
580
        {
            matched = 1;
            break;
        }
581
        ++index;
582
583
584
585
    }
    
    if(matched)
    {
586
        m->rc.saved_recv_time = ns->recv_time;
587
        ns->recv_time += (tw_now(lp) - qi->req_init_time);
588
589
590
        
        if(qi->op_type == CODES_WK_IRECV)
            update_completed_queue(ns, bf, m, lp, qi->req_id);
591
        
592
        qlist_del(&qi->ql);
593
594
        
        rc_stack_push(lp, qi, free, ns->processed_ops);
595
        return index;
596
597
598
599
    }
    return -1;
}

600
601
602
603
static int rm_matching_send(nw_state * ns, 
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp, mpi_msgs_queue * qitem)
604
605
606
607
608
{
    int matched = 0;
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;

609
    int index = 0;
610
611
    qlist_for_each(ent, &ns->arrival_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
612
        if((qi->num_bytes == qitem->num_bytes) 
613
614
615
616
617
618
                && (qi->tag == qitem->tag || qitem->tag == -1)
                && ((qi->source_rank == qitem->source_rank) || qitem->source_rank == -1))
        {
            matched = 1;
            break;
        }
619
        ++index;
620
621
622
623
    }

    if(matched)
    {
624
        m->rc.saved_recv_time = ns->recv_time;
625
626
627
628
629
        ns->recv_time += (tw_now(lp) - qitem->req_init_time);

        if(qitem->op_type == CODES_WK_IRECV)
            update_completed_queue(ns, bf, m, lp, qitem->req_id);

630
        qlist_del(&qi->ql);
631

632
        return index;
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
    }
    return -1;
}
static void codes_issue_next_event_rc(tw_lp * lp)
{
	    tw_rand_reverse_unif(lp->rng);	
}

/* Trigger getting next event at LP */
static void codes_issue_next_event(tw_lp* lp)
{
   tw_event *e;
   nw_message* msg;

   tw_stime ts;

   ts = g_tw_lookahead + 0.1 + tw_rand_exponential(lp->rng, noise);
   e = tw_event_new( lp->gid, ts, lp );
   msg = tw_event_data(e);

   msg->msg_type = MPI_OP_GET_NEXT;
   tw_event_send(e);
}

/* Simulate delays between MPI operations */
static void codes_exec_comp_delay(
659
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op)
660
661
662
663
664
{
	tw_event* e;
	tw_stime ts;
	nw_message* msg;

665
    m->rc.saved_delay = s->compute_time;
666
667
    s->compute_time += s_to_ns(mpi_op->u.delay.seconds);
    ts = s_to_ns(mpi_op->u.delay.seconds);
668
669
670
671
672
673
674
675
676
677
678

	ts += g_tw_lookahead + 0.1 + tw_rand_exponential(lp->rng, noise);
	
	e = tw_event_new( lp->gid, ts , lp );
	msg = tw_event_data(e);
	msg->msg_type = MPI_OP_GET_NEXT;
	tw_event_send(e); 
                
}

/* reverse computation operation for MPI irecv */
679
680
681
682
static void codes_exec_mpi_recv_rc(
        nw_state* ns, 
        tw_bf * bf, 
        nw_message* m, 
683
        tw_lp* lp)
684
{
685
	num_bytes_recvd -= m->rc.saved_num_bytes;
686
687
	ns->recv_time = m->rc.saved_recv_time;
	if(m->fwd.found_match >= 0)
688
	  {
689
		ns->recv_time = m->rc.saved_recv_time;
690
        int queue_count = qlist_count(&ns->arrival_queue); 
691
        
692
        mpi_msgs_queue * qi = rc_stack_pop(ns->processed_ops);	
693
       
694
        if(!m->fwd.found_match)
695
696
697
        {
            qlist_add(&qi->ql, &ns->arrival_queue);
        }
698
        else if(m->fwd.found_match >= queue_count)
699
700
701
        {
            qlist_add_tail(&qi->ql, &ns->arrival_queue);
        }
702
        else if(m->fwd.found_match > 0 && m->fwd.found_match < queue_count) 
703
        {
704
705
706
707
            int index = 1;
            struct qlist_head * ent = NULL;
            qlist_for_each(ent, &ns->arrival_queue)
            {
708
               if(index == m->fwd.found_match)
709
710
711
712
713
714
               {
                 qlist_add(&qi->ql, ent);
                 break;
               }
               index++; 
            }
715
        }
716
        if(qi->op_type == CODES_WK_IRECV)
717
        {
718
            update_completed_queue_rc(ns, bf, m, lp);
719
        }
720
721
        codes_issue_next_event_rc(lp);
      }
722
	else if(m->fwd.found_match < 0)
723
	    {
724
725
726
727
            struct qlist_head * ent = qlist_pop_back(&ns->pending_recvs_queue); 
            mpi_msgs_queue * qi = qlist_entry(ent, mpi_msgs_queue, ql);
            free(qi);
            
728
            if(m->op_type == CODES_WK_IRECV)
729
                codes_issue_next_event_rc(lp);
730
731
732
733
	    }
}

/* Execute MPI Irecv operation (non-blocking receive) */ 
734
735
736
737
738
739
static void codes_exec_mpi_recv(
        nw_state* s, 
        tw_bf * bf,
        nw_message * m, 
        tw_lp* lp, 
        struct codes_workload_op * mpi_op)
740
741
742
743
744
{
/* Once an irecv is posted, list of completed sends is checked to find a matching isend.
   If no matching isend is found, the receive operation is queued in the pending queue of
   receive operations. */

745
	m->rc.saved_recv_time = s->recv_time;
746
747
    m->rc.saved_num_bytes = mpi_op->u.recv.num_bytes;

748
749
750
751
752
753
754
755
756
757
758
	num_bytes_recvd += mpi_op->u.recv.num_bytes;

    mpi_msgs_queue * recv_op = (mpi_msgs_queue*) malloc(sizeof(mpi_msgs_queue));
    recv_op->req_init_time = tw_now(lp);
    recv_op->op_type = mpi_op->op_type;
    recv_op->source_rank = mpi_op->u.recv.source_rank;
    recv_op->dest_rank = mpi_op->u.recv.dest_rank;
    recv_op->num_bytes = mpi_op->u.recv.num_bytes;
    recv_op->tag = mpi_op->u.recv.tag;
    recv_op->req_id = mpi_op->u.recv.req_id;

759
760
761
762
    if(s->nw_id == TRACK_LP)
        printf("\n Receive op posted num bytes %d source %d ", recv_op->num_bytes,
                recv_op->source_rank);

763
	int found_matching_sends = rm_matching_send(s, bf, m, lp, recv_op);
764
765
766
767

	/* save the req id inserted in the completed queue for reverse computation. */
	if(found_matching_sends < 0)
	  {
768
	   	  m->fwd.found_match = -1;
769
          qlist_add_tail(&recv_op->ql, &s->pending_recvs_queue);
770
771
772
773
774
775
776
	
	       /* for mpi irecvs, this is a non-blocking receive so just post it and move on with the trace read. */
		if(mpi_op->op_type == CODES_WK_IRECV)
		   {
			codes_issue_next_event(lp);	
			return;
		   }
777
      }
778
779
	else
	  {
780
        m->fwd.found_match = found_matching_sends;
781
        codes_issue_next_event(lp); 
782
783
	    rc_stack_push(lp, recv_op, free, s->processed_ops);
      }
784
785
}

786
787
788
789
790
791
792
793
int get_global_id_of_job_rank(tw_lpid job_rank, int app_id)
{
    struct codes_jobmap_id lid;
    lid.job = app_id;
    lid.rank = job_rank;
    int global_rank = codes_jobmap_to_global_id(lid, jobmap_ctx);
    return global_rank;
}
794
/* executes MPI send and isend operations */
795
796
797
798
799
static void codes_exec_mpi_send(nw_state* s, 
        tw_bf * bf,
        nw_message * m,
        tw_lp* lp, 
        struct codes_workload_op * mpi_op)
800
{
801
802
803
804
805
806
807
808
	/* model-net event */
    int global_dest_rank = mpi_op->u.send.dest_rank;
    
    if(alloc_spec)
    {
        global_dest_rank = get_global_id_of_job_rank(mpi_op->u.send.dest_rank, s->app_id);
    }

809
    m->rc.saved_num_bytes = mpi_op->u.send.num_bytes;
810
811
812
813
814
815
816
817
	/* model-net event */
	tw_lpid dest_rank;
	codes_mapping_get_lp_info(lp->gid, lp_group_name, &mapping_grp_id, 
	    lp_type_name, &mapping_type_id, annotation, &mapping_rep_id, &mapping_offset);

	if(net_id == DRAGONFLY) /* special handling for the dragonfly case */
	{
		int num_routers, lps_per_rep, factor;
818
819
		num_routers = codes_mapping_get_lp_count(lp_group_name, 1,
                  "modelnet_dragonfly_router", NULL, 1);
820
	 	lps_per_rep = (2 * num_nw_lps) + num_routers;	
821
822
		factor = global_dest_rank / num_nw_lps;
		dest_rank = (lps_per_rep * factor) + (global_dest_rank % num_nw_lps);	
823
824
825
826
827
	}
	else
	{
		/* other cases like torus/simplenet/loggp etc. */
		codes_mapping_get_lp_id(lp_group_name, lp_type_name, NULL, 1,  
828
	    	  global_dest_rank, mapping_offset, &dest_rank);
829
830
831
	}

	num_bytes_sent += mpi_op->u.send.num_bytes;
832
    s->num_bytes_sent += mpi_op->u.send.num_bytes;
833

834
835
836
837
838
839
840
    if(enable_sampling)
    {
        if(tw_now(lp) >= s->cur_interval_end)
        {
            bf->c1 = 1;
            int indx = s->sampling_indx;
            s->mpi_wkld_samples[indx].nw_id = s->nw_id;
841
            s->mpi_wkld_samples[indx].app_id = s->app_id;
842
843
844
845
846
847
            s->mpi_wkld_samples[indx].sample_end_time = s->cur_interval_end;
            s->sampling_indx++;
            s->cur_interval_end += sampling_interval; 
        }
        if(s->sampling_indx >= MAX_STATS)
        {
848
            struct mpi_workload_sample * tmp = calloc((MAX_STATS + s->max_arr_size), sizeof(struct mpi_workload_sample));
849
850
851
852
853
854
855
856
857
            memcpy(tmp, s->mpi_wkld_samples, s->sampling_indx);
            free(s->mpi_wkld_samples);
            s->mpi_wkld_samples = tmp;
            s->max_arr_size += MAX_STATS;
        }
        int indx = s->sampling_indx;
        s->mpi_wkld_samples[indx].num_sends_sample++;
        s->mpi_wkld_samples[indx].num_bytes_sample += mpi_op->u.send.num_bytes;
    }
858
859
860
	nw_message local_m;
	nw_message remote_m;

861
862
863
    local_m.fwd.sim_start_time = tw_now(lp);
    local_m.fwd.dest_rank = mpi_op->u.send.dest_rank;
    local_m.fwd.src_rank = mpi_op->u.send.source_rank;
864
    local_m.op_type = mpi_op->op_type; 
865
    local_m.msg_type = MPI_SEND_POSTED;
866
867
868
    local_m.fwd.tag = mpi_op->u.send.tag;
    local_m.fwd.num_bytes = mpi_op->u.send.num_bytes;
    local_m.fwd.req_id = mpi_op->u.send.req_id;
869
    local_m.fwd.app_id = s->app_id;
870
871
872
873
874
875
876

    remote_m = local_m;
	remote_m.msg_type = MPI_SEND_ARRIVED;

	model_net_event(net_id, "test", dest_rank, mpi_op->u.send.num_bytes, 0.0, 
	    sizeof(nw_message), (const void*)&remote_m, sizeof(nw_message), (const void*)&local_m, lp);

877
878
879
880
881
882
883
884
885
886
887
    if(enable_debug)
    {
        if(mpi_op->op_type == CODES_WK_ISEND)
        {
            fprintf(workload_log, "\n (%lf) APP %d MPI ISEND SOURCE %ld DEST %ld BYTES %ld ", 
                    tw_now(lp), s->app_id, s->nw_id, mpi_op->u.send.dest_rank, mpi_op->u.send.num_bytes);
        }
        else
            fprintf(workload_log, "\n (%lf) APP ID %d MPI SEND SOURCE %ld DEST %ld BYTES %ld ", 
                    tw_now(lp), s->app_id, s->nw_id, mpi_op->u.send.dest_rank, mpi_op->u.send.num_bytes);
        }
888
889
890
891
892
893
894
895
896
897
898
	/* isend executed, now get next MPI operation from the queue */ 
	if(mpi_op->op_type == CODES_WK_ISEND)
	   codes_issue_next_event(lp);
}

/* convert seconds to ns */
static tw_stime s_to_ns(tw_stime ns)
{
    return(ns * (1000.0 * 1000.0 * 1000.0));
}

899
900
static void update_completed_queue_rc(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
901
   
902
903
904
    if(bf->c0)
    {
       struct qlist_head * ent = qlist_pop_back(&s->completed_reqs);
905
906
907
908
909
910
911

        completed_requests * req = qlist_entry(ent, completed_requests, ql);
      /*if(lp->gid == TRACK)
      {
          printf("\n After popping %ld ", req->req_id);
        print_completed_queue(&s->completed_reqs);
      }*/
912
913
914
915
       free(req);
    }
    else if(bf->c1)
    {
916
       struct pending_waits* wait_elem = rc_stack_pop(s->processed_ops); 
917
       s->wait_op = wait_elem;
918
919
       s->wait_time = m->rc.saved_wait_time;
       add_completed_reqs(s, lp, m->fwd.num_matched);
920
921
       codes_issue_next_event_rc(lp); 
    }
922
923
    if(m->fwd.wait_completed > 0)
           s->wait_op->num_completed--;
924
925
926
927
928
929
930
931
932
933
}

static void update_completed_queue(nw_state* s, 
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp,
        dumpi_req_id req_id)
{
    bf->c0 = 0;
    bf->c1 = 0;
934
    m->fwd.num_matched = 0; 
935

936
937
    int waiting = 0;
    waiting = notify_posted_wait(s, bf, m, lp, req_id);
938
939
940
941
942
943
944
 
    if(!waiting)
    {
        bf->c0 = 1;
        completed_requests * req = malloc(sizeof(completed_requests));
        req->req_id = req_id;
        qlist_add_tail(&req->ql, &s->completed_reqs);
945
946
947
948
949
950
       
        /*if(lp->gid == TRACK)
        {
            printf("\n Forward mode adding %ld ", req_id);
            print_completed_queue(&s->completed_reqs);
        }*/
951
952
953
954
    }
    else 
     {
            bf->c1 = 1;
955
956
            m->fwd.num_matched = clear_completed_reqs(s, lp, s->wait_op->req_ids, s->wait_op->count);
            m->rc.saved_wait_time = s->wait_time;
957
            s->wait_time += (tw_now(lp) - s->wait_op->start_time);  
958
959
960

            struct pending_waits* wait_elem = s->wait_op;
            rc_stack_push(lp, wait_elem, free, s->processed_ops);
961
962
963
964
965
            s->wait_op = NULL;
            codes_issue_next_event(lp); 
     }
}

966
/* reverse handler for updating arrival queue function */
967
968
969
static void update_arrival_queue_rc(nw_state* s, 
        tw_bf * bf, 
        nw_message * m, tw_lp * lp)
970
{
971
	s->recv_time = m->rc.saved_recv_time;
972
973
    s->num_bytes_recvd -= m->fwd.num_bytes;

974
    codes_local_latency_reverse(lp);
975
  
976
    if(m->fwd.found_match >= 0)
977
	{
978
        mpi_msgs_queue * qi = rc_stack_pop(s->processed_ops);
979
980
        int queue_count = qlist_count(&s->pending_recvs_queue); 

981
        if(!m->fwd.found_match)
982
983
984
        {
            qlist_add(&qi->ql, &s->pending_recvs_queue);
        }
985
        else if(m->fwd.found_match >= queue_count)
986
        {
987
988
            qlist_add_tail(&qi->ql, &s->pending_recvs_queue);
        }
989
        else if(m->fwd.found_match > 0 && m->fwd.found_match < queue_count)
990
991
992
993
994
        {
            int index = 1;
            struct qlist_head * ent = NULL;
            qlist_for_each(ent, &s->pending_recvs_queue)
            {
995
               if(index == m->fwd.found_match)
996
997
998
999
1000
               {
                 qlist_add(&qi->ql, ent);
                 break;
               }
               index++; 
For faster browsing, not all history is shown. View entire blame