model-net-mpi-replay.c 51.3 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
#define MN_LP_NM "modelnet_dragonfly_custom"
20

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
/* Variables for Cortex Support */
/* Matthieu's additions start */
56
#ifdef ENABLE_CORTEX_PYTHON
57 58
static char cortex_file[512];
static char cortex_class[512];
59
#endif
60 61
/* Matthieu's additions end */

62 63
typedef struct nw_state nw_state;
typedef struct nw_message nw_message;
64
typedef int32_t dumpi_req_id;
65 66 67

static int net_id = 0;
static float noise = 5.0;
68
static int num_net_lps = 0, num_mpi_lps = 0;
69

70 71 72 73 74
FILE * workload_log = NULL;
FILE * workload_agg_log = NULL;
FILE * workload_meta_log = NULL;

static uint64_t sample_bytes_written = 0;
75

76 77 78 79 80 81 82 83 84 85 86 87
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;
88 89 90
static int enable_sampling = 0;
static double sampling_interval = 5000000;
static double sampling_end_time = 3000000000;
91
static int enable_debug = 0;
92

93 94 95
/* set group context */
struct codes_mctx group_ratio;

96
/* MPI_OP_GET_NEXT is for getting next MPI operation when the previous operation completes.
97
* 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.
98 99 100 101 102 103 104 105 106
* 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,
};

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

    struct rc_stack * processed_ops;
162
    struct rc_stack * matched_reqs;
163 164 165 166 167 168 169 170 171 172

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

173

174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190
	/* 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;
191

192 193
    tw_stime cur_interval_end;

194 195
    /* Pending wait operation */
    struct pending_waits * wait_op;
196 197 198 199

    unsigned long num_bytes_sent;
    unsigned long num_bytes_recvd;

200 201 202 203
    /* For sampling data */
    int sampling_indx;
    int max_arr_size;
    struct mpi_workload_sample * mpi_wkld_samples;
204
    char output_buf[512];
205 206 207 208
};

/* data for handling reverse computation.
* saved_matched_req holds the request ID of matched receives/sends for wait operations.
209
* 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.
210 211 212
* 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
{
213
   // forward message handler
214
   int msg_type;
215
   int op_type;
216
   model_net_event_return event_rc;
217

218 219 220
   struct
   {
       tw_lpid src_rank;
221
       int dest_rank;
222
       int64_t num_bytes;
223 224 225 226 227
       int num_matched;
       int data_type;
       double sim_start_time;
       // for callbacks - time message was received
       double msg_send_time;
228
       int16_t req_id;
229
       int tag;
230
       int app_id;
231 232 233 234 235 236 237 238 239
       int found_match;
       short wait_completed;
   } fwd;
   struct
   {
       double saved_send_time;
       double saved_recv_time;
       double saved_wait_time;
       double saved_delay;
240
       int16_t saved_num_bytes;
241
       struct codes_workload_op * saved_op;
242
   } rc;
243 244 245 246
};

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

295
/* Debugging functions, may generate unused function warning */
296
static void print_waiting_reqs(int32_t * reqs, int count)
297 298 299 300
{
    printf("\n Waiting reqs: ");
    int i;
    for(i = 0; i < count; i++ )
301
        printf(" %d ", reqs[i]);
302
}
303 304 305 306 307 308 309 310 311 312 313 314
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);
315
            printf(" \n Source %d Dest %d bytes %llu tag %d ", current->source_rank, current->dest_rank, current->num_bytes, current->tag);
316 317
       }
}
318 319 320 321 322 323 324 325
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);
326
            printf(" %d ", current->req_id);
327 328
       }
}
329
static int clear_completed_reqs(nw_state * s,
330
        tw_lp * lp,
331
        int32_t * reqs, int count)
332
{
333
    int i, matched = 0;
334 335 336 337 338
    for( i = 0; i < count; i++)
    {
      struct qlist_head * ent = NULL;
      qlist_for_each(ent, &s->completed_reqs)
       {
339
            struct completed_requests* current =
340 341 342
                qlist_entry(ent, completed_requests, ql);
            if(current->req_id == reqs[i])
            {
343
                ++matched;
344 345 346 347 348
                qlist_del(&current->ql);
                rc_stack_push(lp, current, free, s->matched_reqs);
            }
       }
    }
349
    return matched;
350
}
351
static void add_completed_reqs(nw_state * s,
352 353
        tw_lp * lp,
        int count)
354 355 356 357
{
    int i;
    for( i = 0; i < count; i++)
    {
358 359
       struct completed_requests * req = rc_stack_pop(s->matched_reqs);
       qlist_add(&req->ql, &s->completed_reqs);
360 361
    }
}
362

