model-net-mpi-replay.c 91.4 KB
Newer Older
1
/*
2
* Copyright (C) 2014 University of Chicago.
3 4 5 6 7
 * See COPYRIGHT notice in top-level directory.
 *
 */
#include <ross.h>
#include <inttypes.h>
8
#include <sys/stat.h>
mubarak's avatar
mubarak committed
9
#include <sys/resource.h>
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 25
#define MAX_SYN_SENDS 10
#define MAX_WAIT_REQS 1024
26
#define CS_LP_DBG 1
27
#define RANK_HASH_TABLE_SZ 2000
28
#define NW_LP_NM "nw-lp"
29 30 31
#define lprintf(_fmt, ...) \
        do {if (CS_LP_DBG) printf(_fmt, __VA_ARGS__);} while (0)
#define MAX_STATS 65536
32
#define INCAST_ID 511
33

34 35 36
static int msg_size_hash_compare(
            void *key, struct qhash_head *link);

37
static unsigned long perm_switch_thresh = 8388608;
38

39
/* NOTE: Message tracking works in sequential mode only! */
40
static int debug_cols = 0;
41
static int synthetic_pattern = 1;
42 43 44
/* 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;
45
static int enable_msg_tracking = 0;
46
static int is_synthetic = 0;
47
tw_lpid TRACK_LP = -1;
48
int nprocs = 0;
49
static double total_syn_data = 0;
50
static int unmatched = 0;
51
char workload_type[128];
52
char workload_name[128];
53 54 55 56
char workload_file[8192];
char offset_file[8192];
static int wrkld_id;
static int num_net_traces = 0;
57
static int num_dumpi_traces = 0;
58
static int64_t EAGER_THRESHOLD = INT_MAX;
59

mubarak's avatar
mubarak committed
60
static long num_ops = 0;
61
static int upper_threshold = 1048576;
62
static int alloc_spec = 0;
63
static tw_stime self_overhead = 10.0;
64
static tw_stime mean_interval = 10;
65
static int payload_sz = 1024;
66 67

/* Doing LP IO*/
68
static char * params = NULL;
69
static char lp_io_dir[256] = {'\0'};
70
static char sampling_dir[32] = {'\0'};
71
static char mpi_msg_dir[32] = {'\0'};
72 73 74 75
static lp_io_handle io_handle;
static unsigned int lp_io_use_suffix = 0;
static int do_lp_io = 0;

76 77 78 79
/* variables for loading multiple applications */
char workloads_conf_file[8192];
char alloc_file[8192];
int num_traces_of_job[5];
80 81 82
tw_stime soft_delay_mpi = 2500;
tw_stime nic_delay = 1000;
tw_stime copy_per_byte_eager = 0.55;
83 84 85 86 87
char file_name_of_job[5][8192];

struct codes_jobmap_ctx *jobmap_ctx;
struct codes_jobmap_params_list jobmap_p;

88 89
/* Variables for Cortex Support */
/* Matthieu's additions start */
90
#ifdef ENABLE_CORTEX_PYTHON
91 92 93
static char cortex_file[512] = "\0";
static char cortex_class[512] = "\0";
static char cortex_gen[512] = "\0";
94
#endif
95 96
/* Matthieu's additions end */

97 98
typedef struct nw_state nw_state;
typedef struct nw_message nw_message;
Misbah Mubarak's avatar
Misbah Mubarak committed
99
typedef unsigned int dumpi_req_id;
100 101

static int net_id = 0;
102
static float noise = 1.0;
103 104 105
static int num_nw_lps = 0, num_mpi_lps = 0;

static int num_syn_clients;
106
static int syn_type = 0;
107

108
FILE * workload_log = NULL;
109
FILE * msg_size_log = NULL;
110 111 112 113
FILE * workload_agg_log = NULL;
FILE * workload_meta_log = NULL;

static uint64_t sample_bytes_written = 0;
114

115 116 117
long long num_bytes_sent=0;
long long num_bytes_recvd=0;

118 119 120
long long num_syn_bytes_sent = 0;
long long num_syn_bytes_recvd = 0;

121 122 123 124 125 126
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;
127 128 129
static int enable_sampling = 0;
static double sampling_interval = 5000000;
static double sampling_end_time = 3000000000;
130
static int enable_debug = 0;
131

132 133 134
/* set group context */
struct codes_mctx group_ratio;

