1. 23 Apr, 2019 1 commit
  2. 17 Apr, 2019 1 commit
  3. 09 Apr, 2019 1 commit
  4. 03 Apr, 2019 1 commit
  5. 24 Jan, 2019 1 commit
  6. 05 Jun, 2018 1 commit
  7. 26 Feb, 2018 2 commits
  8. 02 Feb, 2018 1 commit
  9. 20 Sep, 2017 1 commit
    • Kenneth Moreland's avatar
      Update copyright for Sandia · c3a3184d
      Kenneth Moreland authored
      Sandia National Laboratories recently changed management from the
      Sandia Corporation to the National Technology & Engineering Solutions
      of Sandia, LLC (NTESS). The copyright statements need to be updated
      accordingly.
      c3a3184d
  10. 24 Aug, 2017 1 commit
  11. 17 Aug, 2017 1 commit
  12. 07 Jul, 2017 2 commits
  13. 26 May, 2017 1 commit
  14. 25 May, 2017 1 commit
  15. 24 Apr, 2017 1 commit
  16. 14 Dec, 2016 1 commit
    • Kenneth Moreland's avatar
      Check error codes from CUDA functions · 55c159d6
      Kenneth Moreland authored
      Most functions in the CUDA runtime API return an error code that must be
      checked to determine whether the operation completed successfully. Most
      operations in VTK-m just called the function and assumed it completed
      correctly, which could lead to further errors. This change wraps most
      CUDA calls in a VTKM_CUDA_CALL macro that checks the error code and
      throws an exception if the call fails.
      55c159d6
  17. 17 May, 2016 1 commit
  18. 12 May, 2016 1 commit
  19. 03 May, 2016 1 commit
  20. 15 Sep, 2015 1 commit
  21. 03 Sep, 2015 1 commit
    • Robert Maynard's avatar
      Make thrust use fast paths when doing sort and scan. · 72450e87
      Robert Maynard authored
      By introducing our own custom thrust execution policy we can make sure
      to hit the fastest code paths in thrust for the sort operation. This makes
      sure that for UInt32,Int32, and Float32 we use the radix sort from thrust
      which offers a 2x to 3x speed improvement over the merge sort implementation.
      
      Secondly by telling thrust that our BinaryOperators are commutative we
      make sure that we get the fastest code paths when executing Inclusive
      and Exclusive Scan
      
      Benchmark 'Radix Sort on 1048576 random values vtkm::Int32' results:
        median = 0.0117049s
        median abs dev = 0.00324614s
        mean = 0.0167615s
        std dev = 0.00786269s
        min = 0.00845875s
        max = 0.0389063s
      Benchmark 'Radix Sort on 1048576 random values vtkm::Float32' results:
        median = 0.0234463s
        median abs dev = 0.000317249s
        mean = 0.021452s
        std dev = 0.00470307s
        min = 0.011255s
        max = 0.0250643s
      Benchmark 'Merge Sort on 1048576 random values vtkm::Int32' results:
        median = 0.0310486s
        median abs dev = 0.000182129s
        mean = 0.0286914s
        std dev = 0.00634102s
        min = 0.0116225s
        max = 0.0317379s
      Benchmark 'Merge Sort on 1048576 random values vtkm::Float32' results:
        median = 0.0310617s
        median abs dev = 0.000193583s
        mean = 0.0295779s
        std dev = 0.00491531s
        min = 0.0147257s
        max = 0.032307s
      72450e87