model-net-mpi-replay.c 71.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/quickhash.h"
17
#include "codes/codes-jobmap.h"
18

19
/* turning on track lp will generate a lot of output messages */
20
#define MN_LP_NM "modelnet_dragonfly_custom"
21

22
#define CONTROL_MSG_SZ 64
23
#define TRACK_LP -1
24
#define TRACE -1
25
#define MAX_WAIT_REQS 512
26
#define CS_LP_DBG 0
27
#define EAGER_THRESHOLD 81920000
28 29 30
#define RANK_HASH_TABLE_SZ 2000
#define NOISE 3.0
#define NW_LP_NM "nw-lp"
31 32 33
#define lprintf(_fmt, ...) \
        do {if (CS_LP_DBG) printf(_fmt, __VA_ARGS__);} while (0)
#define MAX_STATS 65536
34
#define PAYLOAD_SZ 1024
35

36 37 38
static int msg_size_hash_compare(
            void *key, struct qhash_head *link);

39
int enable_msg_tracking = 0;
40 41

int unmatched = 0;
42 43 44 45 46
char workload_type[128];
char workload_file[8192];
char offset_file[8192];
static int wrkld_id;
static int num_net_traces = 0;
47 48
static int num_dumpi_traces = 0;

49
static int alloc_spec = 0;
50 51
static tw_stime self_overhead = 10.0;
static tw_stime mean_interval = 100000;
52 53 54 55 56 57 58

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

59 60 61 62
/* variables for loading multiple applications */
char workloads_conf_file[8192];
char alloc_file[8192];
int num_traces_of_job[5];
63 64 65
tw_stime soft_delay_mpi = 2500;
tw_stime nic_delay = 1000;
tw_stime copy_per_byte_eager = 0.55;
66 67 68 69 70
char file_name_of_job[5][8192];

struct codes_jobmap_ctx *jobmap_ctx;
struct codes_jobmap_params_list jobmap_p;

71 72
/* Variables for Cortex Support */
/* Matthieu's additions start */
73
#ifdef ENABLE_CORTEX_PYTHON
74 75
static char cortex_file[512];
static char cortex_class[512];
76
#endif
77 78
/* Matthieu's additions end */

79 80
typedef struct nw_state nw_state;
typedef struct nw_message nw_message;
81
typedef int32_t dumpi_req_id;
82 83 84

static int net_id = 0;
static float noise = 5.0;
85 86 87
static int num_nw_lps = 0, num_mpi_lps = 0;

static int num_syn_clients;
88

89
FILE * workload_log = NULL;
90
FILE * msg_size_log = NULL;
91 92 93 94
FILE * workload_agg_log = NULL;
FILE * workload_meta_log = NULL;

static uint64_t sample_bytes_written = 0;
95

96 97 98
long long num_bytes_sent=0;
long long num_bytes_recvd=0;

99 100 101
long long num_syn_bytes_sent = 0;
long long num_syn_bytes_recvd = 0;

102 103 104 105 106 107 108 109 110
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;
111 112 113
static int enable_sampling = 0;
static double sampling_interval = 5000000;
static double sampling_end_time = 3000000000;
114
static int enable_debug = 0;
115

116 117 118
/* set group context */
struct codes_mctx group_ratio;

119
/* MPI_OP_GET_NEXT is for getting next MPI operation when the previous operation completes.
120
* 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.
121 122 123 124 125 126 127
* 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,
128 129 130 131 132 133
    MPI_REND_ARRIVED,
    MPI_REND_ACK_ARRIVED,
    CLI_BCKGND_FIN,
    CLI_BCKGND_ARRIVE,
    CLI_BCKGND_GEN,
    CLI_NBR_FINISH,
134 135
};

136 137 138 139
struct mpi_workload_sample
{
    /* Sampling data */
    int nw_id;
140
    int app_id;
