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

#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"
17
#include "codes/quickhash.h"
18
#include "codes/codes-jobmap.h"
19

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

32 33 34
static int msg_size_hash_compare(
            void *key, struct qhash_head *link);

35
/* NOTE: Message tracking works in sequential mode only! */
36
static int debug_cols = 0;
37 38 39 40 41
/* Turning on this option slows down optimistic mode substantially. Only turn
 * on if you get issues with wait-all completion with traces. */
static int preserve_wait_ordering = 0;
static int enable_msg_tracking = 0;
static int is_synthetic = 0;
42
tw_lpid TRACK_LP = -1;
43
int nprocs = 0;
44
static double total_syn_data = 0;
45
static int unmatched = 0;
46 47 48 49 50
char workload_type[128];
char workload_file[8192];
char offset_file[8192];
static int wrkld_id;
static int num_net_traces = 0;
51
static int num_dumpi_traces = 0;
52
static int64_t EAGER_THRESHOLD = 8192;
53

54
static int alloc_spec = 0;
55 56
static tw_stime self_overhead = 10.0;
static tw_stime mean_interval = 100000;
57
static int payload_sz = 1024;
58 59 60

/* Doing LP IO*/
static char lp_io_dir[256] = {'\0'};
61
static char sampling_dir[32] = {'\0'};
62 63 64 65
static lp_io_handle io_handle;
static unsigned int lp_io_use_suffix = 0;
static int do_lp_io = 0;

66 67 68 69
/* variables for loading multiple applications */
char workloads_conf_file[8192];
char alloc_file[8192];
int num_traces_of_job[5];
70 71 72
tw_stime soft_delay_mpi = 2500;
tw_stime nic_delay = 1000;
tw_stime copy_per_byte_eager = 0.55;
73 74 75 76 77
char file_name_of_job[5][8192];

struct codes_jobmap_ctx *jobmap_ctx;
struct codes_jobmap_params_list jobmap_p;

78 79
/* Variables for Cortex Support */
/* Matthieu's additions start */
80
#ifdef ENABLE_CORTEX_PYTHON
81 82 83
static char cortex_file[512] = "\0";
static char cortex_class[512] = "\0";
static char cortex_gen[512] = "\0";
84
#endif
85 86
/* Matthieu's additions end */

87 88
typedef struct nw_state nw_state;
typedef struct nw_message nw_message;
Misbah Mubarak's avatar
Misbah Mubarak committed
89
typedef unsigned int dumpi_req_id;
90 91

static int net_id = 0;
92
static float noise = 2.0;
93 94 95
static int num_nw_lps = 0, num_mpi_lps = 0;

static int num_syn_clients;
96

97
FILE * workload_log = NULL;
98
FILE * msg_size_log = NULL;
99 100 101 102
FILE * workload_agg_log = NULL;
FILE * workload_meta_log = NULL;

static uint64_t sample_bytes_written = 0;
103

104 105 106
long long num_bytes_sent=0;
long long num_bytes_recvd=0;

107 108 109
long long num_syn_bytes_sent = 0;
long long num_syn_bytes_recvd = 0;

110 111 112 113 114 115
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;


/* runtime option for disabling computation time simulation */
static int disable_delay = 0;
116 117 118
static int enable_sampling = 0;
static double sampling_interval = 5000000;
static double sampling_end_time = 3000000000;
119
static int enable_debug = 0;
120

121 122 123
/* set group context */
struct codes_mctx group_ratio;

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

