Skip to content
Snippets Groups Projects
  1. Jun 28, 2016
    • Benjamin Cumming's avatar
      Merge profiler updates into spike handling code · 0cdeedbc
      Benjamin Cumming authored
      - profiler generates one report per MPI rank
      - estimates the thread imbalance per rank
      - generates a json file with profiling stats for each rank
      - works with/without MPI
      - works with/without TBB
      
      Conflicts:
      	miniapp/miniapp.cpp
      0cdeedbc
    • Benjamin Cumming's avatar
      generalize global policy · 05a7452e
      Benjamin Cumming authored
      - move definition of `global_policy` to header file
        src/communication/global_policy.hpp
      - the `#ifdef WITH_MPI` guards go there so that
          - they don't pollute user code
          - they are available throughout the application
      - small cleanup of a couple of style points in the mpi code
      05a7452e
    • Benjamin Cumming's avatar
      WIP · 861ff190
      Benjamin Cumming authored
      861ff190
    • Sam Yates's avatar
      Re-enaable WITH_MPI=OFF builds · 168f84d2
      Sam Yates authored
      * Make global_policy methods static
      * Move global_policy init/finalize into static methods
      * Make miniapp use only global_policy methods for
        setup, rank, etc.
      168f84d2
  2. Jun 27, 2016
  3. Jun 24, 2016
  4. Jun 23, 2016
  5. Jun 22, 2016
  6. Jun 17, 2016
  7. Jun 16, 2016
  8. Jun 15, 2016
    • Benjamin Cumming's avatar
      3553ac8b
    • Benjamin Cumming's avatar
      ... · 69fd3184
      Benjamin Cumming authored
      69fd3184
    • Vasileios Karakasis's avatar
      Low-level algorithms for manipulating cell trees. · 526953b5
      Vasileios Karakasis authored
      At this low level a cell tree is just a sequence of parent indices,
      where each parent index is the parent of the current index in the
      sequence. There four basic algorithms:
      
      1. child_count(parent_index):
         Computes the number of children for each node in parent_index
         	Time: O(N), Space: O(1)
      2. branches(parent_index):
         Returns a set of the branching nodes in parent_index, last branch
         index equals the parent_index's size.
      	 Time: O(N), Space: O(N)
      3. expand_branches(branch_index):
         Takes a branch_index (result from branches()) and expands it at the
         size of the original tree with all the nodes inside a branch having
         the same number.
               Time: O(parent_index), Space: O(1)
      4. make_parent_index(parent_index, branch_index):
         Return a compacted tree (single node per branch) from parent_index
         and its corresponding branch_index.
      	Time: O(N), Space: O(N)
      
      There is another utility function as well:
      
      find_branch(branch_index, nid):
          Returns the id of the branch where nid belongs to.
      	Time: O(N), Space: O(1)
      526953b5
    • Ben Cumming's avatar
      Merge pull request #2 from eth-cscs/master · c5b205c5
      Ben Cumming authored
      merge to my fork
      c5b205c5
  9. Jun 11, 2016
  10. Jun 10, 2016