141 142 143 144 145
    unsigned long num_sends_sample;
    unsigned long num_bytes_sample;
    unsigned long num_waits_sample;
    double sample_end_time;
};
146 147 148 149 150 151 152
/* 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;
153
    uint64_t num_bytes;
154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169
    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;
170
    int32_t req_ids[MAX_WAIT_REQS];
171
	int num_completed;
172 173
	int count;
    tw_stime start_time;
174 175 176
    struct qlist_head ql;
};

177 178 179 180 181 182 183 184 185
struct msg_size_info
{
    int64_t msg_size;
    int num_msgs;
    tw_stime agg_latency;
    tw_stime avg_latency;
    struct qhash_head * hash_link;
    struct qlist_head ql; 
};
186 187 188 189 190 191 192 193 194 195
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;
196 197
    int app_id;
    int local_rank;
198

199 200 201
    int is_finished;
    int neighbor_completed;

202
    struct rc_stack * processed_ops;
203
    struct rc_stack * matched_reqs;
204 205 206 207 208 209 210 211 212 213

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

214

215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231
	/* 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;
232

233 234
    tw_stime cur_interval_end;

235 236
    /* Pending wait operation */
    struct pending_waits * wait_op;
237

238 239 240 241 242 243
    /* Message size latency information */
    struct qhash_table * msg_sz_table;
    struct qlist_head msg_sz_list;

    /* quick hash for maintaining message latencies */

244 245 246
    unsigned long num_bytes_sent;
    unsigned long num_bytes_recvd;

247 248 249
    unsigned long syn_data;
    unsigned long gen_data;
    
250 251 252 253
    /* For sampling data */
    int sampling_indx;
    int max_arr_size;
    struct mpi_workload_sample * mpi_wkld_samples;
254
    char output_buf[512];
255 256 257 258
};

/* data for handling reverse computation.
* saved_matched_req holds the request ID of matched receives/sends for wait operations.
259
* 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.
260 261 262
* 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
{
263
   // forward message handler
264
   int msg_type;
265
   int op_type;
266
   model_net_event_return event_rc;
267

268 269 270
   struct
   {
       tw_lpid src_rank;
271
       int dest_rank;
272
       int64_t num_bytes;
273 274 275 276 277
       int num_matched;
       int data_type;
       double sim_start_time;
       // for callbacks - time message was received
       double msg_send_time;
278
       int16_t req_id;
279
       int tag;
280
       int app_id;
281 282 283 284 285 286 287 288 289
       int found_match;
       short wait_completed;
   } fwd;
   struct
   {
       double saved_send_time;
       double saved_recv_time;
       double saved_wait_time;
       double saved_delay;
290
       int16_t saved_num_bytes;
291
       struct codes_workload_op * saved_op;
292
   } rc;
293 294
};

295
static void send_ack_back(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp, mpi_msgs_queue * mpi_op);
296 297
/* executes MPI isend and send operations */
static void codes_exec_mpi_send(
298
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op, int is_rend);
299 300
/* execute MPI irecv operation */
static void codes_exec_mpi_recv(
301
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp, struct codes_workload_op * mpi_op);
302 303
/* reverse of mpi recv function. */
static void codes_exec_mpi_recv_rc(
304
        nw_state* s, tw_bf * bf, nw_message* m, tw_lp* lp);
305 306
/* execute the computational delay */
static void codes_exec_comp_delay(
307
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op);
308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
/* 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 */
323 324 325 326 327 328 329 330
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);
331 332 333 334 335 336 337 338 339 340 341 342 343 344 345
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);