141 142 143 144 145 146 147 148
/* type of synthetic traffic */
enum TRAFFIC
{
    UNIFORM = 1, /* sends message to a randomly selected node */
    NEAREST_NEIGHBOR = 2, /* sends message to the next node (potentially connected to the same router) */
    ALLTOALL = 3, /* sends message to all other nodes */
    STENCIL = 4  /* sends message to 4 nearby neighbors */
};
149 150 151 152
struct mpi_workload_sample
{
    /* Sampling data */
    int nw_id;
153
    int app_id;
154 155 156 157 158
    unsigned long num_sends_sample;
    unsigned long num_bytes_sample;
    unsigned long num_waits_sample;
    double sample_end_time;
};
159 160 161 162 163 164 165
/* 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;
166
    int64_t num_bytes;
167
    int64_t seq_id;
168 169 170 171 172 173 174 175
    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
{
Misbah Mubarak's avatar
Misbah Mubarak committed
176
	unsigned int req_id;
177
    struct qlist_head ql;
178
    int index;
179 180 181 182 183 184
};

/* for wait operations, store the pending operation and number of completed waits so far. */
struct pending_waits
{
    int op_type;
Misbah Mubarak's avatar
Misbah Mubarak committed
185
    unsigned int req_ids[MAX_WAIT_REQS];
186
	int num_completed;
187 188
	int count;
    tw_stime start_time;
189 190 191
    struct qlist_head ql;
};

192 193 194 195 196 197 198 199 200
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; 
};
201 202 203 204 205 206 207 208 209 210
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;
211 212
    int app_id;
    int local_rank;
213

214
    int synthetic_pattern;
215 216 217
    int is_finished;
    int neighbor_completed;

218
    struct rc_stack * processed_ops;
219
    struct rc_stack * processed_wait_op;
220
    struct rc_stack * matched_reqs;
221
//    struct rc_stack * indices;
222 223 224 225 226 227 228 229 230 231

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

232

233 234
	/* time spent by the LP in executing the app trace*/
	double start_time;
235 236 237 238 239 240 241 242 243

    double col_time;

    double reduce_time;
    int num_reduce;

    double all_reduce_time;
    int num_all_reduce;

244 245 246 247 248 249 250 251 252 253 254 255 256 257 258
	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;
259

260
    tw_stime cur_interval_end;
261
    
262 263
    /* Pending wait operation */
    struct pending_waits * wait_op;
264

265 266 267 268 269 270
    /* Message size latency information */
    struct qhash_table * msg_sz_table;
    struct qlist_head msg_sz_list;

    /* quick hash for maintaining message latencies */

271 272 273
    unsigned long num_bytes_sent;
    unsigned long num_bytes_recvd;

274 275 276
    unsigned long syn_data;
    unsigned long gen_data;
    
277 278 279 280
    /* For sampling data */
    int sampling_indx;
    int max_arr_size;
    struct mpi_workload_sample * mpi_wkld_samples;
281
    char output_buf[512];
282
    char col_stats[64];
283 284 285 286
};

/* data for handling reverse computation.
* saved_matched_req holds the request ID of matched receives/sends for wait operations.
287
* 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.
288 289 290
* 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
{
291
   // forward message handler
292
   int msg_type;
293
   int op_type;
294
   model_net_event_return event_rc;
295

296 297 298
   struct
   {
       tw_lpid src_rank;
299
       int dest_rank;
300
       int64_t num_bytes;
301 302 303 304 305
       int num_matched;
       int data_type;
       double sim_start_time;
       // for callbacks - time message was received
       double msg_send_time;
Misbah Mubarak's avatar
Misbah Mubarak committed
306
       unsigned int req_id;
307
       int matched_req;
308
       int tag;
309
       int app_id;
310 311
       int found_match;
       short wait_completed;
312
       short rend_send;
313 314 315 316 317 318 319
   } fwd;
   struct
   {
       double saved_send_time;
       double saved_recv_time;
       double saved_wait_time;
       double saved_delay;
320
       int64_t saved_num_bytes;
321
       int saved_syn_length;
322
   } rc;
323 324
};

325
static void send_ack_back(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp, mpi_msgs_queue * mpi_op, int matched_req);
326 327

static void send_ack_back_rc(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp);
328 329
/* executes MPI isend and send operations */
static void codes_exec_mpi_send(
330
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op, int is_rend);
331 332
/* execute MPI irecv operation */
static void codes_exec_mpi_recv(
333
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp, struct codes_workload_op * mpi_op);
334 335
/* reverse of mpi recv function. */
static void codes_exec_mpi_recv_rc(
336
        nw_state* s, tw_bf * bf, nw_message* m, tw_lp* lp);