363 364 365 366 367 368
/* 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);
}

369
static int notify_posted_wait(nw_state* s,
370
        tw_bf * bf, nw_message * m, tw_lp * lp,
371
        dumpi_req_id completed_req)
372
{
373 374
    struct pending_waits* wait_elem = s->wait_op;
    int wait_completed = 0;
375

376
    m->fwd.wait_completed = 0;
377

378 379
    if(!wait_elem)
        return 0;
380

381
    int op_type = wait_elem->op_type;
382

383 384 385 386 387
    if(op_type == CODES_WK_WAIT &&
            (wait_elem->req_ids[0] == completed_req))
    {
            wait_completed = 1;
    }
388 389
    else if(op_type == CODES_WK_WAITALL
            || op_type == CODES_WK_WAITANY
390 391 392 393 394 395
            || op_type == CODES_WK_WAITSOME)
    {
        int i;
        for(i = 0; i < wait_elem->count; i++)
        {
            if(wait_elem->req_ids[i] == completed_req)
396
            {
397
                wait_elem->num_completed++;
398
                if(wait_elem->num_completed > wait_elem->count)
399
                    printf("\n Num completed %d count %d LP %llu ",
400 401 402
                            wait_elem->num_completed,
                            wait_elem->count,
                            lp->gid);
403 404
//                if(wait_elem->num_completed > wait_elem->count)
//                    tw_lp_suspend(lp, 1, 0);
405

406
                if(wait_elem->num_completed == wait_elem->count)
407
                {
408
                    if(enable_debug)
409
                        fprintf(workload_log, "\n(%lf) APP ID %d MPI WAITALL COMPLETED AT %llu ", tw_now(lp), s->app_id, s->nw_id);
410
                    wait_completed = 1;
411
                }
412

413
                m->fwd.wait_completed = 1;
414
            }
415
        }
416
    }
417
    return wait_completed;
418
}
419

420
/* reverse handler of MPI wait operation */
421
static void codes_exec_mpi_wait_rc(nw_state* s, tw_lp* lp)
422
{
423
    if(s->wait_op)
424
     {
425 426 427
         struct pending_waits * wait_op = s->wait_op;
         free(wait_op);
         s->wait_op = NULL;
428 429 430 431
     }
   else
    {
        codes_issue_next_event_rc(lp);
432
        completed_requests * qi = rc_stack_pop(s->processed_ops);
433
        qlist_add(&qi->ql, &s->completed_reqs);
434
    }
435
    return;
436
}
437

438
/* execute MPI wait operation */
439
static void codes_exec_mpi_wait(nw_state* s, tw_lp* lp, struct codes_workload_op * mpi_op)
440
{
441 442
    /* check in the completed receives queue if the request ID has already been completed.*/
    assert(!s->wait_op);
443
    dumpi_req_id req_id = mpi_op->u.wait.req_id;
444
    struct completed_requests* current = NULL;
445

446 447 448 449 450 451 452
    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);
453
            rc_stack_push(lp, current, free, s->processed_ops);
454 455 456 457
            codes_issue_next_event(lp);
            return;
        }
    }
458 459 460 461 462
    /* 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;
463 464
    wait_op->num_completed = 0;
    wait_op->start_time = tw_now(lp);
465
    s->wait_op = wait_op;
466

467
    return;
468 469
}

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

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

538
  int i = 0, num_matched = 0;
539
  m->fwd.num_matched = 0;
540

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

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

590 591
/* search for a matching mpi operation and remove it from the list.
 * Record the index in the list from where the element got deleted.
592
 * Index is used for inserting the element once again in the queue for reverse computation. */
593
static int rm_matching_rcv(nw_state * ns,
594
        tw_bf * bf,
595 596
        nw_message * m,
        tw_lp * lp,
597
        mpi_msgs_queue * qitem)
598 599
{
    int matched = 0;
600
    int index = 0;
601 602
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;
603

604 605
    qlist_for_each(ent, &ns->pending_recvs_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
606
        if((qi->num_bytes == qitem->num_bytes)
607 608
                && ((qi->tag == qitem->tag) || qi->tag == -1)
                && ((qi->source_rank == qitem->source_rank) || qi->source_rank == -1))
609 610 611 612
        {
            matched = 1;
            break;
        }
613
        ++index;
614
    }
615

616 617
    if(matched)
    {
618
        m->rc.saved_recv_time = ns->recv_time;
619
        ns->recv_time += (tw_now(lp) - qi->req_init_time);
620

621 622
        if(qi->op_type == CODES_WK_IRECV)
            update_completed_queue(ns, bf, m, lp, qi->req_id);
623 624
        else if(qi->op_type == CODES_WK_RECV)
            codes_issue_next_event(lp);
625

626
        qlist_del(&qi->ql);
627

628
        rc_stack_push(lp, qi, free, ns->processed_ops);
629
        return index;
630 631 632 633
    }
    return -1;
}