135
/* MPI_OP_GET_NEXT is for getting next MPI operation when the previous operation completes.
136
* 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.
137 138 139 140 141 142 143
* 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,
144 145 146 147 148 149
    MPI_REND_ARRIVED,
    MPI_REND_ACK_ARRIVED,
    CLI_BCKGND_FIN,
    CLI_BCKGND_ARRIVE,
    CLI_BCKGND_GEN,
    CLI_NBR_FINISH,
150 151
};

152 153 154 155 156 157
/* 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 */
158 159
    STENCIL = 4, /* sends message to 4 nearby neighbors */
    PERMUTATION = 5
160
};
161 162 163 164
struct mpi_workload_sample
{
    /* Sampling data */
    int nw_id;
165
    int app_id;
166 167 168 169 170
    unsigned long num_sends_sample;
    unsigned long num_bytes_sample;
    unsigned long num_waits_sample;
    double sample_end_time;
};
171 172 173 174 175 176 177
/* 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;
178
    int64_t num_bytes;
179
    int64_t seq_id;
180 181 182 183 184 185 186 187
    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
188
	unsigned int req_id;
189
    struct qlist_head ql;
190
    int index;
191 192 193 194 195 196
};

/* 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
197
    unsigned int req_ids[MAX_WAIT_REQS];
198
	int num_completed;
199 200
	int count;
    tw_stime start_time;
201 202 203
    struct qlist_head ql;
};

204 205 206 207 208 209
struct msg_size_info
{
    int64_t msg_size;
    int num_msgs;
    tw_stime agg_latency;
    tw_stime avg_latency;
210
    struct qhash_head  hash_link;
211 212
    struct qlist_head ql; 
};
213 214 215 216 217 218 219 220 221 222
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;
223 224
    int app_id;
    int local_rank;
225

226
    int synthetic_pattern;
227 228 229
    int is_finished;
    int neighbor_completed;

230
    struct rc_stack * processed_ops;
231
    struct rc_stack * processed_wait_op;
232
    struct rc_stack * matched_reqs;
233
//    struct rc_stack * indices;
234 235 236 237 238 239 240 241 242 243

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

244

245 246
	/* time spent by the LP in executing the app trace*/
	double start_time;
247 248 249 250 251 252 253 254 255

    double col_time;

    double reduce_time;
    int num_reduce;

    double all_reduce_time;
    int num_all_reduce;

256 257 258 259 260 261 262 263 264 265 266 267 268 269 270
	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;
271

272
    tw_stime cur_interval_end;
273
    
274 275
    /* Pending wait operation */
    struct pending_waits * wait_op;
276

277 278 279 280 281 282
    /* Message size latency information */
    struct qhash_table * msg_sz_table;
    struct qlist_head msg_sz_list;

    /* quick hash for maintaining message latencies */

283 284 285
    unsigned long num_bytes_sent;
    unsigned long num_bytes_recvd;

286 287
    unsigned long syn_data;
    unsigned long gen_data;
288 289
  
    unsigned long prev_switch;
290
    int saved_perm_dest;
291

292 293 294 295
    /* For sampling data */
    int sampling_indx;
    int max_arr_size;
    struct mpi_workload_sample * mpi_wkld_samples;
296
    char output_buf[512];
297
    char col_stats[64];
298 299 300 301
};

/* data for handling reverse computation.
* saved_matched_req holds the request ID of matched receives/sends for wait operations.
302
* 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.
303 304 305
* 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
{
306
   // forward message handler
307
   int msg_type;
308
   int op_type;
309
   model_net_event_return event_rc;
310
   struct codes_workload_op * mpi_op;
311

312 313 314
   struct
   {
       tw_lpid src_rank;
315
       int dest_rank;
316
       int64_t num_bytes;
317 318 319 320 321
       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
322
       unsigned int req_id;
323
       int matched_req;
324
       int tag;
325
       int app_id;
326 327
       int found_match;
       short wait_completed;
328
       short rend_send;
329 330 331 332 333 334 335
   } fwd;
   struct
   {
       double saved_send_time;
       double saved_recv_time;
       double saved_wait_time;
       double saved_delay;
336
       int64_t saved_num_bytes;
337
       int saved_syn_length;
338
       unsigned long saved_prev_switch;
339
   } rc;
340 341
};

342
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);
343 344

static void send_ack_back_rc(nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp);
345 346
/* executes MPI isend and send operations */
static void codes_exec_mpi_send(
347
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op, int is_rend);
348 349
/* execute MPI irecv operation */
static void codes_exec_mpi_recv(
350
        nw_state* s, tw_bf * bf, nw_message * m, tw_lp * lp, struct codes_workload_op * mpi_op);