337 338
/* execute the computational delay */
static void codes_exec_comp_delay(
339
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op);
340 341 342 343 344 345 346 347 348 349 350 351 352 353 354
/* 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 */
355 356 357 358 359 360 361 362
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);
363 364 365 366 367 368 369 370 371 372 373 374 375 376 377
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);

378
/*static void update_message_size_rc(
379 380 381 382
        struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
383
{*/
384
/*TODO: Complete reverse handler */
385
/*    (void)ns;
386 387 388
    (void)lp;
    (void)bf;
    (void)m;
389
}*/
390 391 392 393 394 395 396 397 398 399
/* 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)
{
400 401 402
            (void)bf;
            (void)is_eager;

403 404 405 406 407 408 409 410 411 412 413 414 415 416
            struct qhash_head * hash_link = NULL;
            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_send)
                msg_init_time = m->fwd.sim_start_time;
            
            /* update hash table */
            if(!hash_link)
            {
417
                struct msg_size_info * msg_info = (struct msg_size_info*)malloc(sizeof(struct msg_size_info));
418 419
                msg_info->msg_size = qitem->num_bytes;
                msg_info->num_msgs = 1;
420
                msg_info->agg_latency = tw_now(lp) - msg_init_time;
421
                msg_info->avg_latency = msg_info->agg_latency;
422
                qhash_add(ns->msg_sz_table, &(msg_info->msg_size), msg_info->hash_link);
423 424 425 426 427 428 429
                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++;
430
                tmp->agg_latency += tw_now(lp) - msg_init_time;  
431 432 433 434 435 436 437 438 439 440
                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)
{
441 442 443
    (void)ns;
    (void)bf;
    (void)m;
444 445 446 447 448
        
    int num_jobs = codes_jobmap_get_num_jobs(jobmap_ctx); 
    
    for(int i = 0; i < num_jobs - 1; i++)
        tw_rand_reverse_unif(lp->rng); 
449 450 451 452 453 454 455 456
}

static void notify_background_traffic(
	    struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
{
457 458 459
        (void)bf;
        (void)m;

460 461 462 463 464 465 466 467 468 469 470 471 472 473 474
        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);

475
            lprintf("\n Other ranks %d ", num_other_ranks);
476 477 478 479 480 481 482 483 484 485 486 487
            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);
488
                m_new = (struct nw_message*)tw_event_data(e);
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
                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)
    {
522
//        printf("\n All workloads completed, notifying background traffic ");
523 524 525 526 527 528 529 530 531 532 533 534 535
        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;

536
//        printf("\n Local rank %d notifying neighbor %d ", ns->local_rank, ns->local_rank+1);
537 538 539 540 541 542 543 544 545 546
        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);
547
        m_new = (struct nw_message*)tw_event_data(e); 
548 549 550 551 552 553 554 555 556 557
        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)
{
558 559 560 561
        (void)b;
        (void)msg;
        (void)lp;

562 563 564 565 566 567 568 569 570
        ns->is_finished = 0;
        return;
}
void finish_bckgnd_traffic(
    struct nw_state * ns,
    tw_bf * b,
    struct nw_message * msg,
    tw_lp * lp)
{
571 572
        (void)b;
        (void)msg;
573
        ns->is_finished = 1;
574
        lprintf("\n LP %llu completed sending data %lu completed at time %lf ", LLU(lp->gid), ns->gen_data, tw_now(lp));
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
        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)
{
    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;

604 605 606 607 608 609 610
    int i;
    for (i=0; i < m->rc.saved_syn_length; i++){
        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);
611 612 613 614 615 616 617 618 619 620 621 622 623 624

}