346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620
/* update the message size */
static void update_message_size(
        struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m,
        mpi_msgs_queue * qitem,
        int is_eager,
        int is_send)
{
            struct qhash_head * hash_link = NULL;
            tw_stime copy_overhead = 0;
            tw_stime msg_init_time = qitem->req_init_time;
        
            if(!ns->msg_sz_table)
                ns->msg_sz_table = qhash_init(msg_size_hash_compare, quickhash_64bit_hash, RANK_HASH_TABLE_SZ); 
            
            hash_link = qhash_search(ns->msg_sz_table, &(qitem->num_bytes));
            if(is_eager)
                copy_overhead = copy_per_byte_eager * qitem->num_bytes;

            if(is_send)
                msg_init_time = m->fwd.sim_start_time;
            
            /* update hash table */
            if(!hash_link)
            {
                struct msg_size_info * msg_info = malloc(sizeof(struct msg_size_info));
                msg_info->msg_size = qitem->num_bytes;
                msg_info->num_msgs = 1;
                msg_info->agg_latency = tw_now(lp) + copy_overhead - msg_init_time;
                msg_info->avg_latency = msg_info->agg_latency;
                qhash_add(ns->msg_sz_table, &(msg_info->msg_size), &(msg_info->hash_link));
                qlist_add(&msg_info->ql, &ns->msg_sz_list);
                //printf("\n Msg size %d aggregate latency %f num messages %d ", m->fwd.num_bytes, msg_info->agg_latency, msg_info->num_msgs);
            }
            else
            {
                struct msg_size_info * tmp = qhash_entry(hash_link, struct msg_size_info, hash_link);
                tmp->num_msgs++;
                tmp->agg_latency += tw_now(lp) + copy_overhead - msg_init_time;  
                tmp->avg_latency = (tmp->agg_latency / tmp->num_msgs);
//                printf("\n Msg size %d aggregate latency %f num messages %d ", qitem->num_bytes, tmp->agg_latency, tmp->num_msgs);
            }
}
static void notify_background_traffic_rc(
	    struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
{
    tw_rand_reverse_unif(lp->rng); 
}

static void notify_background_traffic(
	    struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
{
        struct codes_jobmap_id jid; 
        jid = codes_jobmap_to_local_id(ns->nw_id, jobmap_ctx);
        
        int num_jobs = codes_jobmap_get_num_jobs(jobmap_ctx); 
        
        for(int other_id = 0; other_id < num_jobs; other_id++)
        {
            if(other_id == jid.job)
                continue;

            struct codes_jobmap_id other_jid;
            other_jid.job = other_id;

            int num_other_ranks = codes_jobmap_get_num_ranks(other_id, jobmap_ctx);

            lprintf("\n Other ranks %ld ", num_other_ranks);
            tw_stime ts = (1.1 * g_tw_lookahead) + tw_rand_exponential(lp->rng, mean_interval/10000);
            tw_lpid global_dest_id;
     
            for(int k = 0; k < num_other_ranks; k++)    
            {
                other_jid.rank = k;
                int intm_dest_id = codes_jobmap_to_global_id(other_jid, jobmap_ctx); 
                global_dest_id = codes_mapping_get_lpid_from_relative(intm_dest_id, NULL, NW_LP_NM, NULL, 0);

                tw_event * e;
                struct nw_message * m_new;  
                e = tw_event_new(global_dest_id, ts, lp);
                m_new = tw_event_data(e);
                m_new->msg_type = CLI_BCKGND_FIN;
                tw_event_send(e);   
            }
        }
        return;
}
static void notify_neighbor_rc(
	    struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
{
       if(bf->c0)
       {
            notify_background_traffic_rc(ns, lp, bf, m);
            return;
       }
   
       if(bf->c1)
       {
          tw_rand_reverse_unif(lp->rng); 
       }
} 
static void notify_neighbor(
	    struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
{
    if(ns->local_rank == num_dumpi_traces - 1 
            && ns->is_finished == 1
            && ns->neighbor_completed == 1)
    {
        printf("\n All workloads completed, notifying background traffic ");
        bf->c0 = 1;
        notify_background_traffic(ns, lp, bf, m);
        return;
    }
    
    struct codes_jobmap_id nbr_jid;
    nbr_jid.job = ns->app_id;
    tw_lpid global_dest_id;

    if(ns->is_finished == 1 && (ns->neighbor_completed == 1 || ns->local_rank == 0))
    {
        bf->c1 = 1;

        printf("\n Local rank %d notifying neighbor %d ", ns->local_rank, ns->local_rank+1);
        tw_stime ts = (1.1 * g_tw_lookahead) + tw_rand_exponential(lp->rng, mean_interval/10000);
        nbr_jid.rank = ns->local_rank + 1;
        
        /* Send a notification to the neighbor about completion */
        int intm_dest_id = codes_jobmap_to_global_id(nbr_jid, jobmap_ctx); 
        global_dest_id = codes_mapping_get_lpid_from_relative(intm_dest_id, NULL, NW_LP_NM, NULL, 0);
       
        tw_event * e;
        struct nw_message * m_new;  
        e = tw_event_new(global_dest_id, ts, lp);
        m_new = tw_event_data(e); 
        m_new->msg_type = CLI_NBR_FINISH;
        tw_event_send(e);   
    }
}
void finish_bckgnd_traffic_rc(
    struct nw_state * ns,
    tw_bf * b,
    struct nw_message * msg,
    tw_lp * lp)
{
        ns->is_finished = 0;
        return;
}
void finish_bckgnd_traffic(
    struct nw_state * ns,
    tw_bf * b,
    struct nw_message * msg,
    tw_lp * lp)
{
        ns->is_finished = 1;
        lprintf("\n LP %llu completed sending data %lld completed at time %lf ", lp->gid, ns->gen_data, tw_now(lp));
        return;
}

void finish_nbr_wkld_rc(
    struct nw_state * ns,
    tw_bf * b,
    struct nw_message * msg,
    tw_lp * lp)
{
    ns->neighbor_completed = 0;
    
    notify_neighbor_rc(ns, lp, b, msg);
}

void finish_nbr_wkld(
    struct nw_state * ns,
    tw_bf * b,
    struct nw_message * msg,
    tw_lp * lp)
{
    printf("\n Workload completed, notifying neighbor ");
    ns->neighbor_completed = 1;

    notify_neighbor(ns, lp, b, msg);
}
static void gen_synthetic_tr_rc(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
    if(bf->c0)
        return;

    model_net_event_rc2(lp, &m->event_rc);
    s->gen_data -= PAYLOAD_SZ;

    num_syn_bytes_sent -= PAYLOAD_SZ;
    tw_rand_reverse_unif(lp->rng);
    tw_rand_reverse_unif(lp->rng);

}

/* generate synthetic traffic */
static void gen_synthetic_tr(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
    if(s->is_finished == 1)
    {
        bf->c0 = 1;
        return;
    }

    /* Get job information */
    tw_lpid global_dest_id;

    struct codes_jobmap_id jid;
    jid = codes_jobmap_to_local_id(s->nw_id, jobmap_ctx); 

    int num_clients = codes_jobmap_get_num_ranks(jid.job, jobmap_ctx);
    int dest_svr = tw_rand_integer(lp->rng, 0, num_clients - 1);

    if(dest_svr == s->local_rank)
    {
       dest_svr = (s->local_rank + 1) % num_clients;
    }
   
    jid.rank = dest_svr;

    int intm_dest_id = codes_jobmap_to_global_id(jid, jobmap_ctx); 
    global_dest_id = codes_mapping_get_lpid_from_relative(intm_dest_id, NULL, NW_LP_NM, NULL, 0);

    nw_message remote_m;
    remote_m.fwd.sim_start_time = tw_now(lp);
    remote_m.fwd.dest_rank = dest_svr;
    remote_m.msg_type = CLI_BCKGND_ARRIVE;
    remote_m.fwd.num_bytes = PAYLOAD_SZ;
    remote_m.fwd.app_id = s->app_id;
    remote_m.fwd.src_rank = s->local_rank;

    m->event_rc = model_net_event(net_id, "synthetic-tr", global_dest_id, PAYLOAD_SZ, 0.0, 
            sizeof(nw_message), (const void*)&remote_m, 
            0, NULL, lp);
    
    s->gen_data += PAYLOAD_SZ;
    num_syn_bytes_sent += PAYLOAD_SZ; 

    /* New event after MEAN_INTERVAL */  
    tw_stime ts = mean_interval  + tw_rand_exponential(lp->rng, NOISE); 
    tw_event * e;
    nw_message * m_new;
    e = tw_event_new(lp->gid, ts, lp);
    m_new = tw_event_data(e);
    m_new->msg_type = CLI_BCKGND_GEN;
    tw_event_send(e);
}

void arrive_syn_tr_rc(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
//    printf("\n Data arrived %d total data %ld ", m->fwd.num_bytes, s->syn_data);
    int data = m->fwd.num_bytes;
    s->syn_data -= data;
    num_syn_bytes_recvd -= data;
}
void arrive_syn_tr(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
//    printf("\n Data arrived %d total data %ld ", m->fwd.num_bytes, s->syn_data);
    int data = m->fwd.num_bytes;
    s->syn_data += data;
    num_syn_bytes_recvd += data;
}
621
/* Debugging functions, may generate unused function warning */
622
static void print_waiting_reqs(int32_t * reqs, int count)
623 624 625 626
{
    printf("\n Waiting reqs: ");
    int i;
    for(i = 0; i < count; i++ )
627
        printf(" %d ", reqs[i]);
628
}
629 630 631 632 633 634 635 636 637 638 639 640
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);
641
            printf(" \n Source %d Dest %d bytes %llu tag %d ", current->source_rank, current->dest_rank, current->num_bytes, current->tag);
642 643
       }
}
644 645 646 647 648 649 650 651
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);
652
            printf(" %d ", current->req_id);
