engine.c 82.4 KB
Newer Older
Pedro Gonnet's avatar
Pedro Gonnet committed
1
/*******************************************************************************
2
 * This file is part of SWIFT.
Pedro Gonnet's avatar
Pedro Gonnet committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
 * Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published
 * by the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 * 
 ******************************************************************************/

/* Config parameters. */
#include "../config.h"

/* Some standard headers. */
#include <stdio.h>
#include <stdlib.h>
26
#include <unistd.h>
Pedro Gonnet's avatar
Pedro Gonnet committed
27
28
29
30
31
32
33
34
#include <string.h>
#include <pthread.h>
#include <math.h>
#include <float.h>
#include <limits.h>
#include <omp.h>
#include <sched.h>

35
36
37
38
39
/* MPI headers. */
#ifdef WITH_MPI
    #include <mpi.h>
#endif

40
41
42
43
44
/* METIS headers. */
#ifdef HAVE_METIS
    #include <metis.h>
#endif

Pedro Gonnet's avatar
Pedro Gonnet committed
45
/* Local headers. */
46
#include "const.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
47
#include "cycle.h"
48
#include "atomic.h"
49
#include "timers.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
50
#include "const.h"
51
#include "vector.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
52
53
54
#include "lock.h"
#include "task.h"
#include "part.h"
55
#include "debug.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
56
#include "space.h"
57
#include "multipole.h"
58
#include "cell.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
59
#include "queue.h"
60
#include "scheduler.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
61
62
#include "engine.h"
#include "runner.h"
63
#include "proxy.h"
64
#include "error.h"
Pedro Gonnet's avatar
Pedro Gonnet committed
65

66
67
68
69
70
71
72
#ifdef LEGACY_GADGET2_SPH
#include "runner_iact_legacy.h"
#else
#include "runner_iact.h"
#endif


Pedro Gonnet's avatar
Pedro Gonnet committed
73
74
75
76
/* Convert cell location to ID. */
#define cell_getid( cdim , i , j , k ) ( (int)(k) + (cdim)[2]*( (int)(j) + (cdim)[1]*(int)(i) ) )


77
78
79
80
/** The rank of the engine as a global variable (for messages). */
int engine_rank;


81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
/**
 * @brief Check if a single particle is OK.
 *
 * @return Zero if all checks passed, non-zero otherwise.
 */
int engine_check_part(struct part *p) {
  if (p == NULL ||
      p->mass == 0.0f ||
      p->h == 0.0f ) {
    message("Bad particle data.");
    printParticle_single(p);
    return 1;
  } else if (p->x[0] == 0.0 && p->x[1] == 0.0 && p->x[2] == 0.0) {
    message("Bad particle location.");
    printParticle_single(p);
    return 1;
  } else {
    return 0;
  }
}

/**
 * @brief Check if a cell's data is reasonable, also check if its particles
 *        are OK.
 *
 * @return Zero if all checks passed, non-zero otherwise.
 */

void engine_check_cell(struct cell *c, void *data) {
  /* Check the cell data. */
  if (c->count == 0) {
    print_cell(c);
    error("Empty cell.");
  }
  
  /* Check the particles. */
  for (int k = 0; k < c->count; k++) {
    if (engine_check_part(&c->parts[k])) {
      print_cell(c);
      error("Bad particle in cell.");
    }
  }
  
  /* Check that the progeny, if any, contain all the particles. */
  if (c->split) {
    int count = 0;
    for (int k = 0; k < 8; k++) {
      if (c->progeny[k] != NULL) {
        count += c->progeny[k]->count;
      }
    }
    if (count != c->count) {
      print_cell(c);
      error("Progeny cell counts don't add up.");
    }
  }
}

/**
 * @brief Runs a series of checks to make sure we have no bad particles.
 */
 
void engine_check(struct engine *e) {
  /* Check all particles directly. */
  struct space *s = e->s;
  for (int k = 0; k < s->nr_parts; k++) {
    if (engine_check_part(&s->parts[k])) {
      error("Bad particle s->parts[%i], aborting.", k);
    }
  }
  
  /* Check each cell in the space. */
  space_map_cells_post(s, 1, &engine_check_cell, NULL);
}

156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
/**
 * @brief Link a density/force task to a cell.
 *
 * @param e The #engine.
 * @param l The #link.
 * @param t The #task.
 *
 * @return The new #link pointer.
 */
 
struct link *engine_addlink( struct engine *e , struct link *l , struct task *t ) {

    struct link *res = &e->links[ atomic_inc( &e->nr_links ) ];
    res->next = l;
    res->t = t;
    return res;

    }


/**
 * @brief Generate the ghost and kick tasks for a hierarchy of cells.
 *
 * @param e The #engine.
 * @param c The #cell.
 * @param super The super #cell.
 */
 
void engine_mkghosts ( struct engine *e , struct cell *c , struct cell *super ) {

    int k;
    struct scheduler *s = &e->sched;

    /* Am I the super-cell? */
    if ( super == NULL && c->nr_tasks > 0 ) {
    
        /* Remember me. */
        super = c;
        
        /* Local tasks only... */
        if ( c->nodeID == e->nodeID ) {
        
            /* Generate the ghost task. */
            c->ghost = scheduler_addtask( s , task_type_ghost , task_subtype_none , 0 , 0 , c , NULL , 0 );

            /* Add the kick2 task. */
            c->kick2 = scheduler_addtask( s , task_type_kick2 , task_subtype_none , 0 , 0 , c , NULL , 0 );

            /* Add the kick1 task if needed. */
            if ( !(e->policy & engine_policy_fixdt) )
                c->kick1 = scheduler_addtask( s , task_type_kick1 , task_subtype_none , 0 , 0 , c , NULL , 0 );
                
            }
            
        }
        
    /* Set the super-cell. */
    c->super = super;
        
    /* Recurse. */
    if ( c->split )
        for ( k = 0 ; k < 8 ; k++ )
            if ( c->progeny[k] != NULL )
                engine_mkghosts( e , c->progeny[k] , super );
    
    }