/* 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;
625 626
    int intm_dest_id;
    nw_message remote_m;
627 628 629 630 631 632

    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);

633 634 635 636
    /* Find destination */
    int* dest_svr = NULL; 
    int i, length=0;
    switch(s->synthetic_pattern)
637
    {
638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722
        case UNIFORM:
        {
            length = 1;
            dest_svr = (int*) calloc(1, sizeof(int));
            dest_svr[0] = tw_rand_integer(lp->rng, 0, num_clients - 1);
            if(dest_svr[0] == s->local_rank)
                dest_svr[0] = (s->local_rank + 1) % num_clients;
        }
        break;
        case NEAREST_NEIGHBOR:
        {
            length = 1;
            dest_svr = (int*) calloc(1, sizeof(int));
            dest_svr[0] = (s->local_rank + 1) % num_clients;
        }
        break;
        case ALLTOALL:
        {
            dest_svr = (int*) calloc(num_clients-1, sizeof(int));
            int index = 0;
            for (i=0;i<num_clients;i++)
            {
                if(i!=s->local_rank) 
                {
                    dest_svr[index] = i;
                    index++;
                    length++;
                }
            }
        }
        break;
        case STENCIL:  //2D 4-point stencil
        {
            /* I think this code snippet is coming from the LLNL stencil patterns. */
            int digits, x=1, y=1, row, col, temp=num_clients;
            length = 4;
            dest_svr = (int*) calloc(4, sizeof(int));
            for (digits = 0; temp > 0; temp >>= 1)
                digits++;
            digits = digits/2;
            for (i = 0; i < digits; i++)
                x = x * 2;
            y = num_clients / x;
            //printf("\nStencil Syn: x=%d, y=%d", x, y);
            row = s->local_rank / y;
            col = s->local_rank % y;

            dest_svr[0] = row * y + ((col-1+y)%y);   /* left neighbor */
            dest_svr[1] = row * y + ((col+1+y)%y);   /* right neighbor */
            dest_svr[2] = ((row-1+x)%x) * y + col;   /* bottom neighbor */
            dest_svr[3] = ((row+1+x)%x) * y + col;   /* up neighbor */
        }
        break;
        default:
            tw_error(TW_LOC, "Undefined traffic pattern");
    }   
    /* Record length for reverse handler*/
    m->rc.saved_syn_length = length;

    if(length > 0)
    {
        // m->event_array_rc = (model_net_event_return) malloc(length * sizeof(model_net_event_return));
        //printf("\nRANK %d Dests %d", s->local_rank, length);
        for (i = 0; i < length; i++)
        {
            /* Generate synthetic traffic */
            jid.rank = dest_svr[i];
            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);

            remote_m.fwd.sim_start_time = tw_now(lp);
            remote_m.fwd.dest_rank = dest_svr[i];
            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;

            // printf("\nAPP %d SRC %d Dest %d (twid %llu)", jid.job, s->local_rank, dest_svr[i], global_dest_id);
            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; 
        }
723 724
    }
    /* New event after MEAN_INTERVAL */  
725
    tw_stime ts = mean_interval  + tw_rand_exponential(lp->rng, noise); 
726 727 728
    tw_event * e;
    nw_message * m_new;
    e = tw_event_new(lp->gid, ts, lp);
729
    m_new = (struct nw_message*)tw_event_data(e);
730 731
    m_new->msg_type = CLI_BCKGND_GEN;
    tw_event_send(e);
732 733

    free(dest_svr);
734 735 736 737
}

void arrive_syn_tr_rc(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
738 739 740
    (void)bf;
    (void)m;
    (void)lp;
741 742 743 744 745 746 747
//    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)
{
748 749 750
    (void)bf;
    (void)lp;

751 752 753 754 755
//    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;
}
756
/* Debugging functions, may generate unused function warning */
757
/*static void print_waiting_reqs(uint32_t * reqs, int count)
758
{
759
    lprintf("\n Waiting reqs: %d count", count);
760 761
    int i;
    for(i = 0; i < count; i++ )
762
        lprintf(" %d ", reqs[i]);
763
}*/
764 765 766 767 768 769 770 771 772 773 774 775
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);
776
            printf(" \n Source %d Dest %d bytes %"PRId64" tag %d ", current->source_rank, current->dest_rank, current->num_bytes, current->tag);