653 654
       }
}
655
static int clear_completed_reqs(nw_state * s,
656
        tw_lp * lp,
657
        int32_t * reqs, int count)
658
{
659
    int i, matched = 0;
660

661 662 663
    for( i = 0; i < count; i++)
    {
      struct qlist_head * ent = NULL;
664 665 666
      struct completed_requests * current = NULL;
      struct completed_requests * prev = NULL;

667 668
      qlist_for_each(ent, &s->completed_reqs)
       {
669 670 671 672 673
            current = qlist_entry(ent, completed_requests, ql);
            
            if(prev)
              rc_stack_push(lp, prev, free, s->matched_reqs);
            
674 675
            if(current->req_id == reqs[i])
            {
676
                ++matched;
677
                qlist_del(&current->ql);
678
                prev = current;
679
            }
680 681
            else
                prev = NULL;
682
       }
683 684 685

      if(prev)
          rc_stack_push(lp, prev, free, s->matched_reqs);
686
    }
687
    return matched;
688
}
689
static void add_completed_reqs(nw_state * s,
690 691
        tw_lp * lp,
        int count)
692 693 694 695
{
    int i;
    for( i = 0; i < count; i++)
    {
696 697
       struct completed_requests * req = rc_stack_pop(s->matched_reqs);
       qlist_add(&req->ql, &s->completed_reqs);
698 699
    }
}
700

