model-net-mpi-replay.c 50.6 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
/* turning on track lp will generate a lot of output messages */
19
20
#define MN_LP_NM "modelnet_dragonfly"

21
#define TRACK_LP -1
22
#define TRACE -1
23
#define MAX_WAIT_REQS 512
24
25
26
27
#define CS_LP_DBG 0
#define lprintf(_fmt, ...) \
        do {if (CS_LP_DBG) printf(_fmt, __VA_ARGS__);} while (0)
#define MAX_STATS 65536
28
29
30
31
32
33

char workload_type[128];
char workload_file[8192];
char offset_file[8192];
static int wrkld_id;
static int num_net_traces = 0;
34
static int alloc_spec = 0;
35
static double self_overhead = 10.0;
36
37
38
39
40
41
42

/* 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;

43
44
45
46
47
48
49
50
51
52
53
/* 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 */

54
55
typedef struct nw_state nw_state;
typedef struct nw_message nw_message;
56
typedef int32_t dumpi_req_id;
57
58
59

static int net_id = 0;
static float noise = 5.0;
60
static int num_net_lps = 0, num_mpi_lps = 0;
61

62
63
64
65
66
FILE * workload_log = NULL;
FILE * workload_agg_log = NULL;
FILE * workload_meta_log = NULL;

static uint64_t sample_bytes_written = 0;
67

68
69
70
71
72
73
74
75
76
77
78
79
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;
80
81
82
static int enable_sampling = 0;
static double sampling_interval = 5000000;
static double sampling_end_time = 3000000000;
83
static int enable_debug = 1;
84

85
86
87
/* set group context */
struct codes_mctx group_ratio;

88
/* MPI_OP_GET_NEXT is for getting next MPI operation when the previous operation completes.
89
* 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.
90
91
92
93
94
95
96
97
98
* 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,
};

99
100
101
102
struct mpi_workload_sample
{
    /* Sampling data */
    int nw_id;
103
    int app_id;
104
105
106
107
108
    unsigned long num_sends_sample;
    unsigned long num_bytes_sample;
    unsigned long num_waits_sample;
    double sample_end_time;
};
109
110
111
112
113
114
115
/* 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;
116
    uint64_t num_bytes;
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
    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;
133
    int32_t req_ids[MAX_WAIT_REQS];
134
	int num_completed;
135
136
	int count;
    tw_stime start_time;
137
138
139
140
141
142
143
144
145
146
147
148
149
    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;
150
151
    int app_id;
    int local_rank;
152
153

    struct rc_stack * processed_ops;
154
    struct rc_stack * matched_reqs;
155
156
157
158
159
160
161
162
163
164

    /* 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;

165

166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
	/* 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;
183

184
185
    tw_stime cur_interval_end;

186
187
    /* Pending wait operation */
    struct pending_waits * wait_op;
188
189
190
191

    unsigned long num_bytes_sent;
    unsigned long num_bytes_recvd;

192
193
194
195
    /* For sampling data */
    int sampling_indx;
    int max_arr_size;
    struct mpi_workload_sample * mpi_wkld_samples;
196
    char output_buf[512];
197
198
199
200
};

/* data for handling reverse computation.
* saved_matched_req holds the request ID of matched receives/sends for wait operations.
201
* 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.
202
203
204
* 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
{
205
   // forward message handler
206
   int msg_type;
207
   int op_type;
208
   model_net_event_return event_rc;
209

210
211
212
   struct
   {
       tw_lpid src_rank;
213
       int dest_rank;
214
       int64_t num_bytes;
215
216
217
218
219
       int num_matched;
       int data_type;
       double sim_start_time;
       // for callbacks - time message was received
       double msg_send_time;
220
       int16_t req_id;
221
       int tag;
222
       int app_id;
223
224
225
226
227
228
229
230
231
       int found_match;
       short wait_completed;
   } fwd;
   struct
   {
       double saved_send_time;
       double saved_recv_time;
       double saved_wait_time;
       double saved_delay;
232
       int64_t saved_num_bytes;
233
       struct codes_workload_op * saved_op;
234
   } rc;
235
236
237
238
};

/* executes MPI isend and send operations */
static void codes_exec_mpi_send(
239
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op);
240
241
/* execute MPI irecv operation */
static void codes_exec_mpi_recv(
242
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp, struct codes_workload_op * mpi_op);
243
244
/* reverse of mpi recv function. */
static void codes_exec_mpi_recv_rc(
245
        nw_state* s, tw_bf * bf, nw_message* m, tw_lp* lp);
