30 | | === void '''_get_sqt_footprint'''( unsigned int* width, unsigned int* heigth, unsigned int* levels ) === |
31 | | Scalable, distributed synchronisation mechanisms , such as a barrier or a lock can be implemented with a Synchronisation Quad Tree (SQT). This function computes the smallest SQT covering all clusters containing processors in a platform. The SQT footprint is defined by the '''width''' (number of clusters in a row) and '''heigth''' (number of clusters in a column) parameters. The '''levels''' parameter define the number of levels between the root and the leaves, with the following constraints: |
| 30 | === void '''_get_sqt_footprint'''( unsigned int* xmax, unsigned int* ymax, unsigned int* levels ) === |
| 31 | Scalable, distributed synchronisation mechanisms, such as barriers or locks use Synchronisation Quad Tree (SQT). This function computes the smallest SQT covering all clusters containing processors in a platform. The SQT footprint is defined by the '''xmax''' (max number of clusters in a row) and '''ymax''' (max number of clusters in a column) parameters. The '''levels''' parameter define the number of levels between the SQT root and the SQT bottom, with the following features: |