701 702 703 704 705 706
/* 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);
}

707
static int notify_posted_wait(nw_state* s,
708
        tw_bf * bf, nw_message * m, tw_lp * lp,
709
        dumpi_req_id completed_req)
710
{
711 712
    struct pending_waits* wait_elem = s->wait_op;
    int wait_completed = 0;
713

714
    m->fwd.wait_completed = 0;
715

716 717
    if(!wait_elem)
        return 0;
718

719
    int op_type = wait_elem->op_type;
720

721 722 723 724 725
    if(op_type == CODES_WK_WAIT &&
            (wait_elem->req_ids[0] == completed_req))
    {
            wait_completed = 1;
    }
726 727
    else if(op_type == CODES_WK_WAITALL
            || op_type == CODES_WK_WAITANY
728 729 730 731 732 733
            || op_type == CODES_WK_WAITSOME)
    {
        int i;
        for(i = 0; i < wait_elem->count; i++)
        {
            if(wait_elem->req_ids[i] == completed_req)
734
            {
735
                wait_elem->num_completed++;
736
                if(wait_elem->num_completed > wait_elem->count)
737
                    printf("\n Num completed %d count %d LP %llu ",
738 739 740
                            wait_elem->num_completed,
                            wait_elem->count,
                            lp->gid);
741 742
//                if(wait_elem->num_completed > wait_elem->count)
//                    tw_lp_suspend(lp, 1, 0);
743

744
                if(wait_elem->num_completed == wait_elem->count)
745
                {
746
                    if(enable_debug)
747
                        fprintf(workload_log, "\n(%lf) APP ID %d MPI WAITALL COMPLETED AT %llu ", tw_now(lp), s->app_id, s->nw_id);
748
                    wait_completed = 1;
749
                }
750

751
                m->fwd.wait_completed = 1;
752
            }
753
        }
754
    }
755
    return wait_completed;
756
}
757

758
/* reverse handler of MPI wait operation */
759
static void codes_exec_mpi_wait_rc(nw_state* s, tw_lp* lp)
760
{
761
    if(s->wait_op)
762
     {
763 764 765
         struct pending_waits * wait_op = s->wait_op;
         free(wait_op);
         s->wait_op = NULL;
766 767 768 769
     }
   else
    {
        codes_issue_next_event_rc(lp);
770
        completed_requests * qi = rc_stack_pop(s->processed_ops);
771
        qlist_add(&qi->ql, &s->completed_reqs);
772
    }
773
    return;
774
}
775