246
247
/* execute the computational delay */
static void codes_exec_comp_delay(
248
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op);
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
/* 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 */
264
265
266
267
268
269
270
271
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);
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
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);

287
/* Debugging functions, may generate unused function warning */
288
static void print_waiting_reqs(int32_t * reqs, int count)
289
290
291
292
{
    printf("\n Waiting reqs: ");
    int i;
    for(i = 0; i < count; i++ )
293
        printf(" %d ", reqs[i]);
294
}
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
static void print_msgs_queue(struct qlist_head * head, int is_send)
{
    if(is_send)
        printf("\n Send msgs queue: ");
    else
        printf("\n Recv msgs queue: ");

    struct qlist_head * ent = NULL;
    mpi_msgs_queue * current = NULL;
    qlist_for_each(ent, head)
       {
            current = qlist_entry(ent, mpi_msgs_queue, ql);
            printf(" \n Source %d Dest %d bytes %d tag %d ", current->source_rank, current->dest_rank, current->num_bytes, current->tag);
       }
}
310
311
312
313
314
315
316
317
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);
318
            printf(" %d ", current->req_id);
319
320
       }
}
321
static int clear_completed_reqs(nw_state * s,
322
        tw_lp * lp,
323
        int32_t * reqs, int count)
324
{
325
    int i, matched = 0;
326
327
328
329
330
    for( i = 0; i < count; i++)
    {
      struct qlist_head * ent = NULL;
      qlist_for_each(ent, &s->completed_reqs)
       {
331
            struct completed_requests* current =
332
333
334
                qlist_entry(ent, completed_requests, ql);
            if(current->req_id == reqs[i])
            {
335
                ++matched;
336
337
338
339
340
                qlist_del(&current->ql);
                rc_stack_push(lp, current, free, s->matched_reqs);
            }
       }
    }
341
    return matched;
342
}
343
static void add_completed_reqs(nw_state * s,
344
345
        tw_lp * lp,
        int count)
346
347
348
349
{
    int i;
    for( i = 0; i < count; i++)
    {
350
351
       struct completed_requests * req = rc_stack_pop(s->matched_reqs);
       qlist_add(&req->ql, &s->completed_reqs);
352
353
    }
}
354

355
356
357
358
359
360
/* 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);
}

361
static int notify_posted_wait(nw_state* s,
362
        tw_bf * bf, nw_message * m, tw_lp * lp,
363
        dumpi_req_id completed_req)
364
{
365
366
    struct pending_waits* wait_elem = s->wait_op;
    int wait_completed = 0;
367

368
    m->fwd.wait_completed = 0;
369

370
371
    if(!wait_elem)
        return 0;
372

373
    int op_type = wait_elem->op_type;
374

375
376
377
378
379
    if(op_type == CODES_WK_WAIT &&
            (wait_elem->req_ids[0] == completed_req))
    {
            wait_completed = 1;
    }
380
381
    else if(op_type == CODES_WK_WAITALL
            || op_type == CODES_WK_WAITANY
382
383
384
385
386
387
            || op_type == CODES_WK_WAITSOME)
    {
        int i;
        for(i = 0; i < wait_elem->count; i++)
        {
            if(wait_elem->req_ids[i] == completed_req)
388
            {
389
                wait_elem->num_completed++;
390
                if(wait_elem->num_completed > wait_elem->count)
391
                    printf("\n Num completed %d count %d LP %llu ",
392
393
394
                            wait_elem->num_completed,
                            wait_elem->count,
                            lp->gid);
395
396
//                if(wait_elem->num_completed > wait_elem->count)
//                    tw_lp_suspend(lp, 1, 0);
397

398
                if(wait_elem->num_completed == wait_elem->count)
399
                {
400
401
                    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);
402
                    wait_completed = 1;
403
                }
404

405
                m->fwd.wait_completed = 1;
406
            }
407
        }
408
    }
409
    return wait_completed;
410
}
411

412
/* reverse handler of MPI wait operation */
413
static void codes_exec_mpi_wait_rc(nw_state* s, tw_lp* lp)
414
{
415
    if(s->wait_op)
416
     {
417
418
419
         struct pending_waits * wait_op = s->wait_op;
         free(wait_op);
         s->wait_op = NULL;
420
421
422
423
     }
   else
    {
        codes_issue_next_event_rc(lp);
424
        completed_requests * qi = rc_stack_pop(s->processed_ops);
425
        qlist_add(&qi->ql, &s->completed_reqs);
426
    }
427
    return;
428
}
429