224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
/**
 * @brief Redistribute the particles amongst the nodes accorind
 *      to their cell's node IDs.
 *
 * @param e The #engine.
 */
 
void engine_redistribute ( struct engine *e ) {

#ifdef WITH_MPI

    int i, j, k, cid;
    int nr_nodes = e->nr_nodes, nodeID = e->nodeID;
    struct space *s = e->s;
    int my_cells = 0;
    int *cdim = s->cdim;
    struct cell *cells = s->cells;
241
    int nr_cells = s->nr_cells;
242
243
244
245
246

    /* Start by sorting the particles according to their nodes and
       getting the counts. */
    int *counts, *dest;
    struct part *parts = s->parts;
247
    double ih[3], dim[3];
248
    ih[0] = s->ih[0]; ih[1] = s->ih[1]; ih[2] = s->ih[2];
249
    dim[0] = s->dim[0]; dim[1] = s->dim[1]; dim[2] = s->dim[2];
250
251
252
253
254
    if ( ( counts = (int *)malloc( sizeof(int) * nr_nodes * nr_nodes ) ) == NULL ||
         ( dest = (int *)malloc( sizeof(int) * s->nr_parts ) ) == NULL )
        error( "Failed to allocate count and dest buffers." );
    bzero( counts , sizeof(int) * nr_nodes * nr_nodes );
    for ( k = 0 ; k < s->nr_parts ; k++ ) {
255
256
257
258
        for ( j = 0 ; j < 3 ; j++ ) {
            if ( parts[k].x[j] < 0.0 ) parts[k].x[j] += dim[j];
            else if ( parts[k].x[j] >= dim[j] ) parts[k].x[j] -= dim[j];
            }
259
260
261
262
263
264
265
266
267
        cid = cell_getid( cdim , parts[k].x[0]*ih[0] , parts[k].x[1]*ih[1] , parts[k].x[2]*ih[2] );
        dest[k] = cells[ cid ].nodeID;
        counts[ nodeID*nr_nodes + dest[k] ] += 1;
        }
    parts_sort( s->parts , s->xparts , dest , s->nr_parts , 0 , nr_nodes-1 );
    
    /* Get all the counts from all the nodes. */
    if ( MPI_Allreduce( MPI_IN_PLACE , counts , nr_nodes * nr_nodes , MPI_INT , MPI_SUM , MPI_COMM_WORLD ) != MPI_SUCCESS )
        error( "Failed to allreduce particle transfer counts." );
268

269
270
271
272
273
274
    /* Get the new number of parts for this node, be generous in allocating. */
    int nr_parts = 0;
    for ( k = 0 ; k < nr_nodes ; k++ )
        nr_parts += counts[ k*nr_nodes + nodeID ];
    struct part *parts_new;
    struct xpart *xparts_new, *xparts = s->xparts;
275
276
    if ( posix_memalign( (void **)&parts_new , part_align , sizeof(struct part) * nr_parts * 1.2 ) != 0 ||
         posix_memalign( (void **)&xparts_new , part_align , sizeof(struct xpart) * nr_parts * 1.2 ) != 0 )
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
        error( "Failed to allocate new part data." );
        
    /* Emit the sends and recvs for the particle data. */
    MPI_Request *reqs;
    if ( ( reqs = (MPI_Request *)malloc( sizeof(MPI_Request) * 4 * nr_nodes ) ) == NULL )
        error( "Failed to allocate MPI request list." );
    for ( k = 0 ; k < 4*nr_nodes ; k++ )
        reqs[k] = MPI_REQUEST_NULL;
    for ( i = 0 , j = 0 , k = 0 ; k < nr_nodes ; k++ ) {
        if ( k == nodeID && counts[ nodeID*nr_nodes + k ] > 0 ) {
            memcpy( &parts_new[j] , &parts[i] , sizeof(struct part) * counts[ k*nr_nodes + nodeID ] );
            memcpy( &xparts_new[j] , &xparts[i] , sizeof(struct xpart) * counts[ k*nr_nodes + nodeID ] );
            i += counts[ nodeID*nr_nodes + k ];
            j += counts[ k*nr_nodes + nodeID ];
            }
        if ( k != nodeID && counts[ nodeID*nr_nodes + k ] > 0 ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
293
            if ( MPI_Isend( &parts[i] , sizeof(struct part) * counts[ nodeID*nr_nodes + k ] , MPI_BYTE , k , 2*(nodeID*nr_nodes + k) + 0 , MPI_COMM_WORLD , &reqs[4*k] ) != MPI_SUCCESS )
294
                error( "Failed to isend parts to node %i." , k );
Pedro Gonnet's avatar
Pedro Gonnet committed
295
            if ( MPI_Isend( &xparts[i] , sizeof(struct xpart) * counts[ nodeID*nr_nodes + k ] , MPI_BYTE , k , 2*(nodeID*nr_nodes + k) + 1 , MPI_COMM_WORLD , &reqs[4*k+1] ) != MPI_SUCCESS )
296
297
298
299
                error( "Failed to isend xparts to node %i." , k );
            i += counts[ nodeID*nr_nodes + k ];
            }
        if ( k != nodeID && counts[ k*nr_nodes + nodeID ] > 0 ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
300
            if ( MPI_Irecv( &parts_new[j] , sizeof(struct part) * counts[ k*nr_nodes + nodeID ] , MPI_BYTE , k , 2*(k*nr_nodes + nodeID) + 0 , MPI_COMM_WORLD , &reqs[4*k+2] ) != MPI_SUCCESS )
301
                error( "Failed to emit irecv of parts from node %i." , k );
Pedro Gonnet's avatar
Pedro Gonnet committed
302
            if ( MPI_Irecv( &xparts_new[j] , sizeof(struct xpart) * counts[ k*nr_nodes + nodeID ] , MPI_BYTE , k , 2*(k*nr_nodes + nodeID) + 1 , MPI_COMM_WORLD , &reqs[4*k+3] ) != MPI_SUCCESS )
303
304
305
306
307
                error( "Failed to emit irecv of parts from node %i." , k );
            j += counts[ k*nr_nodes + nodeID ];
            }
        }
        
Pedro Gonnet's avatar
Pedro Gonnet committed
308
    /* Wait for all the sends and recvs to tumble in. */
309
310
311
312
    MPI_Status stats[4*nr_nodes];
    int res;
    if ( ( res = MPI_Waitall( 4*nr_nodes , reqs , stats ) ) != MPI_SUCCESS ) {
        for ( k = 0 ; k < 4*nr_nodes ; k++ ) {
313
314
315
316
317
          char buff[ MPI_MAX_ERROR_STRING ];
          int res;
          MPI_Error_string( stats[k].MPI_ERROR , buff , &res );
          message( "request %i has error '%s'." , k , buff );
          }
318
        error( "Failed during waitall for part data." );
319
320
        }

321
322
323
324
325
326
327
328
329
330
331
332
333
    /* Verify that all parts are in the right place. */
    /* for ( k = 0 ; k < nr_parts ; k++ ) {
        cid = cell_getid( cdim , parts_new[k].x[0]*ih[0] , parts_new[k].x[1]*ih[1] , parts_new[k].x[2]*ih[2] );
        if ( cells[ cid ].nodeID != nodeID )
            error( "Received particle (%i) that does not belong here (nodeID=%i)." , k , cells[ cid ].nodeID );
        } */
        
    /* Set the new part data, free the old. */
    free( parts );
    free( xparts );
    s->parts = parts_new;
    s->xparts = xparts_new;
    s->nr_parts = nr_parts;
334
    s->size_parts = 1.2*nr_parts;
335
336
    
    /* Be verbose about what just happened. */
337
338
339
    for ( k = 0 ; k < nr_cells ; k++ )
        if ( cells[k].nodeID == nodeID )
            my_cells += 1;
340
341
342
343
344
345
346
347
348
349
350
351
352
353
    message( "node %i now has %i parts in %i cells." , nodeID , nr_parts , my_cells );
    
    /* Clean up other stuff. */
    free( reqs );
    free( counts );
    free( dest );
        
#else
    error( "SWIFT was not compiled with MPI and METIS support." );
#endif

    }