777 778
       }
}
Misbah Mubarak's avatar
Misbah Mubarak committed
779
static void print_completed_queue(tw_lp * lp, struct qlist_head * head)
780
{
781
//    printf("\n Completed queue: ");
782 783
      struct qlist_head * ent = NULL;
      struct completed_requests* current = NULL;
784
      tw_output(lp, "\n");
785 786 787
      qlist_for_each(ent, head)
       {
            current = qlist_entry(ent, completed_requests, ql);
788
            tw_output(lp, " %llu ", current->req_id);
789
       }
Misbah Mubarak's avatar
Misbah Mubarak committed
790
}
791
static int clear_completed_reqs(nw_state * s,
792
        tw_lp * lp,
Misbah Mubarak's avatar
Misbah Mubarak committed
793
        unsigned int * reqs, int count)
794
{
795 796 797
    (void)s;
    (void)lp;

798
    int i, matched = 0;
799

800 801 802
    for( i = 0; i < count; i++)
    {
      struct qlist_head * ent = NULL;
803 804 805
      struct completed_requests * current = NULL;
      struct completed_requests * prev = NULL;

806
      int index = 0;
807 808
      qlist_for_each(ent, &s->completed_reqs)
       {
809 810
           if(prev)
           {
811
              rc_stack_push(lp, prev, free, s->matched_reqs);
812 813
              prev = NULL;
           }
814
            
815 816
           current = qlist_entry(ent, completed_requests, ql);
           current->index = index; 
817 818
            if(current->req_id == reqs[i])
            {
819
                ++matched;
820
                qlist_del(&current->ql);
821
                prev = current;
822
            }
823
            ++index;
824
       }
825 826

      if(prev)
827 828 829 830
      {
         rc_stack_push(lp, prev, free, s->matched_reqs);
         prev = NULL;
      }
831
    }
832
    return matched;
833
}
834
static void add_completed_reqs(nw_state * s,
835 836
        tw_lp * lp,
        int count)
837
{
838
    (void)lp;
839
    for(int i = 0; i < count; i++)
840
    {
841 842
       struct completed_requests * req = (struct completed_requests*)rc_stack_pop(s->matched_reqs);
       // turn on only if wait-all unmatched error arises in optimistic mode.
843
       qlist_add(&req->ql, &s->completed_reqs);
844
    }//end for
845
}
846