634
static int rm_matching_send(nw_state * ns,
635 636 637
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp, mpi_msgs_queue * qitem)
638 639 640 641 642
{
    int matched = 0;
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;

643
    int index = 0;
644 645
    qlist_for_each(ent, &ns->arrival_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
646
        if((qi->num_bytes == qitem->num_bytes)
647 648 649 650 651 652
                && (qi->tag == qitem->tag || qitem->tag == -1)
                && ((qi->source_rank == qitem->source_rank) || qitem->source_rank == -1))
        {
            matched = 1;
            break;
        }
653
        ++index;
654 655 656 657
    }

    if(matched)
    {
658
        m->rc.saved_recv_time = ns->recv_time;
659 660 661 662 663
        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);

664
        qlist_del(&qi->ql);
665

666
        return index;
667 668 669 670 671
    }
    return -1;
}
static void codes_issue_next_event_rc(tw_lp * lp)
{
672
	    tw_rand_reverse_unif(lp->rng);
673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692
}

/* 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(
693
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op)
694 695 696 697 698
{
	tw_event* e;
	tw_stime ts;
	nw_message* msg;

699
    m->rc.saved_delay = s->compute_time;
700 701
    s->compute_time += s_to_ns(mpi_op->u.delay.seconds);
    ts = s_to_ns(mpi_op->u.delay.seconds);
702 703

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

705 706 707
	e = tw_event_new( lp->gid, ts , lp );
	msg = tw_event_data(e);
	msg->msg_type = MPI_OP_GET_NEXT;
708 709
	tw_event_send(e);

710 711 712
}

/* reverse computation operation for MPI irecv */
713
static void codes_exec_mpi_recv_rc(
714 715 716
        nw_state* ns,
        tw_bf * bf,
        nw_message* m,
717
        tw_lp* lp)
718
{
719
	num_bytes_recvd -= m->rc.saved_num_bytes;
720 721
	ns->recv_time = m->rc.saved_recv_time;
	if(m->fwd.found_match >= 0)
722
	  {
723
		ns->recv_time = m->rc.saved_recv_time;
724 725 726 727
        int queue_count = qlist_count(&ns->arrival_queue);

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

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

762
            if(m->op_type == CODES_WK_IRECV)
763
                codes_issue_next_event_rc(lp);
764 765 766
	    }
}

767
/* Execute MPI Irecv operation (non-blocking receive) */
768
static void codes_exec_mpi_recv(
769
        nw_state* s,
770
        tw_bf * bf,
771 772
        nw_message * m,
        tw_lp* lp,
773
        struct codes_workload_op * mpi_op)
774 775 776 777 778
{
/* 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. */

779
	m->rc.saved_recv_time = s->recv_time;
780 781
    m->rc.saved_num_bytes = mpi_op->u.recv.num_bytes;

782 783 784 785 786 787 788 789 790 791 792
	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;

793 794
    if(s->nw_id == (tw_lpid)TRACK_LP)
        printf("\n Receive op posted num bytes %llu source %d ", recv_op->num_bytes,
795 796
                recv_op->source_rank);

797
	int found_matching_sends = rm_matching_send(s, bf, m, lp, recv_op);
798 799 800 801

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

805 806 807
	       /* 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)
		   {
808
			codes_issue_next_event(lp);
809 810
			return;
		   }
811
      }
812 813
	else
	  {
814
        m->fwd.found_match = found_matching_sends;
815
        codes_issue_next_event(lp);
816 817
	    rc_stack_push(lp, recv_op, free, s->processed_ops);
      }
818 819
}

820 821 822 823 824 825 826 827
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;
}
828
/* executes MPI send and isend operations */
829
static void codes_exec_mpi_send(nw_state* s,
830 831
        tw_bf * bf,
        nw_message * m,
832
        tw_lp* lp,
833
        struct codes_workload_op * mpi_op)
834
{
835 836
	/* model-net event */
    int global_dest_rank = mpi_op->u.send.dest_rank;
837

838 839 840 841 842
    if(alloc_spec)
    {
        global_dest_rank = get_global_id_of_job_rank(mpi_op->u.send.dest_rank, s->app_id);
    }

843
    //printf("\n Sender rank %d global dest rank %d ", s->nw_id, global_dest_rank);
844
    m->rc.saved_num_bytes = mpi_op->u.send.num_bytes;
845
	/* model-net event */
846 847 848
	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;
849
    s->num_bytes_sent += mpi_op->u.send.num_bytes;
850

851 852 853 854 855 856 857
    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;
858
            s->mpi_wkld_samples[indx].app_id = s->app_id;
859 860
            s->mpi_wkld_samples[indx].sample_end_time = s->cur_interval_end;
            s->sampling_indx++;
861
            s->cur_interval_end += sampling_interval;
862 863 864
        }
        if(s->sampling_indx >= MAX_STATS)
        {
865
            struct mpi_workload_sample * tmp = calloc((MAX_STATS + s->max_arr_size), sizeof(struct mpi_workload_sample));
866 867 868 869 870 871 872 873 874
            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;
    }
875 876 877
	nw_message local_m;
	nw_message remote_m;

878 879 880
    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;
881
    local_m.op_type = mpi_op->op_type;
882
    local_m.msg_type = MPI_SEND_POSTED;
883 884 885
    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;
886
    local_m.fwd.app_id = s->app_id;
887 888 889 890

    remote_m = local_m;
	remote_m.msg_type = MPI_SEND_ARRIVED;

891 892
	m->event_rc = model_net_event_mctx(net_id, &group_ratio, &group_ratio, 
            "test", dest_rank, mpi_op->u.send.num_bytes, self_overhead,
893 894
	    sizeof(nw_message), (const void*)&remote_m, sizeof(nw_message), (const void*)&local_m, lp);

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

917 918
static void update_completed_queue_rc(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
919

920 921 922
    if(bf->c0)
    {
       struct qlist_head * ent = qlist_pop_back(&s->completed_reqs);
923 924 925 926 927 928 929

        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);
      }*/
930 931 932 933
       free(req);
    }
    else if(bf->c1)
    {
934
       struct pending_waits* wait_elem = rc_stack_pop(s->processed_ops);
935
       s->wait_op = wait_elem;
936 937
       s->wait_time = m->rc.saved_wait_time;
       add_completed_reqs(s, lp, m->fwd.num_matched);
938
       codes_issue_next_event_rc(lp);
939
    }
