Changes between Version 2 and Version 3 of kernel_miscelaneous


Ignore:
Timestamp:
Jan 17, 2015, 1:47:36 PM (10 years ago)
Author:
alain
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • kernel_miscelaneous

    v2 v3  
    2929
    3030=== void '''_get_sbt_footprint'''( unsigned int* width,  unsigned int* heigth,  unsigned int* levels ) ===
    31 This function computes the footprint of the smallest SBT (Sliced Binary tree) covering
    32 all clusters containing processors in a platform. The SBT footprint is defined by the '''width''' and '''heigth''' parameters, with the following constraints:
     31A Sliced Binary Tree (SBT) can be used to implement a scalable, distributed synchronisation, such as a sbt_barrier or a sbt_lock. This function computes the footprint of the smallest SBT  covering all clusters containing processors in a platform. The SBT footprint is defined by the '''width''' and  '''heigth''' parameters. The '''levels''' parameter define the number of levels between the root and the leaves, with the following constraints:
    3332 * cluster[0][0] is always covered by the SBT
    3433 * the number of clusters in a row (width) is always power of 2