354
/**
355
 * @brief Repartition the cells amongst the nodes.
356
357
358
359
360
361
362
363
 *
 * @param e The #engine.
 */
 
void engine_repartition ( struct engine *e ) {

#if defined(WITH_MPI) && defined(HAVE_METIS)

364
    int i, j, k, l, cid, cjd, ii, jj, kk, res;
365
    idx_t *inds, *nodeIDs;
366
367
    idx_t *weights_v, *weights_e;
    struct space *s = e->s;
368
    int nr_cells = s->nr_cells, my_cells = 0;
369
370
371
372
    struct cell *cells = s->cells;
    int ind[3], *cdim = s->cdim;
    struct task *t, *tasks = e->sched.tasks;
    struct cell *ci, *cj;
373
    int nr_nodes = e->nr_nodes, nodeID = e->nodeID;
374
    float wscale = 1e-3, vscale = 1e-3, wscale_buff;
375
376
    idx_t wtot = 0;
    const idx_t wmax = 1e9 / e->nr_nodes;
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
    
    /* Clear the repartition flag. */
    e->forcerepart = 0;
    
    /* Allocate the inds and weights. */
    if ( ( inds = (idx_t *)malloc( sizeof(idx_t) * 26*nr_cells ) ) == NULL ||
         ( weights_v = (idx_t *)malloc( sizeof(idx_t) * nr_cells ) ) == NULL ||
         ( weights_e = (idx_t *)malloc( sizeof(idx_t) * 26*nr_cells ) ) == NULL ||
         ( nodeIDs = (idx_t *)malloc( sizeof(idx_t) * nr_cells ) ) == NULL )
        error( "Failed to allocate inds and weights arrays." );
        
    /* Fill the inds array. */
    for ( cid = 0 ; cid < nr_cells ; cid++ ) {
        ind[0] = cells[cid].loc[0] / s->cells[cid].h[0] + 0.5;
        ind[1] = cells[cid].loc[1] / s->cells[cid].h[1] + 0.5;
        ind[2] = cells[cid].loc[2] / s->cells[cid].h[2] + 0.5;
        l = 0;
        for ( i = -1 ; i <= 1 ; i++ ) {
            ii = ind[0] + i;
            if ( ii < 0 ) ii += cdim[0];
            else if ( ii >= cdim[0] ) ii -= cdim[0];
            for ( j = -1 ; j <= 1 ; j++ ) {
                jj = ind[1] + j;
                if ( jj < 0 ) jj += cdim[1];
                else if ( jj >= cdim[1] ) jj -= cdim[1];
                for ( k = -1 ; k <= 1 ; k++ ) {
                    kk = ind[2] + k;
                    if ( kk < 0 ) kk += cdim[2];
                    else if ( kk >= cdim[2] ) kk -= cdim[2];
                    if ( i || j || k ) {
                        inds[ cid*26 + l ] = cell_getid( cdim , ii , jj , kk );
                        l += 1;
                        }
                    }
                }
            }
        }
        
    /* Init the weights arrays. */
416
417
    bzero( weights_e , sizeof(idx_t) * 26*nr_cells );
    bzero( weights_v , sizeof(idx_t) * nr_cells );
418
419
420
421
422
423
424
425
426
427
    
    /* Loop over the tasks... */
    for ( j = 0 ; j < e->sched.nr_tasks ; j++ ) {
    
        /* Get a pointer to the kth task. */
        t = &tasks[j];
        
        /* Skip un-interesting tasks. */
        if ( t->type != task_type_self &&
             t->type != task_type_pair &&
428
429
430
431
             t->type != task_type_sub &&
             t->type != task_type_ghost &&
             t->type != task_type_kick1 &&
             t->type != task_type_kick2 )
432
            continue;
433
434
            
        /* Get the task weight. */
435
        idx_t w = ( t->toc - t->tic ) * wscale;
436
437
        if ( w < 0 )
            error( "Bad task weight (%i)." , w );
438
439
440
            
        /* Do we need to re-scale? */
        wtot += w;
441
        while (wtot > wmax) {
442
443
          wscale /= 2;
          wtot /= 2;
444
          w /= 2;
445
446
447
          for (k = 0; k < 26 * nr_cells; k++) weights_e[k] *= 0.5;
          for (k = 0; k < nr_cells; k++) weights_v[k] *= 0.5;
        }
448
449
450
451
452
453
454
455
456
457
458
459
        
        /* Get the top-level cells involved. */
        for ( ci = t->ci ; ci->parent != NULL ; ci = ci->parent );
        if ( t->cj != NULL )
            for ( cj = t->cj ; cj->parent != NULL ; cj = cj->parent );
        else
            cj = NULL;
            
        /* Get the cell IDs. */
        cid = ci - cells;
            
        /* Different weights for different tasks. */
460
461
462
463
464
465
466
467
468
469
470
        if ( t->type == task_type_ghost ||
             t->type == task_type_kick1 || 
             t->type == task_type_kick2 ) {
             
            /* Particle updates add only to vertex weight. */
            weights_v[cid] += w;
            
            }
        
        /* Self interaction? */     
        else if ( ( t->type == task_type_self && ci->nodeID == nodeID ) ||
471
472
473
             ( t->type == task_type_sub && cj == NULL && ci->nodeID == nodeID ) ) {
        
            /* Self interactions add only to vertex weight. */
474
            weights_v[cid] += w;
475
476
477
478
479
480
481
482
483
484
485
            
            }
            
        /* Pair? */
        else if ( t->type == task_type_pair ||
                  ( t->type == task_type_sub && cj != NULL ) ) {
                  
            /* In-cell pair? */
            if ( ci == cj ) {
            
                /* Add weight to vertex for ci. */
486
                weights_v[cid] += w;
487
488
489
490
491
492
493
494
495
496
497
            
                }
                
            /* Distinct cells with local ci? */
            else if ( ci->nodeID == nodeID ) {
            
                /* Index of the jth cell. */
                cjd = cj - cells;
                
                /* Add half of weight to each cell. */
                if ( ci->nodeID == nodeID )
498
                    weights_v[cid] += 0.5 * w;
499
                if ( cj->nodeID == nodeID )
500
                    weights_v[cjd] += 0.5 * w;
501
502
503
                    
                /* Add Weight to edge. */
                for ( k = 26*cid ; inds[k] != cjd ; k++ );
504
                weights_e[ k ] += w;
505
                for ( k = 26*cjd ; inds[k] != cid ; k++ );
506
                weights_e[ k ] += w;
507
508
509
510
511
512
513
            
                }
                  
            }
    
        }
        
514
515
516
517
518
519
520
    /* Get the minimum scaling and re-scale if necessary. */
    if ( ( res = MPI_Allreduce( &wscale , &wscale_buff , 1 , MPI_FLOAT , MPI_MIN , MPI_COMM_WORLD ) ) != MPI_SUCCESS ) {
        char buff[ MPI_MAX_ERROR_STRING ];
        MPI_Error_string( res , buff , &i );
        error( "Failed to allreduce the weight scales (%s)." , buff );
    }
    if (wscale_buff != wscale) {
521
      float scale = wscale_buff / wscale;
522
523
524
525
      for (k = 0; k < 26 * nr_cells; k++) weights_e[k] *= scale;
      for (k = 0; k < nr_cells; k++) weights_v[k] *= scale;
    }
        
526
    /* Merge the weights arrays accross all nodes. */
527
#if IDXTYPEWIDTH==32
528
    if ( ( res = MPI_Reduce( ( nodeID == 0 ) ? MPI_IN_PLACE : weights_v , weights_v , nr_cells , MPI_INT , MPI_SUM , 0 , MPI_COMM_WORLD ) ) != MPI_SUCCESS ) {
529
530
531
#else
    if ( ( res = MPI_Reduce( ( nodeID == 0 ) ? MPI_IN_PLACE : weights_v , weights_v , nr_cells , MPI_LONG_LONG_INT , MPI_SUM , 0 , MPI_COMM_WORLD ) ) != MPI_SUCCESS ) {
#endif
532
533
534
535
        char buff[ MPI_MAX_ERROR_STRING ];
        MPI_Error_string( res , buff , &i );
        error( "Failed to allreduce vertex weights (%s)." , buff );
        }
536
#if IDXTYPEWIDTH==32
537
    if ( MPI_Reduce( ( nodeID == 0 ) ? MPI_IN_PLACE : weights_e , weights_e , 26*nr_cells , MPI_INT , MPI_SUM , 0 , MPI_COMM_WORLD ) != MPI_SUCCESS )
538
539
540
541
#else
    if ( MPI_Reduce( ( nodeID == 0 ) ? MPI_IN_PLACE : weights_e , weights_e , 26*nr_cells , MPI_LONG_LONG_INT , MPI_SUM , 0 , MPI_COMM_WORLD ) != MPI_SUCCESS )
#endif
       error( "Failed to allreduce edge weights." );
542
543
544
545
        
    /* As of here, only one node needs to compute the partition. */
    if ( nodeID == 0 ) {
    
546
        /* Check that the edge weights are fully symmetric. */
547
        /* for ( cid = 0 ; cid < nr_cells ; cid++ )
548
549
550
551
552
            for ( k = 0 ; k < 26 ; k++ ) {
                cjd = inds[ cid*26 + k ];
                for ( j = 26*cjd ; inds[j] != cid ; j++ );
                if ( weights_e[ cid*26+k ] != weights_e[ j ] )
                    error( "Unsymmetric edge weights detected (%i vs %i)." , weights_e[ cid*26+k ] , weights_e[ j ] );
553
                } */
554
555
556
        /* int w_min = weights_e[0], w_max = weights_e[0], w_tot = weights_e[0];
        for ( k = 1 ; k < 26*nr_cells ; k++ ) {
            w_tot += weights_e[k];
557
558
559
560
            if ( weights_e[k] < w_min )
                w_min = weights_e[k];
            else if ( weights_e[k] > w_max )
                w_max = weights_e[k];
561
562
563
564
565
            }
        message( "edge weights in [ %i , %i ], tot=%i." , w_min , w_max , w_tot );
        w_min = weights_e[0], w_max = weights_e[0]; w_tot = weights_v[0];
        for ( k = 1 ; k < nr_cells ; k++ ) {
            w_tot += weights_v[k];
566
567
568
569
            if ( weights_v[k] < w_min )
                w_min = weights_v[k];
            else if ( weights_v[k] > w_max )
                w_max = weights_v[k];
570
571
            }
        message( "vertex weights in [ %i , %i ], tot=%i." , w_min , w_max , w_tot ); */
572
573
574
575
                
        /* Make sure there are no zero weights. */
        for ( k = 0 ; k < 26*nr_cells ; k++ )
            if ( weights_e[k] == 0 )
Pedro Gonnet's avatar
typo.    
Pedro Gonnet committed
576
                weights_e[k] = 1;
577
        for ( k = 0 ; k < nr_cells ; k++ )
578
            if ( ( weights_v[k] *= vscale ) == 0 )
579
                weights_v[k] = 1;
580
    
581
582
583
584
585
586
587
588
        /* Allocate and fill the connection array. */
        idx_t *offsets;
        if ( ( offsets = (idx_t *)malloc( sizeof(idx_t) * (nr_cells + 1) ) ) == NULL )
            error( "Failed to allocate offsets buffer." );
        offsets[0] = 0;
        for ( k = 0 ; k < nr_cells ; k++ )
            offsets[k+1] = offsets[k] + 26;
            
589
590
        /* Set the METIS options. +1 to keep the GCC sanitizer happy. */
        idx_t options[METIS_NOPTIONS+1];
591
592
593
594
        METIS_SetDefaultOptions( options );
        options[ METIS_OPTION_OBJTYPE ] = METIS_OBJTYPE_CUT;
        options[ METIS_OPTION_NUMBERING ] = 0;
        options[ METIS_OPTION_CONTIG ] = 1;
595
596
597
        options[ METIS_OPTION_NCUTS ] = 10;
        options[ METIS_OPTION_NITER ] = 20;
        // options[ METIS_OPTION_UFACTOR ] = 1;
598
        
599
600
601
602
        /* Set the initial partition, although this is probably ignored. */
        for ( k = 0 ; k < nr_cells ; k++ )
            nodeIDs[k] = cells[k].nodeID;
            
603
        /* Call METIS. */
604
        idx_t one = 1, idx_nr_cells = nr_cells, idx_nr_nodes = nr_nodes;
605
        idx_t objval;
606
        if ( METIS_PartGraphRecursive( &idx_nr_cells , &one , offsets , inds , weights_v , NULL , weights_e , &idx_nr_nodes , NULL , NULL , options , &objval , nodeIDs ) != METIS_OK )
607
            error( "Call to METIS_PartGraphKway failed." );
608

609
        /* Dump the 3d array of cell IDs. */
610
        /* printf( "engine_repartition: nodeIDs = reshape( [" );
611
        for ( i = 0 ; i < cdim[0]*cdim[1]*cdim[2] ; i++ )
Pedro Gonnet's avatar
Pedro Gonnet committed
612
            printf( "%i " , (int)nodeIDs[ i ] );
613
        printf("] ,%i,%i,%i);\n",cdim[0],cdim[1],cdim[2]); */
614
615
616
617
    
        }
        
    /* Broadcast the result of the partition. */
618
#if IDXTYPEWIDTH==32
619
620
    if ( MPI_Bcast( nodeIDs , nr_cells , MPI_INT , 0 , MPI_COMM_WORLD ) != MPI_SUCCESS )
        error( "Failed to bcast the node IDs." );
621
622
623
624
#else
    if ( MPI_Bcast( nodeIDs , nr_cells , MPI_LONG_LONG_INT , 0 , MPI_COMM_WORLD ) != MPI_SUCCESS )
        error( "Failed to bcast the node IDs." );
#endif
625
626
        
    /* Set the cell nodeIDs and clear any non-local parts. */
627
    for ( k = 0 ; k < nr_cells ; k++ ) {
628
        cells[k].nodeID = nodeIDs[k];
629
630
631
        if ( nodeIDs[k] == nodeID )
            my_cells += 1;
        }
632
633
634
635
636
637
638
639
640
641
642
643
644
        
    /* Clean up. */
    free( inds );
    free( weights_v );
    free( weights_e );
    free( nodeIDs );
        
    /* Now comes the tricky part: Exchange particles between all nodes.
       This is done in two steps, first allreducing a matrix of 
       how many particles go from where to where, then re-allocating
       the parts array, and emiting the sends and receives.
       Finally, the space, tasks, and proxies need to be rebuilt. */
       
645
646
    /* Redistribute the particles between the nodes. */
    engine_redistribute( e );
647
648
649
650
651
652
653
654
655
656
657
658
        
    /* Make the proxies. */
    engine_makeproxies( e );
        
    /* Tell the engine it should re-build whenever possible */
    e->forcerebuild = 1;
    
#else
    error( "SWIFT was not compiled with MPI and METIS support." );
#endif

    }
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
    
    
/**
 * @brief Add up/down gravity tasks to a cell hierarchy.
 *
 * @param e The #engine.
 * @param c The #cell
 * @param up The upward gravity #task.
 * @param down The downward gravity #task.
 */
 
void engine_addtasks_grav ( struct engine *e , struct cell *c , struct task *up , struct task *down ) {

    /* Link the tasks to this cell. */
    c->grav_up = up;
    c->grav_down = down;
    
    /* Recurse? */
    if ( c->split )
        for ( int k = 0 ; k < 8 ; k++ )
            if ( c->progeny[k] != NULL )
                engine_addtasks_grav( e , c->progeny[k] , up , down );

    }
683
684


685
686
687
688
/**
 * @brief Add send tasks to a hierarchy of cells.
 *
 * @param e The #engine.
689
690
 * @param ci The sending #cell.
 * @param cj The receiving #cell
691
692
693
694
 */

void engine_addtasks_send ( struct engine *e , struct cell *ci , struct cell *cj ) {

Pedro Gonnet's avatar
Pedro Gonnet committed
695
    int k;
696
    struct link *l = NULL;
697
    struct scheduler *s = &e->sched;
698
699

    /* Check if any of the density tasks are for the target node. */
700
701
702
    for ( l = ci->density ; l != NULL ; l = l->next )
        if ( l->t->ci->nodeID == cj->nodeID ||
             ( l->t->cj != NULL && l->t->cj->nodeID == cj->nodeID ) )
703
704
705
            break;

    /* If so, attach send tasks. */
706
    if ( l != NULL ) {
707
708

        /* Create the tasks. */
709
710
        struct task *t_xv = scheduler_addtask( &e->sched , task_type_send , task_subtype_none , 2*ci->tag , 0 , ci , cj , 0 );
        struct task *t_rho = scheduler_addtask( &e->sched , task_type_send , task_subtype_none , 2*ci->tag + 1 , 0 , ci , cj , 0 );
711
712

        /* The send_rho task depends on the cell's ghost task. */
713
        scheduler_addunlock( s , ci->super->ghost , t_rho );
714
715

        /* The send_rho task should unlock the super-cell's kick2 task. */
716
        scheduler_addunlock( s , t_rho , ci->super->kick2 );
717
718

        /* The send_xv task should unlock the super-cell's ghost task. */
719
        scheduler_addunlock( s , t_xv , ci->super->ghost );
720
        
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
        }
        
    /* Recurse? */
    else if ( ci->split )
        for ( k = 0 ; k < 8 ; k++ )
            if ( ci->progeny[k] != NULL )
                engine_addtasks_send( e , ci->progeny[k] , cj );

    }


/**
 * @brief Add recv tasks to a hierarchy of cells.
 *
 * @param e The #engine.
 * @param c The #cell.
 * @param t_xv The recv_xv #task, if it has already been created.
 * @param t_rho The recv_rho #task, if it has already been created.
 */

void engine_addtasks_recv ( struct engine *e , struct cell *c , struct task *t_xv , struct task *t_rho ) {

Pedro Gonnet's avatar
Pedro Gonnet committed
743
    int k;
744
    struct scheduler *s = &e->sched;
745
746

    /* Do we need to construct a recv task? */
747
    if ( t_xv == NULL && c->nr_density > 0 ) {
748
749
    
        /* Create the tasks. */
750
751
        t_xv = c->recv_xv = scheduler_addtask( &e->sched , task_type_recv , task_subtype_none , 2*c->tag , 0 , c , NULL , 0 );
        t_rho = c->recv_rho = scheduler_addtask( &e->sched , task_type_recv , task_subtype_none , 2*c->tag + 1 , 0 , c , NULL , 0 );
752
753
754
        
        }
        
755
756
757
758
759
760
761
762
763
764
    /* Add dependencies. */
    for ( struct link *l = c->density ; l != NULL ; l = l->next ) {
        scheduler_addunlock( s , t_xv , l->t );
        scheduler_addunlock( s , l->t , t_rho );
        }
    for ( struct link *l = c->force ; l != NULL ; l = l->next )
        scheduler_addunlock( s , t_rho , l->t );
    if ( c->sorts != NULL )
        scheduler_addunlock( s , t_xv , c->sorts );
    
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
    /* Recurse? */
    if ( c->split )
        for ( k = 0 ; k < 8 ; k++ )
            if ( c->progeny[k] != NULL )
                engine_addtasks_recv( e , c->progeny[k] , t_xv , t_rho );

    }


/**
 * @brief Exchange cell structures with other nodes.
 *
 * @param e The #engine.
 */
 
void engine_exchange_cells ( struct engine *e ) {

#ifdef WITH_MPI

    int j, k, pid, count = 0;
    struct pcell *pcells;
786
787
788
789
    struct space *s = e->s;
    struct cell *cells = s->cells;
    int nr_cells = s->nr_cells;
    int nr_proxies = e->nr_proxies;
790
    int offset[ nr_cells ];
791
792
    MPI_Request reqs_in[ engine_maxproxies ];
    MPI_Request reqs_out[ engine_maxproxies ];
793
    MPI_Status status;
794
    struct part *parts = &s->parts[ s->nr_parts ];
795
796
797
798
799
800
801
802
803
804
805
806
807
    
    /* Run through the cells and get the size of the ones that will be sent off. */
    for ( k = 0 ; k < nr_cells ; k++ ) {
        offset[k] = count;
        if ( cells[k].sendto )
            count += ( cells[k].pcell_size = cell_getsize( &cells[k] ) );
        }
        
    /* Allocate the pcells. */
    if ( ( pcells = (struct pcell *)malloc( sizeof(struct pcell) * count ) ) == NULL )
        error( "Failed to allocate pcell buffer." );
        
    /* Pack the cells. */
808
    cell_next_tag = 0;
809
810
811
812
813
814
815
    for ( k = 0 ; k < nr_cells ; k++ )
        if ( cells[k].sendto ) {
            cell_pack( &cells[k] , &pcells[ offset[k] ] );
            cells[k].pcell = &pcells[ offset[k] ];
            }

    /* Launch the proxies. */
816
    for ( k = 0 ; k < nr_proxies ; k++ ) {
817
        proxy_cells_exch1( &e->proxies[k] );
818
        reqs_in[k] = e->proxies[k].req_cells_count_in;
Pedro Gonnet's avatar
Pedro Gonnet committed
819
        reqs_out[k] = e->proxies[k].req_cells_count_out;
820
821
822
        }
        
    /* Wait for each count to come in and start the recv. */
823
824
    for ( k = 0 ; k < nr_proxies ; k++ ) {
        if ( MPI_Waitany( nr_proxies , reqs_in , &pid , &status ) != MPI_SUCCESS ||
825
826
827
828
829
830
             pid == MPI_UNDEFINED )
            error( "MPI_Waitany failed." );
        // message( "request from proxy %i has arrived." , pid );
        proxy_cells_exch2( &e->proxies[pid] );
        }
        
Pedro Gonnet's avatar
Pedro Gonnet committed
831
832
833
834
    /* Wait for all the sends to have finnished too. */
    if ( MPI_Waitall( nr_proxies , reqs_out , MPI_STATUSES_IGNORE ) != MPI_SUCCESS )
        error( "MPI_Waitall on sends failed." );
        
835
    /* Set the requests for the cells. */
836
837
838
839
    for ( k = 0 ; k < nr_proxies ; k++ ) {
        reqs_in[k] = e->proxies[k].req_cells_in;
        reqs_out[k] = e->proxies[k].req_cells_out;
        }
840
841
    
    /* Wait for each pcell array to come in from the proxies. */
842
843
    for ( k = 0 ; k < nr_proxies ; k++ ) {
        if ( MPI_Waitany( nr_proxies , reqs_in , &pid , &status ) != MPI_SUCCESS ||
844
845
             pid == MPI_UNDEFINED )
            error( "MPI_Waitany failed." );
846
847
848
849
850
851
        // message( "cell data from proxy %i has arrived." , pid );
        for ( count = 0 , j = 0 ; j < e->proxies[pid].nr_cells_in ; j++ )
            count += cell_unpack( &e->proxies[pid].pcells_in[count] , e->proxies[pid].cells_in[j] , e->s );
        }
        
    /* Wait for all the sends to have finnished too. */
852
    if ( MPI_Waitall( nr_proxies , reqs_out , MPI_STATUSES_IGNORE ) != MPI_SUCCESS )
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
        error( "MPI_Waitall on sends failed." );
        
    /* Count the number of particles we need to import and re-allocate
       the buffer if needed. */
    for ( count = 0 , k = 0 ; k < nr_proxies ; k++ )
        for ( j = 0 ; j < e->proxies[k].nr_cells_in ; j++ )
            count += e->proxies[k].cells_in[j]->count;
    if ( count > s->size_parts_foreign ) {
        if ( s->parts_foreign != NULL )
            free( s->parts_foreign );
        s->size_parts_foreign = 1.1 * count;
        if ( posix_memalign( (void **)&s->parts_foreign , part_align , sizeof(struct part) * s->size_parts_foreign ) != 0 )
            error( "Failed to allocate foreign part data." );
        }
        
    /* Unpack the cells and link to the particle data. */
    parts = s->parts_foreign;
    for ( k = 0 ; k < nr_proxies ; k++ ) {
        for ( count = 0 , j = 0 ; j < e->proxies[k].nr_cells_in ; j++ ) {
            count += cell_link( e->proxies[k].cells_in[j] , parts );
            parts = &parts[ e->proxies[k].cells_in[j]->count ];
874
875
            }
        }
876
877
878
879
880
    s->nr_parts_foreign = parts - s->parts_foreign;
        
    /* Is the parts buffer large enough? */
    if ( s->nr_parts_foreign > s->size_parts_foreign )
        error( "Foreign parts buffer too small." );
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
        
    /* Free the pcell buffer. */
    free( pcells );
    
#else
    error( "SWIFT was not compiled with MPI support." );
#endif

    }


/**
 * @brief Exchange straying parts with other nodes.
 *
 * @param e The #engine.
896
 * @param offset The index in the parts array as of which the foreign parts reside.
897
898
899
900
901
902
 * @param ind The ID of the foreign #cell.
 * @param N The number of stray parts.
 *
 * @return The number of arrived parts copied to parts and xparts.
 */
 
903
int engine_exchange_strays ( struct engine *e , int offset , int *ind , int N ) {
904
905
906

#ifdef WITH_MPI

907
    int k, pid, count = 0, nr_in = 0, nr_out = 0;
Pedro Gonnet's avatar
Pedro Gonnet committed
908
909
    MPI_Request reqs_in[ 2*engine_maxproxies ];
    MPI_Request reqs_out[ 2*engine_maxproxies ];
910
911
    MPI_Status status;
    struct proxy *p;
912
    struct space *s = e->s;
913
914
915
916
917
918
919

    /* Re-set the proxies. */
    for ( k = 0 ; k < e->nr_proxies ; k++ )
        e->proxies[k].nr_parts_out = 0;
    
    /* Put the parts into the corresponding proxies. */
    for ( k = 0 ; k < N ; k++ ) {
920
921
922
923
        int node_id = e->s->cells[ ind[k] ].nodeID;
        if (node_id < 0 || node_id >= e->nr_nodes)
          error("Bad node ID %i.", node_id);
        pid = e->proxy_ind[ node_id ];
924
        if ( pid < 0 )
925
926
927
            error( "Do not have a proxy for the requested nodeID %i for part with id=%llu, x=[%e,%e,%e].",
              node_id, s->parts[offset + k].id, s->parts[offset + k].x[0],
              s->parts[offset + k].x[1], s->parts[offset + k].x[2] );
928
        proxy_parts_load( &e->proxies[pid] , &s->parts[offset + k] , &s->xparts[offset + k] , 1 );
929
930
931
932
933
        }
    
    /* Launch the proxies. */
    for ( k = 0 ; k < e->nr_proxies ; k++ ) {
        proxy_parts_exch1( &e->proxies[k] );
934
        reqs_in[k] = e->proxies[k].req_parts_count_in;
Pedro Gonnet's avatar
Pedro Gonnet committed
935
        reqs_out[k] = e->proxies[k].req_parts_count_out;
936
937
938
939
        }
        
    /* Wait for each count to come in and start the recv. */
    for ( k = 0 ; k < e->nr_proxies ; k++ ) {
940
        if ( MPI_Waitany( e->nr_proxies , reqs_in , &pid , &status ) != MPI_SUCCESS ||
941
942
943
944
945
946
             pid == MPI_UNDEFINED )
            error( "MPI_Waitany failed." );
        // message( "request from proxy %i has arrived." , pid );
        proxy_parts_exch2( &e->proxies[pid] );
        }
        
Pedro Gonnet's avatar
Pedro Gonnet committed
947
948
949
950
    /* Wait for all the sends to have finnished too. */
    if ( MPI_Waitall( e->nr_proxies , reqs_out , MPI_STATUSES_IGNORE ) != MPI_SUCCESS )
        error( "MPI_Waitall on sends failed." );
        
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
    /* Count the total number of incomming particles and make sure we have
       enough space to accommodate them. */
    int count_in = 0;
    for ( k = 0 ; k < e->nr_proxies ; k++ )
      count_in += e->proxies[k].nr_parts_in;
    message("sent out %i particles, got %i back.", N, count_in);
    if ( offset + count_in > s->size_parts ) {
      s->size_parts = (offset + count_in) * 1.05;
      struct part *parts_new;
      struct xpart *xparts_new;
      if ( posix_memalign( (void **)&parts_new , part_align , sizeof(struct part) * s->size_parts ) != 0 ||
           posix_memalign( (void **)&xparts_new , part_align , sizeof(struct xpart) * s->size_parts ) != 0 )
          error( "Failed to allocate new part data." );
      memcpy( parts_new , s->parts , sizeof(struct part) * offset );
      memcpy( xparts_new , s->xparts , sizeof(struct xpart) * offset );
      free( s->parts );
      free( s->xparts );
      s->parts = parts_new;
      s->xparts = xparts_new;
    }
        
    /* Collect the requests for the particle data from the proxies. */
973
    for ( k = 0 ; k < e->nr_proxies ; k++ ) {
974
        if ( e->proxies[k].nr_parts_in > 0 ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
975
976
            reqs_in[2*k] = e->proxies[k].req_parts_in;
            reqs_in[2*k+1] = e->proxies[k].req_xparts_in;
977
978
979
            nr_in += 1;
            }
        else
Pedro Gonnet's avatar
Pedro Gonnet committed
980
            reqs_in[2*k] = reqs_in[2*k+1] = MPI_REQUEST_NULL;
981
        if ( e->proxies[k].nr_parts_out > 0 ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
982
983
            reqs_out[2*k] = e->proxies[k].req_parts_out;
            reqs_out[2*k+1] = e->proxies[k].req_xparts_out;
984
985
986
            nr_out += 1;
            }
        else
Pedro Gonnet's avatar
Pedro Gonnet committed
987
            reqs_out[2*k] = reqs_out[2*k+1] = MPI_REQUEST_NULL;
988
        }
989
990
991
    
    /* Wait for each part array to come in and collect the new
       parts from the proxies. */
992
    for ( k = 0 ; k < 2*(nr_in + nr_out) ; k++ ) {
993
994
        int err;
        if ( ( err = MPI_Waitany( 2*e->nr_proxies , reqs_in , &pid , &status ) ) != MPI_SUCCESS ) {
995
996
997
998
999
            char buff[ MPI_MAX_ERROR_STRING ];
            int res;
            MPI_Error_string( err , buff , &res );
                error( "MPI_Waitany failed (%s)." , buff );
            }
1000
        if ( pid == MPI_UNDEFINED )
For faster browsing, not all history is shown. View entire blame