430
/* execute MPI wait operation */
431
static void codes_exec_mpi_wait(nw_state* s, tw_lp* lp, struct codes_workload_op * mpi_op)
432
{
433
434
    /* check in the completed receives queue if the request ID has already been completed.*/
    assert(!s->wait_op);
435
    dumpi_req_id req_id = mpi_op->u.wait.req_id;
436
    struct completed_requests* current = NULL;
437

438
439
440
441
442
443
444
    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);
445
            rc_stack_push(lp, current, free, s->processed_ops);
446
447
448
449
            codes_issue_next_event(lp);
            return;
        }
    }
450
451
452
453
454
    /* 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;
455
456
    wait_op->num_completed = 0;
    wait_op->start_time = tw_now(lp);
457
    s->wait_op = wait_op;
458

459
    return;
460
461
}

462
static void codes_exec_mpi_wait_all_rc(
463
        nw_state* s,
464
465
        tw_bf * bf,
        nw_message * m,
466
        tw_lp* lp)
467
{
468
469
470
471
472
473
474
475
476
477
478
  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--;
    }
  }
479
480
481
482
483
484
485
486
  if(s->wait_op)
  {
      struct pending_waits * wait_op = s->wait_op;
      free(wait_op);
      s->wait_op = NULL;
  }
  else
  {
487
      add_completed_reqs(s, lp, m->fwd.num_matched);
488
489
490
      codes_issue_next_event_rc(lp);
  }
  return;
491
492
}
static void codes_exec_mpi_wait_all(
493
        nw_state* s,
494
495
        tw_bf * bf,
        nw_message * m,
496
        tw_lp* lp,
497
        struct codes_workload_op * mpi_op)
498
{
499
500
  if(enable_debug)
    fprintf(workload_log, "\n MPI WAITALL POSTED AT %ld ", s->nw_id);
501

502
503
504
505
506
507
508
509
  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;
510
        s->mpi_wkld_samples[indx].app_id = s->app_id;
511
512
513
514
515
516
        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)
    {
517
        struct mpi_workload_sample * tmp = calloc((MAX_STATS + s->max_arr_size), sizeof(struct mpi_workload_sample));
518
519
520
521
522
523
524
525
        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++;
  }
526
  int count = mpi_op->u.waits.count;
527
528
  /* If the count is not less than max wait reqs then stop */
  assert(count < MAX_WAIT_REQS);
529

530
  int i = 0, num_matched = 0;
531
  m->fwd.num_matched = 0;
532

533
  /*if(lp->gid == TRACK)
534
  {
535
      printf("\n MPI Wait all posted ");
536
537
      print_waiting_reqs(mpi_op->u.waits.req_ids, count);
      print_completed_queue(&s->completed_reqs);
538
  }*/
539
      /* check number of completed irecvs in the completion queue */
540
541
542
543
544
545
546
  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)
       {
547
            current = qlist_entry(ent, struct completed_requests, ql);
548
549
550
551
            if(current->req_id == req_id)
                num_matched++;
       }
  }
552

553
  m->fwd.found_match = num_matched;
554
555
556
557
  if(num_matched == count)
  {
    /* No need to post a MPI Wait all then, issue next event */
      /* Remove all completed requests from the list */
558
559
560
      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);
561
562
      s->wait_op = NULL;
      codes_issue_next_event(lp);
563
564
  }
  else
