torus.c 67.7 KB
Newer Older
1 2 3 4 5 6
/*
 * Copyright (C) 2013 University of Chicago.
 * See COPYRIGHT notice in top-level directory.
 *
 */

7 8
#include <ross.h>
#include <assert.h>
9
#include <string.h>
10 11 12 13 14 15

#include "codes/lp-io.h"
#include "codes/codes_mapping.h"
#include "codes/codes.h"
#include "codes/model-net.h"
#include "codes/model-net-method.h"
16 17
#include "codes/model-net-lp.h"
#include "codes/net/torus.h"
18
#include "codes/rc-stack.h"
19

20 21 22 23 24
#ifdef ENABLE_CORTEX
#include <cortex/cortex.h>
#include <cortex/topology.h>
#endif

25 26
#define DEBUG 1
#define MEAN_INTERVAL 100
27 28 29
// type casts to make compiler happy
#define TRACE ((unsigned long long)(-1))
#define TRACK ((tw_lpid)(-1))
30

31
#define STATICQ 0
32 33 34
/* collective specific parameters */
#define TREE_DEGREE 4
#define LEVEL_DELAY 1000
35
#define TORUS_COLLECTIVE_DEBUG 0
36 37 38 39
#define NUM_COLLECTIVES  1
#define COLLECTIVE_COMPUTATION_DELAY 5700
#define TORUS_FAN_OUT_DELAY 20.0

40 41 42
#define LP_CONFIG_NM (model_net_lp_config_names[TORUS])
#define LP_METHOD_NM (model_net_method_names[TORUS])

43 44 45 46 47
#ifdef ENABLE_CORTEX
/* This structure is defined at the end of the file */
extern cortex_topology torus_cortex_topology;
#endif

48 49
static double maxd(double a, double b) { return a < b ? b : a; }

50
/* Torus network model implementation of codes, implements the modelnet API */
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
typedef struct nodes_message_list nodes_message_list;
struct nodes_message_list {
    nodes_message msg;
    char* event_data;
    nodes_message_list *next;
    nodes_message_list *prev;
};

void init_nodes_message_list(nodes_message_list *this, nodes_message *inmsg) {
    this->msg = *inmsg;
    this->event_data = NULL;
    this->next = NULL;
    this->prev = NULL;
}

void delete_nodes_message_list(nodes_message_list *this) {
    if(this->event_data != NULL) free(this->event_data);
    free(this);
}

71 72 73 74 75 76 77 78
static void free_tmp(void * ptr)
{
    nodes_message_list * entry = ptr;
    if(entry->event_data != NULL)
        free(entry->event_data);

    free(entry);
}
79 80 81 82 83 84
typedef struct torus_param torus_param;
struct torus_param
{
    int n_dims; /*Dimension of the torus network, 5-D, 7-D or any other*/
    int* dim_length; /*Length of each torus dimension*/
    double link_bandwidth;/* bandwidth for each torus link */
85
    double cn_bandwidth; /* injection bandwidth */
86 87 88 89 90 91 92 93 94 95 96 97 98 99
    int buffer_size; /* number of buffer slots for each vc in flits*/
    int num_vc; /* number of virtual channels for each torus link */
    float mean_process;/* mean process time for each flit  */
    int chunk_size; /* chunk is the smallest unit--default set to 32 */

    /* "derived" torus parameters */

    /* factor, used in torus coordinate calculation */
    int * factor;
    /* half length of each dimension, used in torus coordinates calculation */
    int * half_length;

    double head_delay;
    double credit_delay;
100 101 102 103
    double cn_delay;

    double router_delay;
    int routing;
104
};
105 106

/* codes mapping group name, lp type name */
107
static char grp_name[MAX_NAME_LENGTH];
108
/* codes mapping group id, lp type id, repetition id and offset */
109
int mapping_grp_id, mapping_rep_id, mapping_type_id, mapping_offset;
110 111 112 113

/* for calculating torus model statistics, average and maximum travel time of a packet */
static tw_stime         total_time = 0;
static tw_stime         max_latency = 0;
114
static tw_stime         max_collective = 0;
115 116 117 118 119 120

/* number of finished packets on each PE */
static long long       N_finished_packets = 0;
/* total number of hops traversed by a message on each PE */
static long long       total_hops = 0;

121
/* annotation-specific parameters (unannotated entry occurs at the
122
 * last index) */
123
static int                       num_params = 0;
124 125
static torus_param             * all_params = NULL;
static const config_anno_map_t * anno_map   = NULL;
126 127 128 129 130 131 132

typedef struct nodes_state nodes_state;

/* state of a torus node */
struct nodes_state
{
  /* counts the number of packets sent from this compute node */
133
  unsigned long long packet_counter;
134
  /* availability time of each torus link */
135
  tw_stime** next_link_available_time;
136 137 138 139 140 141
  /* availability of each torus credit link */
  tw_stime** next_credit_available_time;
  /* next flit generate time */
  tw_stime** next_flit_generate_time;
  /* buffer size for each torus virtual channel */
  int** buffer;
142 143 144 145 146 147 148 149 150 151 152 153 154 155 156
  /* Head and tail of the terminal messages list */
  nodes_message_list **terminal_msgs;
  nodes_message_list **terminal_msgs_tail;
  int all_term_length;
  int *terminal_length, *queued_length;
  /* pending packets to be sent out */
  nodes_message_list ***pending_msgs;
  nodes_message_list ***pending_msgs_tail;
  nodes_message_list ***queued_msgs;
  nodes_message_list ***queued_msgs_tail;
  nodes_message_list **other_msgs;
  nodes_message_list **other_msgs_tail;
  int *in_send_loop;
  /* traffic through each torus link */
  int64_t *link_traffic;
157 158 159 160 161 162 163 164
  /* coordinates of the current torus node */
  int* dim_position;
  /* neighbor LP ids for this torus node */
  int* neighbour_minus_lpID;
  int* neighbour_plus_lpID;

  /* records torus statistics for this LP having different communication categories */
  struct mn_stats torus_stats_array[CATEGORY_MAX];
165 166 167 168 169
   /* for collective operations */

  /* collective init time */
  tw_stime collective_init_time;

170
  /* node ID in the tree */
171 172
   tw_lpid node_id;

173
   /* messages sent & received in collectives may get interchanged several times so we have to save the
174
     origin server information in the node's state */
175 176
   tw_lpid origin_svr;

177 178 179 180 181 182 183 184 185 186 187 188 189 190
  /* parent node ID of the current node */
   tw_lpid parent_node_id;
   /* array of children to be allocated in terminal_init*/
   tw_lpid* children;

   /* children of a node can be less than or equal to the tree degree */
   int num_children;

   short is_root;
   short is_leaf;

   /* to maintain a count of child nodes that have fanned in at the parent during the collective
      fan-in phase*/
   int num_fan_nodes;
191 192 193 194 195

   /* LPs annotation */
   const char * anno;
   /* LPs configuration */
   const torus_param * params;
196 197 198

   /* create the RC stack */
   struct rc_stack * st;
199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220