847 848 849 850 851 852
/* 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);
}

853
static int notify_posted_wait(nw_state* s,
854
        tw_bf * bf, nw_message * m, tw_lp * lp,
Misbah Mubarak's avatar
Misbah Mubarak committed
855
        unsigned int completed_req)
856
{
857 858
    (void)bf;

859 860
    struct pending_waits* wait_elem = s->wait_op;
    int wait_completed = 0;
861

862
    m->fwd.wait_completed = 0;
863

864 865
    if(!wait_elem)
        return 0;
866

867
    int op_type = wait_elem->op_type;
868

869 870 871
    if(op_type == CODES_WK_WAIT &&
            (wait_elem->req_ids[0] == completed_req))
    {
872
            m->fwd.wait_completed = 1;
873 874
            wait_completed = 1;
    }
875 876
    else if(op_type == CODES_WK_WAITALL
            || op_type == CODES_WK_WAITANY
877 878 879 880 881 882
            || op_type == CODES_WK_WAITSOME)
    {
        int i;
        for(i = 0; i < wait_elem->count; i++)
        {
            if(wait_elem->req_ids[i] == completed_req)
883
            {
884
                wait_elem->num_completed++;
885
                if(wait_elem->num_completed > wait_elem->count)
886
                    printf("\n Num completed %d count %d LP %llu ",
887 888
                            wait_elem->num_completed,
                            wait_elem->count,
889
                            LLU(lp->gid));
890 891
//                if(wait_elem->num_completed > wait_elem->count)
//                    tw_lp_suspend(lp, 1, 0);
892

893
                if(wait_elem->num_completed >= wait_elem->count)
894
                {
895
                    if(enable_debug)
896
                        fprintf(workload_log, "\n(%lf) APP ID %d MPI WAITALL COMPLETED AT %llu ", tw_now(lp), s->app_id, LLU(s->nw_id));
897
                    wait_completed = 1;
898
                }
899

900
                m->fwd.wait_completed = 1;
901
            }
902
        }
903
    }
904
    return wait_completed;
905
}
906

907
/* reverse handler of MPI wait operation */
908
static void codes_exec_mpi_wait_rc(nw_state* s, tw_bf * bf, tw_lp* lp, nw_message * m)
909
{
910
   if(bf->c1)
911
    {
912
        completed_requests * qi = (completed_requests*)rc_stack_pop(s->processed_ops);
913 914
        if(m->fwd.found_match == 0)
        {
915
            qlist_add(&qi->ql, &s->completed_reqs);
916
        }
917 918 919 920 921 922 923 924 925 926 927 928 929
        else
        {
           int index = 1;
           struct qlist_head * ent = NULL;
           qlist_for_each(ent, &s->completed_reqs)
           {
                if(index == m->fwd.found_match)
                {
                    qlist_add(&qi->ql, ent);
                    break;
                }
                index++;
           }
930
        }
931
        codes_issue_next_event_rc(lp);
932
        return;
933
    }
934 935 936
         struct pending_waits * wait_op = s->wait_op;
         free(wait_op);
         s->wait_op = NULL;
937
}
938

939
/* execute MPI wait operation */
940
static void codes_exec_mpi_wait(nw_state* s, tw_bf * bf, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op)
941
{
942
    /* check in the completed receives queue if the request ID has already been completed.*/
Misbah Mubarak's avatar
Misbah Mubarak committed
943 944
                
//    printf("\n Wait posted rank id %d ", s->nw_id);
945
    assert(!s->wait_op);
Misbah Mubarak's avatar
Misbah Mubarak committed
946
    unsigned int req_id = mpi_op->u.wait.req_id;
947

948
    struct completed_requests* current = NULL;
949

950
    struct qlist_head * ent = NULL;
951
    int index = 0;
952 953 954 955 956
    qlist_for_each(ent, &s->completed_reqs)
    {
        current = qlist_entry(ent, completed_requests, ql);
        if(current->req_id == req_id)
        {
957
            bf->c1=1;
958
            qlist_del(&current->ql);
959
            rc_stack_push(lp, current, free, s->processed_ops);
960
            codes_issue_next_event(lp);
961
            m->fwd.found_match = index;
Misbah Mubarak's avatar
Misbah Mubarak committed
962
            if(s->nw_id == (tw_lpid)TRACK_LP)
963 964 965
            {
                tw_output(lp, "\n wait matched at post %d ", req_id);
                print_completed_queue(lp, &s->completed_reqs);
Misbah Mubarak's avatar
Misbah Mubarak committed
966
            }
967 968
            return;
        }
969
        ++index;
970
    }
971

972 973 974 975 976
    /*if(s->nw_id == (tw_lpid)TRACK_LP)
    {
        tw_output(lp, "\n wait posted %llu ", req_id);
        print_completed_queue(lp, &s->completed_reqs);
    }*/
977
    /* If not, add the wait operation in the pending 'waits' list. */
978
    struct pending_waits* wait_op = (struct pending_waits*)malloc(sizeof(struct pending_waits));
979 980 981
    wait_op->op_type = mpi_op->op_type;
    wait_op->req_ids[0] = req_id;
    wait_op->count = 1;
982 983