565
566
567
568
569
570
571
572
573
574
575
  {
      /* 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;
576
	  wait_op->start_time = tw_now(lp);
577
      s->wait_op = wait_op;
578
  }
579
580
  return;
}
581

582
583
/* search for a matching mpi operation and remove it from the list.
 * Record the index in the list from where the element got deleted.
584
 * Index is used for inserting the element once again in the queue for reverse computation. */
585
static int rm_matching_rcv(nw_state * ns,
586
        tw_bf * bf,
587
588
        nw_message * m,
        tw_lp * lp,
589
        mpi_msgs_queue * qitem)
590
591
{
    int matched = 0;
592
    int index = 0;
593
594
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;
595

596
597
    qlist_for_each(ent, &ns->pending_recvs_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
598
        if((qi->num_bytes == qitem->num_bytes)
599
600
                && ((qi->tag == qitem->tag) || qi->tag == -1)
                && ((qi->source_rank == qitem->source_rank) || qi->source_rank == -1))
601
602
603
604
        {
            matched = 1;
            break;
        }
605
        ++index;
606
    }
607

608
609
    if(matched)
    {
610
        m->rc.saved_recv_time = ns->recv_time;
611
        ns->recv_time += (tw_now(lp) - qi->req_init_time);
612

613
614
        if(qi->op_type == CODES_WK_IRECV)
            update_completed_queue(ns, bf, m, lp, qi->req_id);
615
616
        else if(qi->op_type == CODES_WK_RECV)
            codes_issue_next_event(lp);
617

618
        qlist_del(&qi->ql);
619

620
        rc_stack_push(lp, qi, free, ns->processed_ops);
621
        return index;
622
623
624
625
    }
    return -1;
}

626
static int rm_matching_send(nw_state * ns,
627
628
629
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp, mpi_msgs_queue * qitem)
630
631
632
633
634
{
    int matched = 0;
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;

635
    int index = 0;
636
637
    qlist_for_each(ent, &ns->arrival_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
638
        if((qi->num_bytes == qitem->num_bytes)
639
640
641
642
643
644
                && (qi->tag == qitem->tag || qitem->tag == -1)
                && ((qi->source_rank == qitem->source_rank) || qitem->source_rank == -1))
        {
            matched = 1;
            break;
        }
645
        ++index;
646
647
648
649
    }

    if(matched)
    {
650
        m->rc.saved_recv_time = ns->recv_time;
651
652
653
654
655
        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);

656
        qlist_del(&qi->ql);
657

658
        return index;
659
660
661
662
663
    }
    return -1;
}
static void codes_issue_next_event_rc(tw_lp * lp)
{
664
	    tw_rand_reverse_unif(lp->rng);
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
}

/* 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(
685
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op)
686
687
688
689
690
{
	tw_event* e;
	tw_stime ts;
	nw_message* msg;

691
    m->rc.saved_delay = s->compute_time;
692
693
    s->compute_time += s_to_ns(mpi_op->u.delay.seconds);
    ts = s_to_ns(mpi_op->u.delay.seconds);
694
695

	ts += g_tw_lookahead + 0.1 + tw_rand_exponential(lp->rng, noise);
696

697
698
699
	e = tw_event_new( lp->gid, ts , lp );
	msg = tw_event_data(e);
	msg->msg_type = MPI_OP_GET_NEXT;
700
701
	tw_event_send(e);

702
703
704
}

/* reverse computation operation for MPI irecv */
705
static void codes_exec_mpi_recv_rc(
706
707
708
        nw_state* ns,
        tw_bf * bf,
        nw_message* m,
709
        tw_lp* lp)
710
{
711
	num_bytes_recvd -= m->rc.saved_num_bytes;
712
713
	ns->recv_time = m->rc.saved_recv_time;
	if(m->fwd.found_match >= 0)
714
	  {
715
		ns->recv_time = m->rc.saved_recv_time;
716
717
718
719
        int queue_count = qlist_count(&ns->arrival_queue);

        mpi_msgs_queue * qi = rc_stack_pop(ns->processed_ops);

720
        if(!m->fwd.found_match)
721
722
723
        {
            qlist_add(&qi->ql, &ns->arrival_queue);
        }
724
        else if(m->fwd.found_match >= queue_count)
725
726
727
        {
            qlist_add_tail(&qi->ql, &ns->arrival_queue);
        }
728
        else if(m->fwd.found_match > 0 && m->fwd.found_match < queue_count)
729
        {
730
731
732
733
            int index = 1;
            struct qlist_head * ent = NULL;
            qlist_for_each(ent, &ns->arrival_queue)
            {
734
               if(index == m->fwd.found_match)
735
736
737
738
               {
                 qlist_add(&qi->ql, ent);
                 break;
               }
739
               index++;
740
            }
741
        }
742
        if(qi->op_type == CODES_WK_IRECV)
743
        {
744
            update_completed_queue_rc(ns, bf, m, lp);
745
        }
746
747
        codes_issue_next_event_rc(lp);
      }
748
	else if(m->fwd.found_match < 0)
749
	    {
750
            struct qlist_head * ent = qlist_pop_back(&ns->pending_recvs_queue);
751
752
            mpi_msgs_queue * qi = qlist_entry(ent, mpi_msgs_queue, ql);
            free(qi);
753

754
            if(m->op_type == CODES_WK_IRECV)
755
                codes_issue_next_event_rc(lp);
756
757
758
	    }
}