   /* finished chunks */
   long finished_chunks;

   /* finished packets */
   long finished_packets;

   /* total hops */
   double total_hops;

   /* total time */
   double total_time;

   /* total data */
   long total_data_sz;
   /* output buf */
   char output_buf[2048];
   char output_busy_buf[2048];

   /* busy time */
   tw_stime * busy_time;
   tw_stime * last_buf_full;
221 222
};

223
static void append_to_node_message_list(
224 225
        nodes_message_list ** thisq,
        nodes_message_list ** thistail,
226
        int index,
227 228 229 230 231 232
        nodes_message_list *msg) {
    if(thisq[index] == NULL) {
        thisq[index] = msg;
    } else {
        thistail[index]->next = msg;
        msg->prev = thistail[index];
233
    }
234 235
    thistail[index] = msg;
}
236
static void prepend_to_node_message_list(
237 238
        nodes_message_list ** thisq,
        nodes_message_list ** thistail,
239
        int index,
240 241 242 243 244 245
        nodes_message_list *msg) {
    if(thisq[index] == NULL) {
        thistail[index] = msg;
    } else {
        thisq[index]->prev = msg;
        msg->next = thisq[index];
246
    }
247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
    thisq[index] = msg;
}

static nodes_message_list* return_head(
        nodes_message_list ** thisq,
        nodes_message_list ** thistail,
        int index) {
    nodes_message_list *head = thisq[index];
    if(head != NULL) {
        thisq[index] = head->next;
        if(head->next != NULL) {
            head->next->prev = NULL;
            head->next = NULL;
        } else {
            thistail[index] = NULL;
        }
    }
    return head;
}

static nodes_message_list* return_tail(
        nodes_message_list ** thisq,
        nodes_message_list ** thistail,
        int index) {
    nodes_message_list *tail = thistail[index];
    if(tail->prev != NULL) {
        tail->prev->next = NULL;
        thistail[index] = tail->prev;
        tail->prev = NULL;
    } else {
        thistail[index] = NULL;
        thisq[index] = NULL;
    }
    return tail;
}

283 284 285 286 287 288 289 290 291 292 293 294 295 296 297
/* convert GiB/s and bytes to ns */
static tw_stime bytes_to_ns(uint64_t bytes, double GB_p_s)
{
    tw_stime time;

    /* bytes to GB */
    time = ((double)bytes)/(1024.0*1024.0*1024.0);
    /* GiB to s */
    time = time / GB_p_s;
    /* s to ns */
    time = time * 1000.0 * 1000.0 * 1000.0;

    return(time);
}

298 299 300 301
static void torus_read_config(
        const char         * anno,
        torus_param        * params){
    char dim_length_str[MAX_NAME_LENGTH];
302
    int i;
303 304 305 306

    // shorthand
    torus_param *p = params;

307 308
    int rc = configuration_get_value_int(&config, "PARAMS", "n_dims", anno, &p->n_dims);
    if(rc) {
309
        p->n_dims = 4; /* a 4-D torus */
310
        fprintf(stderr,
311 312 313 314
                "Warning: Number of dimensions not specified, setting to %d\n",
                p->n_dims);
    }

315
   rc = configuration_get_value_double(&config, "PARAMS", "link_bandwidth", anno,
316
            &p->link_bandwidth);
317
    if(rc) {
318 319 320 321 322
        p->link_bandwidth = 2.0; /*default bg/q configuration */
        fprintf(stderr, "Link bandwidth not specified, setting to %lf\n",
                p->link_bandwidth);
    }

323 324
    rc = configuration_get_value_int(&config, "PARAMS", "buffer_size", anno, &p->buffer_size);
    if(rc) {
325 326 327 328 329
        p->buffer_size = 2048;
        fprintf(stderr, "Buffer size not specified, setting to %d",
                p->buffer_size);
    }

330

331 332 333
    rc = configuration_get_value_int(&config, "PARAMS", "chunk_size", anno, &p->chunk_size);
    if(rc) {
        p->chunk_size = 128;
334 335 336 337 338 339 340
        fprintf(stderr, "Warning: Chunk size not specified, setting to %d\n",
                p->chunk_size);
    }
        /* by default, we have one for taking packets,
         * another for taking credit*/
        p->num_vc = 1;

341
    rc = configuration_get_value(&config, "PARAMS", "dim_length", anno,
342 343 344 345 346 347 348 349 350
            dim_length_str, MAX_NAME_LENGTH);
    if (rc == 0){
        tw_error(TW_LOC, "couldn't read PARAMS:dim_length");
    }
    char* token;
    p->dim_length=malloc(p->n_dims*sizeof(*p->dim_length));
    token = strtok(dim_length_str, ",");
    i = 0;
    while(token != NULL)
351
    {
352 353 354 355 356 357 358 359 360 361
        sscanf(token, "%d", &p->dim_length[i]);
        if(p->dim_length[i] <= 0)
        {
            tw_error(TW_LOC, "Invalid torus dimension specified "
                    "(%d at pos %d), exiting... ", p->dim_length[i], i);
        }
        i++;
        token = strtok(NULL,",");
    }
    // create derived parameters
362

363
    // factor is an exclusive prefix product
364
    p->router_delay = 50;
365
    p->cn_delay = 10;
366 367 368 369 370 371 372 373 374 375
    p->factor = malloc(p->n_dims * sizeof(int));
    p->factor[0] = 1;
    for(i = 1; i < p->n_dims; i++)
        p->factor[i] = p->factor[i-1] * p->dim_length[i-1];

    p->half_length = malloc(p->n_dims * sizeof(int));
    for (i = 0; i < p->n_dims; i++)
        p->half_length[i] = p->dim_length[i] / 2;

    // some latency numbers
376 377
    p->head_delay = bytes_to_ns(p->chunk_size, p->link_bandwidth);
    p->credit_delay = bytes_to_ns(8, p->link_bandwidth);
378 379 380 381 382 383 384 385
}