351 352
/* reverse of mpi recv function. */
static void codes_exec_mpi_recv_rc(
353
        nw_state* s, tw_bf * bf, nw_message* m, tw_lp* lp);
354 355
/* execute the computational delay */
static void codes_exec_comp_delay(
356
        nw_state* s, nw_message * m, tw_lp* lp, struct codes_workload_op * mpi_op);
357 358 359 360 361 362 363 364 365 366 367 368 369 370 371
/* 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 */
372 373 374 375 376 377 378 379
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);
380 381 382 383 384 385 386 387 388 389 390 391 392 393 394
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);

395
/*static void update_message_size_rc(
396 397 398 399
        struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
400
{*/
401
/*TODO: Complete reverse handler */
402
/*    (void)ns;
403 404 405
    (void)lp;
    (void)bf;
    (void)m;
406
}*/
407 408 409 410 411 412 413 414 415 416
/* 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)
{
417 418 419
            (void)bf;
            (void)is_eager;

420 421 422
            struct qhash_head * hash_link = NULL;
            tw_stime msg_init_time = qitem->req_init_time;
        
423
            if(ns->msg_sz_table == NULL)
424 425 426 427 428 429 430 431 432 433
                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)
            {
434
                struct msg_size_info * msg_info = (struct msg_size_info*)malloc(sizeof(struct msg_size_info));
435 436
                msg_info->msg_size = qitem->num_bytes;
                msg_info->num_msgs = 1;
437
                msg_info->agg_latency = tw_now(lp) - msg_init_time;
438
                msg_info->avg_latency = msg_info->agg_latency;
439 440
                assert(ns->msg_sz_table);
                qhash_add(ns->msg_sz_table, &(msg_info->msg_size), &(msg_info->hash_link));
441
                qlist_add(&msg_info->ql, &ns->msg_sz_list);
442
                //printf("\n Msg size %d aggregate latency %f num messages %d ", m->fwd.num_bytes, msg_info->agg_latency, msg_info->num_msgs);
443 444 445 446 447
            }
            else
            {
                struct msg_size_info * tmp = qhash_entry(hash_link, struct msg_size_info, hash_link);
                tmp->num_msgs++;
448
                tmp->agg_latency += tw_now(lp) - msg_init_time;  
449
                tmp->avg_latency = (tmp->agg_latency / tmp->num_msgs);
450
//                printf("\n Msg size %lld aggregate latency %f num messages %d ", qitem->num_bytes, tmp->agg_latency, tmp->num_msgs);
451 452 453 454 455 456 457 458
            }
}
static void notify_background_traffic_rc(
	    struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
{
459 460 461
    (void)ns;
    (void)bf;
    (void)m;
462 463 464 465 466
        
    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); 
467 468 469 470 471 472 473 474
}

static void notify_background_traffic(
	    struct nw_state * ns,
        tw_lp * lp,
        tw_bf * bf,
        struct nw_message * m)
{
475 476 477
        (void)bf;
        (void)m;

478 479 480 481 482 483 484 485 486 487 488 489 490 491 492
        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);

493
            lprintf("\n Other ranks %d ", num_other_ranks);
494
            tw_stime ts = (1.1 * g_tw_lookahead) + tw_rand_exponential(lp->rng, noise);
495 496 497 498 499 500 501 502 503 504 505
            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);
506
                m_new = (struct nw_message*)tw_event_data(e);
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
                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)
    {
540
//        printf("\n All workloads completed, notifying background traffic ");
541 542 543 544 545 546 547 548 549 550 551 552 553
        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;

554
//        printf("\n Local rank %d notifying neighbor %d ", ns->local_rank, ns->local_rank+1);
555
        tw_stime ts = (1.1 * g_tw_lookahead) + tw_rand_exponential(lp->rng, noise);
556 557 558 559 560 561 562 563 564
        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);
565
        m_new = (struct nw_message*)tw_event_data(e); 
566 567 568 569 570 571 572 573 574 575
        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)
{
576 577 578 579
        (void)b;
        (void)msg;
        (void)lp;

580 581 582 583 584 585 586 587 588
        ns->is_finished = 0;
        return;
}
void finish_bckgnd_traffic(
    struct nw_state * ns,
    tw_bf * b,
    struct nw_message * msg,
    tw_lp * lp)
{
589 590
        (void)b;
        (void)msg;
591
        ns->is_finished = 1;
592
        lprintf("\n LP %llu completed sending data %lu completed at time %lf ", LLU(lp->gid), ns->gen_data, tw_now(lp));
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 621 622
        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;

623 624 625 626 627 628
    if(bf->c1)
    {
        tw_rand_reverse_unif(lp->rng);
    }
    if(bf->c2)
    {
629
        s->prev_switch = m->rc.saved_prev_switch;
630
//        s->saved_perm_dest = s->rc_perm;
631 632
        tw_rand_reverse_unif(lp->rng);
    }
633 634 635 636 637
    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;
638
        s->num_bytes_sent -= payload_sz;
639 640
    }
        tw_rand_reverse_unif(lp->rng);
641
        s->num_sends--;
642 643 644 645 646 647 648 649 650 651 652 653 654 655

}

/* 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;
656 657
    int intm_dest_id;
    nw_message remote_m;
658 659 660 661 662 663

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

664 665 666 667
    /* Find destination */
    int* dest_svr = NULL; 
    int i, length=0;
    switch(s->synthetic_pattern)