759
/* Execute MPI Irecv operation (non-blocking receive) */
760
static void codes_exec_mpi_recv(
761
        nw_state* s,
762
        tw_bf * bf,
763
764
        nw_message * m,
        tw_lp* lp,
765
        struct codes_workload_op * mpi_op)
766
767
768
769
770
{
/* 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. */

771
	m->rc.saved_recv_time = s->recv_time;
772
773
    m->rc.saved_num_bytes = mpi_op->u.recv.num_bytes;

774
775
776
777
778
779
780
781
782
783
784
	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;

785
786
787
788
    if(s->nw_id == TRACK_LP)
        printf("\n Receive op posted num bytes %d source %d ", recv_op->num_bytes,
                recv_op->source_rank);

789
	int found_matching_sends = rm_matching_send(s, bf, m, lp, recv_op);
790
791
792
793

	/* save the req id inserted in the completed queue for reverse computation. */
	if(found_matching_sends < 0)
	  {
794
	   	  m->fwd.found_match = -1;
795
          qlist_add_tail(&recv_op->ql, &s->pending_recvs_queue);
796

797
798
799
	       /* 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)
		   {
800
			codes_issue_next_event(lp);
801
802
			return;
		   }
803
      }
804
805
	else
	  {
806
        m->fwd.found_match = found_matching_sends;
807
        codes_issue_next_event(lp);
808
809
	    rc_stack_push(lp, recv_op, free, s->processed_ops);
      }
810
811
}

812
813
814
815
816
817
818
819
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;
}
820
/* executes MPI send and isend operations */
821
static void codes_exec_mpi_send(nw_state* s,
822
823
        tw_bf * bf,
        nw_message * m,
824
        tw_lp* lp,
825
        struct codes_workload_op * mpi_op)
826
{
827
828
	/* model-net event */
    int global_dest_rank = mpi_op->u.send.dest_rank;
829

830
831
832
833
834
    if(alloc_spec)
    {
        global_dest_rank = get_global_id_of_job_rank(mpi_op->u.send.dest_rank, s->app_id);
    }

835
    //printf("\n Sender rank %d global dest rank %d ", s->nw_id, global_dest_rank);
836
    m->rc.saved_num_bytes = mpi_op->u.send.num_bytes;
837
	/* model-net event */
838
839
840
	tw_lpid dest_rank = codes_mapping_get_lpid_from_relative(global_dest_rank, NULL, "nw-lp", NULL, 0);
	
    num_bytes_sent += mpi_op->u.send.num_bytes;
841
    s->num_bytes_sent += mpi_op->u.send.num_bytes;
842

843
844
845
846
847
848
849
    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;
850
            s->mpi_wkld_samples[indx].app_id = s->app_id;
851
852
            s->mpi_wkld_samples[indx].sample_end_time = s->cur_interval_end;
            s->sampling_indx++;
853
            s->cur_interval_end += sampling_interval;
854
855
856
        }
        if(s->sampling_indx >= MAX_STATS)
        {
857
            struct mpi_workload_sample * tmp = calloc((MAX_STATS + s->max_arr_size), sizeof(struct mpi_workload_sample));
858
859
860
861
862
863
864
865
866
            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;
    }
867
868
869
	nw_message local_m;
	nw_message remote_m;

870
871
872
    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;
873
    local_m.op_type = mpi_op->op_type;
874
    local_m.msg_type = MPI_SEND_POSTED;
875
876
877
    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;
878
    local_m.fwd.app_id = s->app_id;
879
880
881
882

    remote_m = local_m;
	remote_m.msg_type = MPI_SEND_ARRIVED;

883
884
	m->event_rc = model_net_event_mctx(net_id, &group_ratio, &group_ratio, 
            "test", dest_rank, mpi_op->u.send.num_bytes, self_overhead,
885
886
	    sizeof(nw_message), (const void*)&remote_m, sizeof(nw_message), (const void*)&local_m, lp);

887
888
889
890
    if(enable_debug)
    {
        if(mpi_op->op_type == CODES_WK_ISEND)
        {
891
892
            fprintf(workload_log, "\n (%lf) APP %d MPI ISEND SOURCE %ld DEST %ld TAG %d BYTES %ld ",
                    tw_now(lp), s->app_id, s->nw_id, global_dest_rank, mpi_op->u.send.tag, mpi_op->u.send.num_bytes);
893
894
        }
        else
895
896
897
            fprintf(workload_log, "\n (%lf) APP ID %d MPI SEND SOURCE %ld DEST %ld TAG %d BYTES %ld ",
                    tw_now(lp), s->app_id, s->nw_id, global_dest_rank, mpi_op->u.send.tag, mpi_op->u.send.num_bytes);
    }
898
	/* isend executed, now get next MPI operation from the queue */
899
900
901
902
903
904
905
906
907
908
	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));
}