776
/* execute MPI wait operation */
777
static void codes_exec_mpi_wait(nw_state* s, tw_lp* lp, struct codes_workload_op * mpi_op)
778
{
779 780
    /* check in the completed receives queue if the request ID has already been completed.*/
    assert(!s->wait_op);
781
    dumpi_req_id req_id = mpi_op->u.wait.req_id;
782
    struct completed_requests* current = NULL;
783

784 785 786 787 788 789 790
    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);
791
            rc_stack_push(lp, current, free, s->processed_ops);
792 793 794 795
            codes_issue_next_event(lp);
            return;
        }
    }
796 797 798 799 800
    /* 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;
801 802
    wait_op->num_completed = 0;
    wait_op->start_time = tw_now(lp);
803
    s->wait_op = wait_op;
804

805
    return;
806 807
}

808
static void codes_exec_mpi_wait_all_rc(
809
        nw_state* s,
810 811
        tw_bf * bf,
        nw_message * m,
812
        tw_lp* lp)
813
{
814 815 816 817 818 819 820 821 822 823 824
  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--;
    }
  }
825 826 827 828 829 830 831 832
  if(s->wait_op)
  {
      struct pending_waits * wait_op = s->wait_op;
      free(wait_op);
      s->wait_op = NULL;
  }
  else
  {
833
      add_completed_reqs(s, lp, m->fwd.num_matched);
834 835 836
      codes_issue_next_event_rc(lp);
  }
  return;
837
}
838

839
static void codes_exec_mpi_wait_all(
840
        nw_state* s,
841 842
        tw_bf * bf,
        nw_message * m,
843
        tw_lp* lp,
844
        struct codes_workload_op * mpi_op)
845
{
846
  if(enable_debug)
847
    fprintf(workload_log, "\n MPI WAITALL POSTED AT %llu ", s->nw_id);
848

849 850 851 852 853 854 855 856
  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;
857
        s->mpi_wkld_samples[indx].app_id = s->app_id;
858 859 860 861 862 863
        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)
    {
864
        struct mpi_workload_sample * tmp = calloc((MAX_STATS + s->max_arr_size), sizeof(struct mpi_workload_sample));
865 866 867 868 869 870 871 872
        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++;
  }
873
  int count = mpi_op->u.waits.count;
874 875
  /* If the count is not less than max wait reqs then stop */
  assert(count < MAX_WAIT_REQS);
876

877
  int i = 0, num_matched = 0;
878
  m->fwd.num_matched = 0;
879

880
  /*if(lp->gid == TRACK)
881
  {
882
      printf("\n MPI Wait all posted ");
883 884
      print_waiting_reqs(mpi_op->u.waits.req_ids, count);
      print_completed_queue(&s->completed_reqs);
885
  }*/
886
      /* check number of completed irecvs in the completion queue */
887 888 889 890 891 892 893
  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)
       {
894
            current = qlist_entry(ent, struct completed_requests, ql);
895 896 897 898
            if(current->req_id == req_id)
                num_matched++;
       }
  }
899

900
  m->fwd.found_match = num_matched;
901 902 903 904
  if(num_matched == count)
  {
    /* No need to post a MPI Wait all then, issue next event */
      /* Remove all completed requests from the list */
905 906 907
      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);
908 909
      s->wait_op = NULL;
      codes_issue_next_event(lp);
910 911
  }
  else
