Non quia difficilia sunt non audemus, sed quia non audemus difficilia sunt
Home -> Research -> NB Collectives -> Kernels
Home
  Publications
  Awards
  Research
    
NB Collectives
      
LibNBC
      NBCBench
      Performance
      CG Solver
      Kernels
      HPL
    MPI Topologies
    MPI Datatypes
    Netgauge
    Network Topologies
    Ethernet BTL eth
    ORCS
    DFSSSP
    Older Projects
    cDAG
    LogGOPSim
    CoMPIler
  Teaching
  Miscellaneous
  Full CV [pdf]
  BLOG






  Events








  Past Events





Application Kernels using LibNBC

This page lists several application kernels that have been implemented to demonstrate the optimization potential of LibNBC. The only kernel available so far is the parallel implementation of a three-dimensional Fast Fourier Transformation. The 1-dimensional transformation is optimized for communication not for cache-reuse. This means that the imlementation might be slower on standard machines than a different domain decomposition.

3d-FFT (pre-release) - (5.6 kb)

serving: 18.97.14.83:39770© Torsten Hoefler