668
    {
669 670
        case UNIFORM:
        {
671
            bf->c1 = 1;
672 673 674 675 676 677 678
            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;
679 680 681

        case PERMUTATION:
        {
682 683
            m->rc.saved_prev_switch = s->prev_switch; //for reverse computation

684 685
            length = 1;
            dest_svr = (int*) calloc(1, sizeof(int));
686 687
            //if(s->gen_data - s->prev_switch >= perm_switch_thresh)
            /*if(s->saved_perm_dest == -1)
688
            {
689
                // printf("%d - %d >= %d\n",s->gen_data,s->prev_switch,perm_switch_thresh);
690
                bf->c2 = 1;
691
                s->prev_switch = s->gen_data; //Amount of data pushed at time when switch initiated
692 693
                dest_svr[0] = tw_rand_integer(lp->rng, 0, num_clients - 1);
                if(dest_svr[0] == s->local_rank)
694 695 696 697 698
                    dest_svr[0] = (s->local_rank + num_clients/2) % num_clients;// */
                /* TODO: Fix random number generation code */
//                s->rc_perm = s->saved_perm_dest;
                /*s->saved_perm_dest = dest_svr[0];
                assert(s->saved_perm_dest != s->local_rank);
699 700
            }
            else
701 702 703 704 705 706 707
                dest_svr[0] = s->saved_perm_dest;*/
            if(s->local_rank != INCAST_ID)
                dest_svr[0] = INCAST_ID;
            else
                dest_svr[0] = 0;

            assert(dest_svr[0] != s->local_rank);
708 709
        }
        break;
710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778
        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);
779
            m->event_rc = model_net_event(net_id, "medium", global_dest_id, payload_sz, 0.0, 
780 781 782 783
                    sizeof(nw_message), (const void*)&remote_m, 
                    0, NULL, lp);
            
            s->gen_data += payload_sz;
784
            s->num_bytes_sent += payload_sz;
785 786
            num_syn_bytes_sent += payload_sz; 
        }
787
    }
788 789
    s->num_sends++;

790
    /* New event after MEAN_INTERVAL */  
791
    tw_stime ts = mean_interval  + tw_rand_exponential(lp->rng, noise); 
792 793 794
    tw_event * e;
    nw_message * m_new;
    e = tw_event_new(lp->gid, ts, lp);
795
    m_new = (struct nw_message*)tw_event_data(e);
796 797
    m_new->msg_type = CLI_BCKGND_GEN;
    tw_event_send(e);
798 799 800
    
    if(s->num_sends == MAX_SYN_SENDS)
        s->is_finished = 1;
801 802

    free(dest_svr);
803 804 805 806
}