912 913 914 915 916 917 918 919 920 921 922
  {
      /* 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;
923
	  wait_op->start_time = tw_now(lp);
924
      s->wait_op = wait_op;
925
  }
926 927
  return;
}
928

929 930
/* search for a matching mpi operation and remove it from the list.
 * Record the index in the list from where the element got deleted.
931
 * Index is used for inserting the element once again in the queue for reverse computation. */
932
static int rm_matching_rcv(nw_state * ns,
933
        tw_bf * bf,
934 935
        nw_message * m,
        tw_lp * lp,
936
        mpi_msgs_queue * qitem)
937 938
{
    int matched = 0;
939
    int index = 0;
940 941
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;
942

943 944
    qlist_for_each(ent, &ns->pending_recvs_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
945 946
        if(//(qi->num_bytes == qitem->num_bytes)
                //&& 
947
               ((qi->tag == qitem->tag) || qi->tag == -1)
948
                && ((qi->source_rank == qitem->source_rank) || qi->source_rank == -1))
949 950
        {
            matched = 1;
951
            //qitem->num_bytes = qi->num_bytes;
952 953
            break;
        }
954
        ++index;
955
    }
956

957 958
    if(matched)
    {
959 960 961 962 963 964 965 966 967 968
        if(enable_msg_tracking && qitem->num_bytes < EAGER_THRESHOLD)
        {
            update_message_size(ns, lp, bf, m, qitem, 1, 1);
        }
        if(qitem->num_bytes >= EAGER_THRESHOLD)
        {
            /* Matching receive found, need to notify the sender to transmit
             * the data */
            send_ack_back(ns, bf, m, lp, qitem);
        }
969
        m->rc.saved_recv_time = ns->recv_time;
970
        ns->recv_time += (tw_now(lp) - m->fwd.sim_start_time);
971

972 973
        if(qi->op_type == CODES_WK_IRECV)
            update_completed_queue(ns, bf, m, lp, qi->req_id);
974 975
        else if(qi->op_type == CODES_WK_RECV)
            codes_issue_next_event(lp);
976

977
        qlist_del(&qi->ql);
978

979
        rc_stack_push(lp, qi, free, ns->processed_ops);
980
        return index;
981 982 983 984
    }
    return -1;
}

985
static int rm_matching_send(nw_state * ns,
986 987 988
        tw_bf * bf,
        nw_message * m,
        tw_lp * lp, mpi_msgs_queue * qitem)
989 990 991 992 993
{
    int matched = 0;
    struct qlist_head *ent = NULL;
    mpi_msgs_queue * qi = NULL;

994
    int index = 0;
995 996
    qlist_for_each(ent, &ns->arrival_queue){
        qi = qlist_entry(ent, mpi_msgs_queue, ql);
997 998 999
        if(//(qi->num_bytes == qitem->num_bytes) // it is not a requirement in MPI that the send and receive sizes match
                // && 
		(qi->tag == qitem->tag || qitem->tag == -1)
1000 1001
                && ((qi->source_rank == qitem->source_rank) || qitem->source_rank == -1))
        {
1002
            //qi->num_bytes = qitem->num_bytes;
1003 1004 1005
            matched = 1;
            break;
        }
1006
        ++index;
1007 1008 1009 1010
    }

    if(matched)
    {
1011 1012 1013 1014 1015 1016 1017 1018 1019
        if(enable_msg_tracking && (qi->num_bytes < EAGER_THRESHOLD))
            update_message_size(ns, lp, bf, m, qi, 1, 0);
        
        if(qitem->num_bytes >= EAGER_THRESHOLD)
        {
            /* Matching receive found, need to notify the sender to transmit
             * the data */
            send_ack_back(ns, bf, m, lp, qi);
        }
1020
        m->rc.saved_recv_time = ns->recv_time;
1021 1022 1023 1024 1025
        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);

1026
        qlist_del(&qi->ql);
1027

1028
        return index;
1029 1030 1031 1032 1033
    }
    return -1;
}
static void codes_issue_next_event_rc(tw_lp * lp)
{
1034
	    tw_rand_reverse_unif(lp->rng);
1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054
}

/* 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(
1055
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op)
1056 1057 1058 1059 1060
{
	tw_event* e;
	tw_stime ts;
	nw_message* msg;

1061
    m->rc.saved_delay = s->compute_time;
1062 1063
    s->compute_time += s_to_ns(mpi_op->u.delay.seconds);
    ts = s_to_ns(mpi_op->u.delay.seconds);
1064 1065

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

1067 1068 1069
	e = tw_event_new( lp->gid, ts , lp );
	msg = tw_event_data(e);
	msg->msg_type = MPI_OP_GET_NEXT;
1070 1071
	tw_event_send(e);

1072 1073 1074
}

/* reverse computation operation for MPI irecv */
1075
static void codes_exec_mpi_recv_rc(
1076 1077 1078
        nw_state* ns,
        tw_bf * bf,
        nw_message* m,
1079
        tw_lp* lp)