static void torus_configure(){
    anno_map = codes_mapping_get_lp_anno_map(LP_CONFIG_NM);
    assert(anno_map);
    num_params = anno_map->num_annos + (anno_map->has_unanno_lp > 0);
    all_params = malloc(num_params * sizeof(*all_params));

386
    for (int i = 0; i < anno_map->num_annos; i++){
387
        const char * anno = anno_map->annotations[i].ptr;
388 389 390 391
        torus_read_config(anno, &all_params[i]);
    }
    if (anno_map->has_unanno_lp > 0){
        torus_read_config(NULL, &all_params[anno_map->num_annos]);
392
    }
393 394 395
#ifdef ENABLE_CORTEX
	model_net_topology = torus_cortex_topology;
#endif
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
/* helper functions - convert between flat ids and torus n-dimensional ids */
static void to_dim_id(
        int flat_id,
        int ndims,
        const int *dim_lens,
        int *out_dim_ids)
{
    for (int i = 0; i < ndims; i++) {
        out_dim_ids[i] = flat_id % dim_lens[i];
        flat_id /= dim_lens[i];
    }
}

static int to_flat_id(
        int ndims,
        const int *dim_lens,
        const int *dim_ids)
{
    int flat_id = dim_ids[0];
    int mult = dim_lens[0];
    for (int i = 1; i < ndims; i++) {
        flat_id += dim_ids[i] * mult;
        mult *= dim_lens[i];
    }
    return flat_id;
}

425 426 427
void torus_collective_init(nodes_state * s,
           		   tw_lp * lp)
{
428
    // TODO: be annotation-aware somehow
429
    codes_mapping_get_lp_info(lp->gid, grp_name, &mapping_grp_id, NULL, &mapping_type_id, NULL, &mapping_rep_id, &mapping_offset);
430
    tw_lpid num_lps = codes_mapping_get_lp_count(grp_name, 0, LP_CONFIG_NM, s->anno, 0);
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

    int i;
   /* handle collective operations by forming a tree of all the LPs */
   /* special condition for root of the tree */
   if( s->node_id == 0)
    {
        s->parent_node_id = -1;
        s->is_root = 1;
   }
   else
   {
       s->parent_node_id = (s->node_id - ((s->node_id - 1) % TREE_DEGREE)) / TREE_DEGREE;
       s->is_root = 0;
   }
   s->children = (tw_lpid*)malloc(TREE_DEGREE * sizeof(tw_lpid));

   /* set the isleaf to zero by default */
   s->is_leaf = 1;
   s->num_children = 0;

   /* calculate the children of the current node. If its a leaf, no need to set children,
      only set isleaf and break the loop*/

   for( i = 0; i < TREE_DEGREE; i++ )
    {
        tw_lpid next_child = (TREE_DEGREE * s->node_id) + i + 1;
457
        if(next_child < num_lps)
458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477
        {
            s->num_children++;
            s->is_leaf = 0;
            s->children[i] = next_child;
        }
        else
           s->children[i] = -1;
    }

#if TORUS_COLLECTIVE_DEBUG == 1
   printf("\n LP %ld parent node id ", s->node_id);

   for( i = 0; i < TREE_DEGREE; i++ )
        printf(" child node ID %ld ", s->children[i]);
   printf("\n");

   if(s->is_leaf)
        printf("\n LP %ld is leaf ", s->node_id);
#endif
}
478
/* torus packet reverse event */
479 480 481 482 483 484
static void torus_packet_event_rc(tw_lp *sender)
{
  codes_local_latency_reverse(sender);
  return;
}

485 486 487 488 489 490
/* returns the torus message size */
static int torus_get_msg_sz(void)
{
   return sizeof(nodes_message);
}

491
/* torus packet event , generates a torus packet on the compute node */
492 493 494 495 496 497 498 499 500 501
static tw_stime torus_packet_event(
        model_net_request const * req,
        uint64_t message_offset,
        uint64_t packet_size,
        tw_stime offset,
        mn_sched_params const * sched_params,
        void const * remote_event,
        void const * self_event,
        tw_lp *sender,
        int is_last_pckt)
502
{
503 504
    (void)message_offset; // not using atm...
    (void)sched_params; // not using atm...
505 506 507 508
    tw_event * e_new;
    tw_stime xfer_to_nic_time;
    nodes_message * msg;
    char* tmp_ptr;
509

510
    xfer_to_nic_time = codes_local_latency(sender); /* Throws an error of found last KP time > current event time otherwise */
511 512 513 514
    //e_new = tw_event_new(local_nic_id, xfer_to_nic_time+offset, sender);
    //msg = tw_event_data(e_new);
    e_new = model_net_method_event_new(sender->gid, xfer_to_nic_time+offset,
            sender, TORUS, (void**)&msg, (void**)&tmp_ptr);
515 516 517 518
    strcpy(msg->category, req->category);
    msg->final_dest_gid = req->final_dest_lp;
    msg->dest_lp = req->dest_mn_lp;
    msg->sender_svr= req->src_lp;
519
    msg->sender_node = sender->gid;
520
    msg->packet_size = packet_size;
521
    msg->travel_start_time = tw_now(sender);
522 523
    msg->remote_event_size_bytes = 0;
    msg->local_event_size_bytes = 0;
524
    msg->chunk_id = 0;
525
    msg->type = GENERATE;
526 527 528
    msg->is_pull = req->is_pull;
    msg->pull_size = req->pull_size;

529
    if(is_last_pckt) /* Its the last packet so pass in remote event information*/
530 531 532 533 534 535 536 537 538 539 540 541 542 543 544
    {
        if(req->remote_event_size > 0)
        {
            msg->remote_event_size_bytes = req->remote_event_size;
            memcpy(tmp_ptr, remote_event, req->remote_event_size);
            tmp_ptr += req->remote_event_size;
        }
        if(req->self_event_size > 0)
        {
            msg->local_event_size_bytes = req->self_event_size;
            memcpy(tmp_ptr, self_event, req->self_event_size);
            tmp_ptr += req->self_event_size;
        }
        // printf("\n torus remote event %d local event %d last packet %d %lf ", msg->remote_event_size_bytes, msg->local_event_size_bytes, is_last_pckt, xfer_to_nic_time);
    }
545
    tw_event_send(e_new);
546
    return xfer_to_nic_time;
547
}
548

549
/*Sends a 8-byte credit back to the torus node LP that sent the message */
550 551
static void credit_send( nodes_state * s,
	    tw_lp * lp,
552 553 554 555 556 557 558
	    nodes_message * msg,
            int sq)
{
    tw_event * e;
    nodes_message *m;
    tw_stime ts;

559
    ts = (1.1 * g_tw_lookahead) + s->params->credit_delay + tw_rand_unif(lp->rng);
560
    e = model_net_method_event_new(msg->sender_node, ts, lp, TORUS,
561 562 563 564 565 566 567 568 569 570 571
        (void**)&m, NULL);
    if(sq == -1) {
        m->source_direction = msg->source_direction;
        m->source_dim = msg->source_dim;
    } else {
        m->source_direction = msg->saved_queue % 2;
        m->source_dim = msg->saved_queue / 2;
    }
    m->type = CREDIT;
    tw_event_send(e);
}
572
/*Initialize the torus model, this initialization part is borrowed from Ning's torus model */
573
static void torus_init( nodes_state * s,
574 575 576
	   tw_lp * lp )
{
    int i, j;
577
    char anno[MAX_NAME_LENGTH];
578

579 580
    rc_stack_create(&s->st);

581
    codes_mapping_get_lp_info(lp->gid, grp_name, &mapping_grp_id, NULL, &mapping_type_id, anno, &mapping_rep_id, &mapping_offset);
582

583 584
    s->node_id = codes_mapping_get_lp_relative_id(lp->gid, 0, 0);

585 586 587 588 589
    if (anno[0] == '\0'){
        s->anno = NULL;
        s->params = &all_params[num_params-1];
    }
    else{
590
        s->anno = strdup(anno);
591 592 593
        int id = configuration_get_annotation_index(anno, anno_map);
        s->params = &all_params[id];
    }
594

595 596
    // shorthand
    const torus_param *p = s->params;
597

598 599 600
    s->finished_chunks = 0;
    s->finished_packets = 0;

601 602 603 604
    s->neighbour_minus_lpID = (int*)malloc(p->n_dims * sizeof(int));
    s->neighbour_plus_lpID = (int*)malloc(p->n_dims * sizeof(int));
    s->dim_position = (int*)malloc(p->n_dims * sizeof(int));
    s->buffer = (int**)malloc(2*p->n_dims * sizeof(int*));
605
    s->next_link_available_time =
606
        (tw_stime**)malloc(2*p->n_dims * sizeof(tw_stime*));
607
    s->next_credit_available_time =
608
        (tw_stime**)malloc(2*p->n_dims * sizeof(tw_stime*));
609
    s->next_flit_generate_time =
610 611
        (tw_stime**)malloc(2*p->n_dims*sizeof(tw_stime*));

612 613 614 615 616
    for(i=0; i < 2*p->n_dims; i++)
    {
        s->buffer[i] = (int*)malloc(p->num_vc * sizeof(int));
        s->next_link_available_time[i] =
                (tw_stime*)malloc(p->num_vc * sizeof(tw_stime));
617
        s->next_credit_available_time[i] =
618
                (tw_stime*)malloc(p->num_vc * sizeof(tw_stime));
619
        s->next_flit_generate_time[i] =
620 621 622 623
                (tw_stime*)malloc(p->num_vc * sizeof(tw_stime));
    }
    s->terminal_length = (int*)malloc(2*p->n_dims*sizeof(int));
    s->queued_length = (int*)malloc(2*p->n_dims*sizeof(int));
624
    s->terminal_msgs =
625
        (nodes_message_list**)malloc(2*p->n_dims*sizeof(nodes_message_list*));
626
    s->terminal_msgs_tail =
627
        (nodes_message_list**)malloc(2*p->n_dims*sizeof(nodes_message_list*));
628
    s->pending_msgs =
629
        (nodes_message_list***)malloc(2*p->n_dims*sizeof(nodes_message_list**));
630
    s->pending_msgs_tail =
631
        (nodes_message_list***)malloc(2*p->n_dims*sizeof(nodes_message_list**));
632
    s->queued_msgs =
633
        (nodes_message_list***)malloc(2*p->n_dims*sizeof(nodes_message_list**));
634
    s->queued_msgs_tail =
635
        (nodes_message_list***)malloc(2*p->n_dims*sizeof(nodes_message_list**));
636

637
    s->busy_time =
638
        (tw_stime*)malloc(2*p->n_dims*sizeof(tw_stime));
639
    s->last_buf_full =
640 641
        (tw_stime*)malloc(2*p->n_dims*sizeof(tw_stime));

642
    for(i = 0; i < 2*p->n_dims; i++) {
643
        s->pending_msgs[i] =
644
            (nodes_message_list**)malloc(p->num_vc*sizeof(nodes_message_list*));
645
        s->pending_msgs_tail[i] =
646
            (nodes_message_list**)malloc(p->num_vc*sizeof(nodes_message_list*));
647
        s->queued_msgs[i] =
648
            (nodes_message_list**)malloc(p->num_vc*sizeof(nodes_message_list*));
649
        s->queued_msgs_tail[i] =
650
            (nodes_message_list**)malloc(p->num_vc*sizeof(nodes_message_list*));
651

652
    }
653
    s->other_msgs =
654
        (nodes_message_list**)malloc(2*p->n_dims*sizeof(nodes_message_list*));
655
    s->other_msgs_tail =
656
        (nodes_message_list**)malloc(2*p->n_dims*sizeof(nodes_message_list*));
657
    s->in_send_loop =
658 659 660
        (int *)malloc(2*p->n_dims*sizeof(int));

    s->link_traffic = (int64_t *)malloc(2*p->n_dims*sizeof(int64_t));
661 662
    s->total_data_sz = 0;

663
    for(i=0; i < 2*p->n_dims; i++)
664
    {
665 666 667
	s->buffer[i] = (int*)malloc(p->num_vc * sizeof(int));
	s->next_link_available_time[i] =
            (tw_stime*)malloc(p->num_vc * sizeof(tw_stime));
668
	s->next_credit_available_time[i] =
669
            (tw_stime*)malloc(p->num_vc * sizeof(tw_stime));
670
	s->next_flit_generate_time[i] =
671
            (tw_stime*)malloc(p->num_vc * sizeof(tw_stime));
672 673 674 675 676 677 678 679
        s->terminal_msgs[i] = NULL;
        s->terminal_msgs_tail[i] = NULL;
        s->other_msgs[i] = NULL;
        s->other_msgs_tail[i] = NULL;
        s->in_send_loop[i] = 0;
        s->terminal_length[i] = 0;
        s->queued_length[i] = 0;
        s->all_term_length = 0;
680 681
        s->busy_time[i] = 0;
        s->last_buf_full[i] = 0;
682 683
    }

684 685 686
    // calculate my torus coords
    to_dim_id(codes_mapping_get_lp_relative_id(lp->gid, 0, 1),
            s->params->n_dims, s->params->dim_length, s->dim_position);
687 688
    /* DEBUG */
    /*printf("%lu: my coords:", lp->gid);
Jonathan Jenkins's avatar
Jonathan Jenkins committed
689 690 691 692
    for (i = 0; i < p->n_dims; i++)
        printf(" %d", s->dim_position[i]);
    printf("\n");
    */
693

694 695
  int temp_dim_pos[ p->n_dims ];
  for ( i = 0; i < p->n_dims; i++ )
696 697 698
    temp_dim_pos[ i ] = s->dim_position[ i ];

  // calculate minus neighbour's lpID
699
  for ( j = 0; j < p->n_dims; j++ )
700
    {
701 702
      temp_dim_pos[ j ] = (s->dim_position[ j ] -1 + p->dim_length[ j ]) %
          p->dim_length[ j ];
703

704 705 706 707 708 709 710 711 712 713
      s->neighbour_minus_lpID[j] =
          to_flat_id(p->n_dims, p->dim_length, temp_dim_pos);

      /* DEBUG
      printf(" minus neighbor: flat:%d lpid:%lu\n",
              s->neighbour_minus_lpID[j],
              codes_mapping_get_lpid_from_relative(s->neighbour_minus_lpID[j],
                      NULL, LP_CONFIG_NM, s->anno, 1));
      */

714 715 716
      temp_dim_pos[ j ] = s->dim_position[ j ];
    }
  // calculate plus neighbour's lpID
717
  for ( j = 0; j < p->n_dims; j++ )
718
    {
719 720
      temp_dim_pos[ j ] = ( s->dim_position[ j ] + 1 + p->dim_length[ j ]) %
          p->dim_length[ j ];
721

722 723 724 725 726 727 728 729 730
      s->neighbour_plus_lpID[j] =
          to_flat_id(p->n_dims, p->dim_length, temp_dim_pos);

      /* DEBUG
      printf(" plus neighbor: flat:%d lpid:%lu\n",
              s->neighbour_plus_lpID[j],
              codes_mapping_get_lpid_from_relative(s->neighbour_plus_lpID[j],
                      NULL, LP_CONFIG_NM, s->anno, 1));
      */
731 732 733 734 735

      temp_dim_pos[ j ] = s->dim_position[ j ];
    }

  //printf("\n");
736
  for( j=0; j < 2 * p->n_dims; j++ )
737
   {
738
    for( i = 0; i < p->num_vc; i++ )
739
     {
740
       s->buffer[ j ][ i ] = 0;
741
       s->next_link_available_time[ j ][ i ] = 0.0;
742
       s->next_credit_available_time[j][i] = 0.0;
743 744 745 746
       s->pending_msgs[j][i] = NULL;
       s->pending_msgs_tail[j][i] = NULL;
       s->queued_msgs[j][i] = NULL;
       s->queued_msgs_tail[j][i] = NULL;
747 748 749 750
     }
   }
  // record LP time
    s->packet_counter = 0;
751 752 753 754 755
    torus_collective_init(s, lp);
}


/* collective operation for the torus network */
756
void torus_collective(char const * category, int message_size, int remote_event_size, const void* remote_event, tw_lp* sender)
757 758 759 760 761 762 763
{
    tw_event * e_new;
    tw_stime xfer_to_nic_time;
    nodes_message * msg;
    tw_lpid local_nic_id;
    char* tmp_ptr;

764 765 766 767 768
    // TODO: be annotation-aware
    codes_mapping_get_lp_info(sender->gid, grp_name, &mapping_grp_id, NULL,
            &mapping_type_id, NULL, &mapping_rep_id, &mapping_offset);
    codes_mapping_get_lp_id(grp_name, LP_CONFIG_NM, NULL, 1,
            mapping_rep_id, mapping_offset, &local_nic_id);
769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794

    xfer_to_nic_time = g_tw_lookahead + codes_local_latency(sender);
    e_new = model_net_method_event_new(local_nic_id, xfer_to_nic_time,
            sender, TORUS, (void**)&msg, (void**)&tmp_ptr);

    msg->remote_event_size_bytes = message_size;
    strcpy(msg->category, category);
    msg->sender_svr=sender->gid;
    msg->type = T_COLLECTIVE_INIT;

    tmp_ptr = (char*)msg;
    tmp_ptr += torus_get_msg_sz();
    if(remote_event_size > 0)
     {
            msg->remote_event_size_bytes = remote_event_size;
            memcpy(tmp_ptr, remote_event, remote_event_size);
            tmp_ptr += remote_event_size;
     }

    tw_event_send(e_new);
    return;
}

/* reverse for collective operation of the dragonfly network */
void torus_collective_rc(int message_size, tw_lp* sender)
{
795
    (void)message_size; // unneeded
796 797 798 799 800 801 802 803 804 805 806 807 808 809
     codes_local_latency_reverse(sender);
     return;
}

static void send_remote_event(nodes_state * s,
                        nodes_message * msg,
                        tw_lp * lp)
{
    // Trigger an event on receiving server
    if(msg->remote_event_size_bytes)
     {
            tw_event* e;
            tw_stime ts;
            nodes_message * m;
810
            ts = (1/s->params->link_bandwidth) * msg->remote_event_size_bytes;
811
            e = tw_event_new(s->origin_svr, ts, lp);
812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832
            m = tw_event_data(e);
            char* tmp_ptr = (char*)msg;
            tmp_ptr += torus_get_msg_sz();
            memcpy(m, tmp_ptr, msg->remote_event_size_bytes);
            tw_event_send(e);
     }
}

static void node_collective_init(nodes_state * s,
                        nodes_message * msg,
                        tw_lp * lp)
{
        tw_event * e_new;
        tw_lpid parent_nic_id;
        tw_stime xfer_to_nic_time;
        nodes_message * msg_new;
        int num_lps;

        msg->saved_collective_init_time = s->collective_init_time;
        s->collective_init_time = tw_now(lp);
	s->origin_svr = msg->sender_svr;
833

834 835 836 837
        if(s->is_leaf)
        {
            //printf("\n LP %ld sending message to parent %ld ", s->node_id, s->parent_node_id);
            /* get the global LP ID of the parent node */
838 839 840 841 842 843 844 845
            // TODO: be annotation-aware
            codes_mapping_get_lp_info(lp->gid, grp_name, &mapping_grp_id, NULL,
                    &mapping_type_id, NULL, &mapping_rep_id, &mapping_offset);
            num_lps = codes_mapping_get_lp_count(grp_name, 1, LP_CONFIG_NM,
                    NULL, 1);
            codes_mapping_get_lp_id(grp_name, LP_CONFIG_NM, NULL, 1,
                    s->parent_node_id/num_lps, (s->parent_node_id % num_lps),
                    &parent_nic_id);
846 847 848 849 850 851 852

           /* send a message to the parent that the LP has entered the collective operation */
            xfer_to_nic_time = g_tw_lookahead + LEVEL_DELAY;
            //e_new = codes_event_new(parent_nic_id, xfer_to_nic_time, lp);
	    void* m_data;
	    e_new = model_net_method_event_new(parent_nic_id, xfer_to_nic_time,
            	lp, TORUS, (void**)&msg_new, (void**)&m_data);
853

854 855 856 857 858
            memcpy(msg_new, msg, sizeof(nodes_message));
	    if (msg->remote_event_size_bytes){
        	memcpy(m_data, model_net_method_get_edata(TORUS, msg),
                	msg->remote_event_size_bytes);
      	    }
859

860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875
            msg_new->type = T_COLLECTIVE_FAN_IN;
            msg_new->sender_node = s->node_id;

            tw_event_send(e_new);
        }
        return;
}

static void node_collective_fan_in(nodes_state * s,
                        tw_bf * bf,
                        nodes_message * msg,
                        tw_lp * lp)
{
        int i;
        s->num_fan_nodes++;

876 877 878 879 880
        // TODO: be annotation-aware
        codes_mapping_get_lp_info(lp->gid, grp_name, &mapping_grp_id, NULL,
                &mapping_type_id, NULL, &mapping_rep_id, &mapping_offset);
        int num_lps = codes_mapping_get_lp_count(grp_name, 1, LP_CONFIG_NM,
                NULL, 1);
881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898

        tw_event* e_new;
        nodes_message * msg_new;
        tw_stime xfer_to_nic_time;

        bf->c1 = 0;
        bf->c2 = 0;

        /* if the number of fanned in nodes have completed at the current node then signal the parent */
        if((s->num_fan_nodes == s->num_children) && !s->is_root)
        {
            bf->c1 = 1;
            msg->saved_fan_nodes = s->num_fan_nodes-1;
            s->num_fan_nodes = 0;
            tw_lpid parent_nic_id;
            xfer_to_nic_time = g_tw_lookahead + LEVEL_DELAY;

            /* get the global LP ID of the parent node */
899 900 901
            codes_mapping_get_lp_id(grp_name, LP_CONFIG_NM, NULL, 1,
                    s->parent_node_id/num_lps, (s->parent_node_id % num_lps),
                    &parent_nic_id);
902 903 904 905 906 907 908 909

           /* send a message to the parent that the LP has entered the collective operation */
            //e_new = codes_event_new(parent_nic_id, xfer_to_nic_time, lp);
            //msg_new = tw_event_data(e_new);
	    void * m_data;
      	    e_new = model_net_method_event_new(parent_nic_id,
              xfer_to_nic_time,
              lp, TORUS, (void**)&msg_new, &m_data);
910

911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927
            memcpy(msg_new, msg, sizeof(nodes_message));
            msg_new->type = T_COLLECTIVE_FAN_IN;
            msg_new->sender_node = s->node_id;

            if (msg->remote_event_size_bytes){
	        memcpy(m_data, model_net_method_get_edata(TORUS, msg),
        	        msg->remote_event_size_bytes);
      	   }
            tw_event_send(e_new);
      }

      /* root node starts off with the fan-out phase */
      if(s->is_root && (s->num_fan_nodes == s->num_children))
      {
           bf->c2 = 1;
           msg->saved_fan_nodes = s->num_fan_nodes-1;
           s->num_fan_nodes = 0;
928
           send_remote_event(s, msg, lp);
929 930 931 932 933 934 935 936

           for( i = 0; i < s->num_children; i++ )
           {
                tw_lpid child_nic_id;
                /* Do some computation and fan out immediate child nodes from the collective */
                xfer_to_nic_time = g_tw_lookahead + COLLECTIVE_COMPUTATION_DELAY + LEVEL_DELAY + tw_rand_exponential(lp->rng, (double)LEVEL_DELAY/50);

                /* get global LP ID of the child node */
937 938 939
                codes_mapping_get_lp_id(grp_name, LP_CONFIG_NM, NULL, 1,
                        s->children[i]/num_lps, (s->children[i] % num_lps),
                        &child_nic_id);
940 941 942 943 944 945 946 947 948 949 950 951 952
                //e_new = codes_event_new(child_nic_id, xfer_to_nic_time, lp);

                //msg_new = tw_event_data(e_new);
                void * m_data;
	        e_new = model_net_method_event_new(child_nic_id,
                xfer_to_nic_time,
		lp, TORUS, (void**)&msg_new, &m_data);

		memcpy(msg_new, msg, sizeof(nodes_message));
	        if (msg->remote_event_size_bytes){
	                memcpy(m_data, model_net_method_get_edata(TORUS, msg),
        	               msg->remote_event_size_bytes);
      		}
953

954 955 956 957 958 959
                msg_new->type = T_COLLECTIVE_FAN_OUT;
                msg_new->sender_node = s->node_id;

                tw_event_send(e_new);
           }
      }
960
}
961

962 963 964 965 966 967
static void node_collective_fan_out(nodes_state * s,
                        tw_bf * bf,
                        nodes_message * msg,
                        tw_lp * lp)
{
        int i;
968 969 970
        //TODO: be annotation-aware
        int num_lps = codes_mapping_get_lp_count(grp_name, 1, LP_CONFIG_NM,
                NULL, 1);
971 972 973
        bf->c1 = 0;
        bf->c2 = 0;

974
        send_remote_event(s, msg, lp);
975

976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991
        if(!s->is_leaf)
        {
            bf->c1 = 1;
            tw_event* e_new;
            nodes_message * msg_new;
            tw_stime xfer_to_nic_time;

           for( i = 0; i < s->num_children; i++ )
           {
                xfer_to_nic_time = g_tw_lookahead + TORUS_FAN_OUT_DELAY + tw_rand_exponential(lp->rng, (double)TORUS_FAN_OUT_DELAY/10);

                if(s->children[i] > 0)
                {
                        tw_lpid child_nic_id;

                        /* get global LP ID of the child node */
992 993 994
                        codes_mapping_get_lp_id(grp_name, LP_CONFIG_NM, NULL, 1,
                                s->children[i]/num_lps,
                                (s->children[i] % num_lps), &child_nic_id);
995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021
                        //e_new = codes_event_new(child_nic_id, xfer_to_nic_time, lp);
                        //msg_new = tw_event_data(e_new);
                        //memcpy(msg_new, msg, sizeof(nodes_message) + msg->remote_event_size_bytes);
			void* m_data;
			e_new = model_net_method_event_new(child_nic_id,
							xfer_to_nic_time,
					                lp, TORUS, (void**)&msg_new, &m_data);
		        memcpy(msg_new, msg, sizeof(nodes_message));
		        if (msg->remote_event_size_bytes){
			        memcpy(m_data, model_net_method_get_edata(TORUS, msg),
			                msg->remote_event_size_bytes);
      			}


                        msg_new->type = T_COLLECTIVE_FAN_OUT;
                        msg_new->sender_node = s->node_id;
                        tw_event_send(e_new);
                }
           }
         }
	//printf("\n Fan out phase completed %ld ", lp->gid);
        if(max_collective < tw_now(lp) - s->collective_init_time )
          {
              bf->c2 = 1;
              max_collective = tw_now(lp) - s->collective_init_time;
          }
}
1022

1023 1024
/*Returns the next neighbor to which the packet should be routed by using DOR (Taken from Ning's code of the torus model)*/
static void dimension_order_routing( nodes_state * s,
1025 1026
			     tw_lpid * dst_lp,
			     int * dim,
1027 1028
			     int * dir )
{
1029
     int dest[s->params->n_dims];
1030
     int dest_id = -1;
1031

1032 1033 1034 1035
  /* dummys - check later */
  *dim = -1;
  *dir = -1;

1036 1037
  to_dim_id(codes_mapping_get_lp_relative_id(*dst_lp, 0, 1),
          s->params->n_dims, s->params->dim_length, dest);
1038

1039
  for(int i = 0; i < s->params->n_dims; i++ )
1040
    {
1041
      if ( s->dim_position[ i ] - dest[ i ] > s->params->half_length[ i ] )
1042 1043 1044 1045 1046 1047
	{
	  dest_id = s->neighbour_plus_lpID[ i ];
	  *dim = i;
	  *dir = 1;
	  break;
	}
1048
      if ( s->dim_position[ i ] - dest[ i ] < -s->params->half_length[ i ] )
1049 1050 1051 1052 1053 1054
	{
	  dest_id = s->neighbour_minus_lpID[ i ];
	  *dim = i;
	  *dir = 0;
	  break;
	}
1055 1056
      if ( ( s->dim_position[i] - dest[i] <= s->params->half_length[i] ) &&
              ( s->dim_position[ i ] - dest[ i ] > 0 ) )
1057 1058 1059 1060 1061 1062
	{
	  dest_id = s->neighbour_minus_lpID[ i ];
	  *dim = i;
	  *dir = 0;
	  break;
	}
1063 1064
      if (( s->dim_position[i] - dest[i] >= -s->params->half_length[i] ) &&
              ( s->dim_position[ i ] - dest[ i ] < 0) )
1065 1066 1067 1068 1069 1070 1071
	{
	  dest_id = s->neighbour_plus_lpID[ i ];
	  *dim = i;
	  *dir = 1;
	  break;
	}
    }
1072 1073

  assert(*dim != -1 && *dir != -1);
1074 1075
  *dst_lp = codes_mapping_get_lpid_from_relative(dest_id, NULL, LP_CONFIG_NM,
          s->anno, 1);
1076
}
1077 1078 1079
static void packet_generate( nodes_state * ns,
        tw_bf * bf,
        nodes_message * msg,
1080 1081
        tw_lp * lp)
{
1082
    int tmp_dir=-1, tmp_dim=-1, queue, total_event_size;
1083
    tw_stime ts;
1084
    tw_event * e;
1085
    nodes_message *m;
1086

1087 1088
    tw_lpid intm_dst = msg->dest_lp;
    dimension_order_routing(ns, &intm_dst, &tmp_dim, &tmp_dir);
1089
    queue = tmp_dir + ( tmp_dim * 2 );
1090

1091
    msg->packet_ID = ns->packet_counter;
1092
    msg->my_N_hop = 0;
1093

1094
    if(lp->gid == TRACK && msg->packet_ID == TRACE)
1095
        tw_output(lp, "\n packet generated %lld at lp %d dest %d final dest %d",
1096
        msg->packet_ID, (int)lp->gid, (int)intm_dst, (int)msg->dest_lp);
1097

1098
    uint64_t num_chunks = msg->packet_size/ns->params->chunk_size;
1099
    if(msg->packet_size % ns->params->chunk_size)
1100
        num_chunks++;
1101 1102
    if(!num_chunks)
        num_chunks = 1;
1103

1104
    ns->packet_counter++;
1105

1106 1107
    msg->source_direction = tmp_dir;
    msg->source_dim = tmp_dim;
1108 1109
    msg->next_stop = intm_dst;
    msg->saved_queue = -1;
1110

1111 1112
    for(uint64_t j = 0; j < num_chunks; j++) {
        nodes_message_list * cur_chunk = (nodes_message_list *)malloc(
1113
                sizeof(nodes_message_list));
1114

1115
        init_nodes_message_list(cur_chunk, msg);
1116

1117 1118 1119 1120
        if(msg->remote_event_size_bytes + msg->local_event_size_bytes > 0) {
            cur_chunk->event_data = (char*)malloc(
                msg->remote_event_size_bytes + msg->local_event_size_bytes);
        }
1121

1122 1123 1124 1125 1126 1127
        void *m_data_src = model_net_method_get_edata(TORUS, msg);
        if (msg->remote_event_size_bytes){
            memcpy(cur_chunk->event_data, m_data_src, msg->remote_event_size_bytes);
        }
        if (msg->local_event_size_bytes){
            m_data_src = (char*)m_data_src + msg->remote_event_size_bytes;
1128
            memcpy((char*)cur_chunk->event_data + msg->remote_event_size_bytes,
1129 1130 1131
                m_data_src, msg->local_event_size_bytes);
        }
        cur_chunk->msg.chunk_id = j;
1132

1133
        append_to_node_message_list(ns->terminal_msgs,
1134 1135 1136 1137
            ns->terminal_msgs_tail, queue, cur_chunk);
        ns->terminal_length[queue] += ns->params->chunk_size;
        ns->all_term_length += ns->params->chunk_size;
    }
1138

1139 1140
   if(ns->in_send_loop[queue] == 0) {
       bf->c8 = 1;
1141
       ts = codes_local_latency(lp) + ns->params->cn_delay * msg->packet_size;
1142 1143 1144 1145 1146 1147 1148 1149
       e = model_net_method_event_new(lp->gid, ts, lp, TORUS, (void**)&m, NULL);
       m->type = SEND;
       m->source_direction = tmp_dir;
       m->source_dim = tmp_dim;
       ns->in_send_loop[queue] = 1;
       tw_event_send(e);
   }

1150
   /* record the statistics of the generated packets */
1151
   total_event_size = model_net_get_msg_sz(TORUS) + msg->remote_event_size_bytes + msg->local_event_size_bytes;
1152
   mn_stats* stat;
1153
   stat = model_net_find_stats(msg->category, ns->torus_stats_array);
1154
   stat->send_count++;
1155
   stat->send_bytes += msg->packet_size;
1156
   stat->send_time += (1/ns->params->link_bandwidth) * msg->packet_size;
1157 1158
   /* record the maximum ROSS event size */
   if(stat->max_event_size < total_event_size)
1159
	   stat->max_event_size = total_event_size;
1160
}
1161 1162
   /* record the maximum ROSS event size */

1163 1164 1165
static void packet_generate_rc( nodes_state * s,
		tw_bf * bf,
		nodes_message * msg,
1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177
		tw_lp * lp )
{
    s->packet_counter--;

    int queue = msg->source_direction + (msg->source_dim * 2);

    uint64_t num_chunks = msg->packet_size/s->params->chunk_size;
    if(msg->packet_size % s->params->chunk_size)
       num_chunks++;

     if(!num_chunks)
        num_chunks = 1;
1178

1179
     for(uint64_t j = 0; j < num_chunks; j++)
1180
     {
1181
       nodes_message_list* cur_entry = return_tail(
1182 1183 1184 1185 1186 1187 1188
              s->terminal_msgs, s->terminal_msgs_tail, queue);
       s->terminal_length[queue] -= s->params->chunk_size;
       s->all_term_length -= s->params->chunk_size;
       delete_nodes_message_list(cur_entry);
     }

     if(bf->c8) {
1189
        codes_local_latency_reverse(lp);
1190 1191 1192 1193
        s->in_send_loop[queue] = 0;
     }
     mn_stats* stat;
     stat = model_net_find_stats(msg->category, s->torus_stats_array);
1194
     stat->send_count--;
1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205
     stat->send_bytes -= msg->packet_size;
     stat->send_time -= (1/s->params->link_bandwidth) * msg->packet_size;
}

static void packet_send_rc(nodes_state * s,
        tw_bf * bf,
        nodes_message * msg,
        tw_lp * lp)
{
    int queue = msg->source_direction + (msg->source_dim * 2);

1206
    if(bf->c1 || bf->c4)
1207
    {
1208 1209 1210 1211
        if(bf->c24)
        {
            s->last_buf_full[queue] = msg->saved_busy_time;
        }
1212 1213 1214 1215 1216 1217
        s->in_send_loop[queue] = 1;
        return;
    }
     if(bf->c3) {
         s->buffer[queue][STATICQ] -= s->params->chunk_size;
     }
1218 1219

     codes_local_latency_reverse(lp);
1220 1221
     s->next_link_available_time[queue][0] = msg->saved_available_time;

1222 1223 1224
     nodes_message_list * cur_entry = rc_stack_pop(s->st);
     assert(cur_entry);

1225 1226
     if(bf->c20)
     {
1227
        s->link_traffic[queue] -= cur_entry->msg.packet_size % s->params->chunk_size;
1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239
     }

     if(bf->c21)
     {
        s->link_traffic[queue] -= s->params->chunk_size;
     }

     if(bf->c6)
     {
        codes_local_latency_reverse(lp);
     }

1240

1241 1242
     if(bf->c31)
     {
1243
         prepend_to_node_message_list(s->terminal_msgs,
1244
                  s->terminal_msgs_tail, queue, cur_entry);
1245
        s->terminal_length[queue] += s->params->chunk_size;
1246
        s->all_term_length += s->params->chunk_size;
1247 1248 1249 1250
     }

     if(bf->c8)
     {
1251
        prepend_to_node_message_list(s->pending_msgs[queue],
1252
                s->pending_msgs_tail[queue], STATICQ, cur_entry);
1253 1254 1255 1256
     }

     if(bf->c9)
     {
1257
         codes_local_latency_reverse(lp);
1258 1259 1260 1261 1262 1263 1264
     }

     if(bf->c10)
     {
        s->in_send_loop[queue] = 1;
     }
}
1265 1266
/* send a packet from one torus node to another torus node
 A packet can be up to 256 bytes on BG/L and BG/P and up to 512 bytes on BG/Q */
1267 1268 1269
static void packet_send( nodes_state * s,
         tw_bf * bf,
		 nodes_message * msg,
1270
		 tw_lp * lp )
1271
{
1272 1273 1274
    tw_stime ts;
    tw_event *e;
    nodes_message *m;
1275
    int isT = 0;
1276

1277
    int queue = msg->source_direction + (msg->source_dim * 2);
1278

1279
    if(s->pending_msgs[queue][STATICQ] == NULL
1280 1281 1282 1283 1284
        && s->terminal_msgs[queue] == NULL) {
        bf->c1 = 1;
        s->in_send_loop[queue] = 0;
        return;
    }
1285

1286
    nodes_message_list *cur_entry = s->pending_msgs[queue][STATICQ];
1287

1288 1289 1290
    if(cur_entry == NULL) {
        /* Bubble flow control method here, checking if there are 2 empty
         * buffer slots only then forward newly injected packets */
1291 1292 1293 1294 1295 1296
                if((s->buffer[queue][STATICQ] + (2 * s->params->chunk_size) <= s->params->buffer_size)) {
                    bf->c3 = 1;
                    s->buffer[queue][STATICQ] += s->params->chunk_size;
                    cur_entry = s->terminal_msgs[queue];
                    isT = 1;
                }
1297 1298
              if(cur_entry == NULL)
              {
1299
                bf->c4 = 1;
1300
                if(s->queued_msgs[queue][STATICQ] != NULL && s->last_buf_full[queue] == 0.0)
1301 1302 1303 1304 1305 1306
                {
                    bf->c24 = 1;
                    msg->saved_busy_time = s->last_buf_full[queue];
                    s->last_buf_full[queue] = tw_now(lp);
                }

1307 1308 1309
                s->in_send_loop[queue] = 0;
                return;
            }
1310
        }
1311

1312
    uint64_t num_chunks = cur_entry->msg.packet_size/s->params->chunk_size;
1313 1314
    if(cur_entry->msg.packet_size % s->params->chunk_size)
        num_chunks++;
1315

1316 1317 1318
    if(!num_chunks)
        num_chunks = 1;

1319
    double bytetime;
1320
/*    if((cur_entry->msg.packet_size % s->params->chunk_size) && (cur_entry->msg.chunk_id == num_chunks - 1))
1321 1322
    {
        bytetime = s->params->head_delay * (cur_entry->msg.packet_size % s->params->chunk_size);
1323 1324
    }
    else
1325
        bytetime = s->params->head_delay * s->params->chunk_size;
1326
*/
1327 1328
    bytetime = s->params->head_delay;

1329
    ts = codes_local_latency(lp) + bytetime + s->params->router_delay;
1330

1331
    //For reverse computation
1332 1333 1334
    msg->saved_available_time = s->next_link_available_time[queue][0];
    s->next_link_available_time[queue][0] = maxd( s->next_link_available_time[queue][0], tw_now(lp) );
    s->next_link_available_time[queue][0] += ts;
1335

1336 1337 1338 1339 1340 1341 1342 1343
    void * m_data;
    ts = s->next_link_available_time[queue][0] - tw_now(lp);
    e = model_net_method_event_new(cur_entry->msg.next_stop, ts,
            lp, TORUS, (void**)&m, &m_data);
    memcpy(m, &cur_entry->msg, sizeof(nodes_message));
    if (m->remote_event_size_bytes){
        memcpy(m_data, cur_entry->event_data, m->remote_event_size_bytes);
    }
1344

1345
//    if(cur_entry->msg.packet_ID == TRACE && lp->gid == TRACK)
1346
//        printf("\n packet sent %lld at lp %d dest %d final dest %d",
1347
//        msg->packet_ID, (int)lp->gid, (int)intm_dst, (int)msg->dest_lp);
1348 1349 1350 1351
    m->type = ARRIVAL;
    m->sender_node = lp->gid;
    m->local_event_size_bytes = 0; /* We just deliver the local event here */

1352 1353
    /*if(lp->gid == TRACK && msg->packet_ID == TRACE)
       {
1354
        tw_output(lp, "[%d] Packet sent: next stop %d dest %d chunk %d hops %d \n",
1355 1356
                lp->gid, m->next_stop, m->final_dest_gid, m->chunk_id, m->my_N_hop);
       }*/
1357 1358 1359 1360 1361 1362 1363 1364 1365
    tw_event_send( e );
    if((cur_entry->msg.packet_size % s->params->chunk_size) && (cur_entry->msg.chunk_id == num_chunks - 1)) {
        bf->c20 = 1;
        s->link_traffic[queue] += cur_entry->msg.packet_size %
            s->params->chunk_size;
    } else {
        bf->c21 = 1;
        s->link_traffic[queue] += s->params->chunk_size;
    }
1366

1367
    if(cur_entry->msg.chunk_id == num_chunks - 1)
1368
    {
1369 1370 1371 1372 1373 1374 1375
        /* Invoke an event on the sending server */
        if(cur_entry->msg.local_event_size_bytes > 0)
        {
            bf->c6 = 1;
            tw_event* e_new;
            nodes_message* m_new;
            void* local_event;
1376
            e_new = tw_event_new(cur_entry->msg.sender_svr, codes_local_latency(lp), lp);
1377
            m_new = tw_event_data(e_new);
1378
            local_event = (char*)cur_entry->event_data +
1379 1380 1381 1382 1383 1384
                cur_entry->msg.remote_event_size_bytes;
            memcpy(m_new, local_event, cur_entry->msg.local_event_size_bytes);
            tw_event_send(e_new);
        }
    }

1385
    /* isT=1 means that we can send the newly injected packets */
1386
    if(isT) {
1387
        bf->c31 = 1;
1388
        cur_entry = return_head(s->terminal_msgs, s->terminal_msgs_tail,
1389
            queue);
1390
        s->terminal_length[queue] -= s->params->chunk_size;