void arrive_syn_tr_rc(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
807 808 809
    (void)bf;
    (void)m;
    (void)lp;
810
//    printf("\n Data arrived %d total data %ld ", m->fwd.num_bytes, s->syn_data);
811
    s->num_recvs--;
812 813 814
    int data = m->fwd.num_bytes;
    s->syn_data -= data;
    num_syn_bytes_recvd -= data;
815
    s->num_bytes_recvd -= data;
816 817 818
}
void arrive_syn_tr(nw_state * s, tw_bf * bf, nw_message * m, tw_lp * lp)
{
819 820 821
    (void)bf;
    (void)lp;

822 823 824
//    printf("\n Data arrived %d total data %ld ", m->fwd.num_bytes, s->syn_data);
    if(s->local_rank == 0)
     {
825
//    	printf("\n Data arrived %lld rank %llu total data %ld ", m->fwd.num_bytes, s->nw_id, s->syn_data);
826
/*	if(s->syn_data > upper_threshold)
mubarak's avatar
mubarak committed
827 828 829 830
    if(s->local_rank == 0)
     {
    	printf("\n Data arrived %lld rank %llu total data %ld ", m->fwd.num_bytes, s->nw_id, s->syn_data);
	if(s->syn_data > upper_threshold)
831 832 833 834 835 836 837
	{ 
        	struct rusage mem_usage;
		int who = RUSAGE_SELF;
		int err = getrusage(who, &mem_usage);
		printf("\n Memory usage %lf gigabytes", ((double)mem_usage.ru_maxrss / (1024.0 * 1024.0)));
		upper_threshold += 1048576;
	}*/
mubarak's avatar
mubarak committed
838
	}
839 840
    s->send_time += (tw_now(lp) - m->fwd.sim_start_time);
    s->num_recvs++;
841 842
    int data = m->fwd.num_bytes;
    s->syn_data += data;
843
    s->num_bytes_recvd += data;
844 845
    num_syn_bytes_recvd += data;
}
846
/* Debugging functions, may generate unused function warning */
847
/*static void print_waiting_reqs(uint32_t * reqs, int count)
848
{
849
    lprintf("\n Waiting reqs: %d count", count);
850 851
    int i;
    for(i = 0; i < count; i++ )
852
        lprintf(" %d ", reqs[i]);
853
}*/
854 855 856 857 858 859 860 861 862 863 864 865
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);
mubarak's avatar
mubarak committed
866
            //printf(" \n Source %d Dest %d bytes %"PRId64" tag %d ", current->source_rank, current->dest_rank, current->num_bytes, current->tag);
867 868
       }
}
Misbah Mubarak's avatar
Misbah Mubarak committed
869
static void print_completed_queue(tw_lp * lp, struct qlist_head * head)
870
{
871
//    printf("\n Completed queue: ");
872 873
      struct qlist_head * ent = NULL;
      struct completed_requests* current = NULL;
874
      tw_output(lp, "\n");
875 876 877
      qlist_for_each(ent, head)
       {
            current = qlist_entry(ent, completed_requests, ql);
878
            tw_output(lp, " %llu ", current->req_id);
879
       }
Misbah Mubarak's avatar
Misbah Mubarak committed
880
}
881
static int clear_completed_reqs(nw_state * s,
882
        tw_lp * lp,
Misbah Mubarak's avatar
Misbah Mubarak committed
883
        unsigned int * reqs, int count)
884
{
885 886 887
    (void)s;
    (void)lp;

888
    int i, matched = 0;
889

890 891 892
    for( i = 0; i < count; i++)
    {
      struct qlist_head * ent = NULL;
893 894 895
      struct completed_requests * current = NULL;
      struct completed_requests * prev = NULL;

896
      int index = 0;
897 898
      qlist_for_each(ent, &s->completed_reqs)
       {
899 900
           if(prev)
           {
901
              rc_stack_push(lp, prev, free, s->matched_reqs);
902 903
              prev = NULL;
           }
904
            
905 906
           current = qlist_entry(ent, completed_requests, ql);
           current->index = index; 
907 908
            if(current->req_id == reqs[i])
            {
909
                ++matched;
910
                qlist_del(&current->ql);
911
                prev = current;
912
            }
913
            ++index;
914
       }
915 916

      if(prev)
917 918 919 920
      {
         rc_stack_push(lp, prev, free, s->matched_reqs);
         prev = NULL;
      }
921
    }
922
    return matched;
923
}
924
static void add_completed_reqs(nw_state * s,
925 926
        tw_lp * lp,
        int count)
927
{
928
    (void)lp;
929
    for(int i = 0; i < count; i++)
930
    {
931 932
       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.
933
       qlist_add(&req->ql, &s->completed_reqs);
934
    }//end for
935
}
936

937 938 939 940 941 942
/* 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);
}

943
static int notify_posted_wait(nw_state* s,
944
        tw_bf * bf, nw_message * m, tw_lp * lp,
Misbah Mubarak's avatar
Misbah Mubarak committed
945
        unsigned int completed_req)
946
{
947 948
    (void)bf;

949 950
    struct pending_waits* wait_elem = s->wait_op;
    int wait_completed = 0;
951

952
    m->fwd.wait_completed = 0;
953

954 955
    if(!wait_elem)
        return 0;
956

957
    int op_type = wait_elem->op_type;
958

959 960 961
    if(op_type == CODES_WK_WAIT &&
            (wait_elem->req_ids[0] == completed_req))
    {
962
            m->fwd.wait_completed = 1;