909
910
static void update_completed_queue_rc(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
911

912
913
914
    if(bf->c0)
    {
       struct qlist_head * ent = qlist_pop_back(&s->completed_reqs);
915
916
917
918
919
920
921

        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);
      }*/
922
923
924
925
       free(req);
    }
    else if(bf->c1)
    {
926
       struct pending_waits* wait_elem = rc_stack_pop(s->processed_ops);
927
       s->wait_op = wait_elem;
928
929
       s->wait_time = m->rc.saved_wait_time;
       add_completed_reqs(s, lp, m->fwd.num_matched);
930
       codes_issue_next_event_rc(lp);
931
    }
932
933
    if(m->fwd.wait_completed > 0)
           s->wait_op->num_completed--;
934
935
}

936
static void update_completed_queue(nw_state* s,
937
938
939
940
941
942
943
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp,
        dumpi_req_id req_id)
{
    bf->c0 = 0;
    bf->c1 = 0;
944
    m->fwd.num_matched = 0;
945

946
947
    int waiting = 0;
    waiting = notify_posted_wait(s, bf, m, lp, req_id);
948

949
950
951
952
953
954
    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);
955

956
957
958
959
960
        /*if(lp->gid == TRACK)
        {
            printf("\n Forward mode adding %ld ", req_id);
            print_completed_queue(&s->completed_reqs);
        }*/
961
    }
962
    else
963
964
     {
            bf->c1 = 1;
965
966
            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;
967
            s->wait_time += (tw_now(lp) - s->wait_op->start_time);
968
969
970

            struct pending_waits* wait_elem = s->wait_op;
            rc_stack_push(lp, wait_elem, free, s->processed_ops);
971
            s->wait_op = NULL;
972
            codes_issue_next_event(lp);
973
974
975
     }
}

976
/* reverse handler for updating arrival queue function */
977
978
static void update_arrival_queue_rc(nw_state* s,
        tw_bf * bf,
979
        nw_message * m, tw_lp * lp)
980
{
981
	s->recv_time = m->rc.saved_recv_time;
982
983
    s->num_bytes_recvd -= m->fwd.num_bytes;

984
    codes_local_latency_reverse(lp);
985

986
    if(m->fwd.found_match >= 0)
987
	{
988
        mpi_msgs_queue * qi = rc_stack_pop(s->processed_ops);
989
        int queue_count = qlist_count(&s->pending_recvs_queue);
990

991
        if(!m->fwd.found_match)
992
993
994
        {
            qlist_add(&qi->ql, &s->pending_recvs_queue);
        }
995
        else if(m->fwd.found_match >= queue_count)
996
        {
997
998
            qlist_add_tail(&qi->ql, &s->pending_recvs_queue);
        }
999
        else if(m->fwd.found_match > 0 && m->fwd.found_match < queue_count)
1000
        {
For faster browsing, not all history is shown. View entire blame