940 941
    if(m->fwd.wait_completed > 0)
           s->wait_op->num_completed--;
942 943
}

944
static void update_completed_queue(nw_state* s,
945 946 947 948 949 950 951
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp,
        dumpi_req_id req_id)
{
    bf->c0 = 0;
    bf->c1 = 0;
952
    m->fwd.num_matched = 0;
953

954 955
    int waiting = 0;
    waiting = notify_posted_wait(s, bf, m, lp, req_id);
956

957 958 959 960 961 962
    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);
963

964 965 966 967 968
        /*if(lp->gid == TRACK)
        {
            printf("\n Forward mode adding %ld ", req_id);
            print_completed_queue(&s->completed_reqs);
        }*/
969
    }
970
    else
971 972
     {
            bf->c1 = 1;
973 974
            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;
975
            s->wait_time += (tw_now(lp) - s->wait_op->start_time);
976 977 978

            struct pending_waits* wait_elem = s->wait_op;
            rc_stack_push(lp, wait_elem, free, s->processed_ops);
979
            s->wait_op = NULL;
980
            codes_issue_next_event(lp);
981 982 983
     }
}

984
/* reverse handler for updating arrival queue function */
985 986
static void update_arrival_queue_rc(nw_state* s,
        tw_bf * bf,
987
        nw_message * m, tw_lp * lp)
988
{
989
	s->recv_time = m->rc.saved_recv_time;
990 991
    s->num_bytes_recvd -= m->fwd.num_bytes;

992
    codes_local_latency_reverse(lp);
993

994
    if(m->fwd.found_match >= 0)
995
	{
996
        mpi_msgs_queue * qi = rc_stack_pop(s->processed_ops);
997
        int queue_count = qlist_count(&s->pending_recvs_queue);
998

999
        if(!m->fwd.found_match)
1000 1001 1002
        {
            qlist_add(&qi->ql, &s->pending_recvs_queue);
        }
1003
        else if(m->fwd.found_match >= queue_count)
1004
        {
1005 1006
            qlist_add_tail(&qi->ql, &s->pending_recvs_queue);
        }
1007
        else if(m->fwd.found_match > 0 && m->fwd.found_match < queue_count)
1008 1009 1010 1011 1012
        {
            int index = 1;
            struct qlist_head * ent = NULL;
            qlist_for_each(ent, &s->pending_recvs_queue)
            {
1013
               if(index == m->fwd.found_match)
1014 1015 1016 1017
               {
                 qlist_add(&qi->ql, ent);
                 break;
               }
1018
               index++;
1019
            }
1020
        }
1021 1022
        if(qi->op_type == CODES_WK_IRECV)
            update_completed_queue_rc(s, bf, m, lp);
1023 1024
        else if(qi->op_type == CODES_WK_RECV)
            codes_issue_next_event_rc(lp);
1025
    }
1026
	else if(m->fwd.found_match < 0)
1027
	{
1028
	    struct qlist_head * ent = qlist_pop_back(&s->arrival_queue);
1029 1030 1031 1032 1033 1034 1035 1036
        mpi_msgs_queue * qi = qlist_entry(ent, mpi_msgs_queue, ql);
        free(qi);
    }
}