1080
{
1081 1082
	ns->recv_time = m->rc.saved_recv_time;
	if(m->fwd.found_match >= 0)
1083
	  {
1084
		ns->recv_time = m->rc.saved_recv_time;
1085 1086 1087 1088
        int queue_count = qlist_count(&ns->arrival_queue);

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

1089
        if(!m->fwd.found_match)
1090 1091 1092
        {
            qlist_add(&qi->ql, &ns->arrival_queue);
        }
1093
        else if(m->fwd.found_match >= queue_count)
1094 1095 1096
        {
            qlist_add_tail(&qi->ql, &ns->arrival_queue);
        }
1097
        else if(m->fwd.found_match > 0 && m->fwd.found_match < queue_count)
1098
        {
1099 1100 1101 1102
            int index = 1;
            struct qlist_head * ent = NULL;
            qlist_for_each(ent, &ns->arrival_queue)
            {
1103
               if(index == m->fwd.found_match)
1104 1105 1106 1107
               {
                 qlist_add(&qi->ql, ent);
                 break;
               }
1108
               index++;
1109
            }
1110
        }
1111
        if(qi->op_type == CODES_WK_IRECV)
1112
        {
1113
            update_completed_queue_rc(ns, bf, m, lp);
1114
        }
1115 1116
        codes_issue_next_event_rc(lp);
      }
1117
	else if(m->fwd.found_match < 0)
1118
	    {
1119
            struct qlist_head * ent = qlist_pop_back(&ns->pending_recvs_queue);
1120 1121
            mpi_msgs_queue * qi = qlist_entry(ent, mpi_msgs_queue, ql);
            free(qi);
1122

1123
            if(m->op_type == CODES_WK_IRECV)
1124
                codes_issue_next_event_rc(lp);
1125 1126 1127
	    }
}

1128
/* Execute MPI Irecv operation (non-blocking receive) */
1129
static void codes_exec_mpi_recv(
1130
        nw_state* s,
1131
        tw_bf * bf,
1132 1133
        nw_message * m,
        tw_lp* lp,
1134
        struct codes_workload_op * mpi_op)
1135 1136 1137 1138 1139
{
/* 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. */

1140
	m->rc.saved_recv_time = s->recv_time;
1141 1142
    m->rc.saved_num_bytes = mpi_op->u.recv.num_bytes;

1143 1144 1145 1146 1147 1148 1149 1150 1151
    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;

1152 1153
    if(s->nw_id == (tw_lpid)TRACK_LP)
        printf("\n Receive op posted num bytes %llu source %d ", recv_op->num_bytes,
1154 1155
                recv_op->source_rank);

1156
	int found_matching_sends = rm_matching_send(s, bf, m, lp, recv_op);
1157 1158 1159 1160

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

1164 1165 1166
	       /* 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)
		   {
1167
			codes_issue_next_event(lp);
1168 1169
			return;
		   }
1170
      }
1171 1172
	else
	  {
1173
        m->fwd.found_match = found_matching_sends;
1174
        codes_issue_next_event(lp);
1175 1176
	    rc_stack_push(lp, recv_op, free, s->processed_ops);
      }
1177 1178
}

1179 1180 1181 1182 1183 1184 1185 1186
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;
}
1187
/* executes MPI send and isend operations */
1188
static void codes_exec_mpi_send(nw_state* s,
1189 1190
        tw_bf * bf,
        nw_message * m,
1191
        tw_lp* lp,
1192 1193
        struct codes_workload_op * mpi_op,
        int is_rend)
1194
{
1195 1196
	/* model-net event */
    int global_dest_rank = mpi_op->u.send.dest_rank;
1197

1198 1199 1200 1201 1202
    if(alloc_spec)
    {
        global_dest_rank = get_global_id_of_job_rank(mpi_op->u.send.dest_rank, s->app_id);
    }

1203
    //printf("\n Sender rank %d global dest rank %d dest-rank %d rend %d", s->nw_id, global_dest_rank, mpi_op->u.send.dest_rank, is_rend);
1204
    m->rc.saved_num_bytes = mpi_op->u.send.num_bytes;
1205
	/* model-net event */
1206
	tw_lpid dest_rank = codes_mapping_get_lpid_from_relative(global_dest_rank, NULL, "nw-lp", NULL, 0);
1207

1208 1209 1210 1211 1212
    if(!is_rend)
    {
        num_bytes_sent += mpi_op->u.send.num_bytes;
        s->num_bytes_sent += mpi_op->u.send.num_bytes;
    }
1213 1214 1215 1216 1217 1218 1219
    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;
1220
            s->mpi_wkld_samples[indx].app_id = s->app_id;
1221