source: trunk/kernel/kern/dqdt.h @ 569

Last change on this file since 569 was 564, checked in by alain, 6 years ago

Complete restructuration of kernel locks.
File size: 7.4 KB
Line 
1/*
2 * kern/dqdt.h - Distributed Quad Decision Tree
3 *
4 * Author : Alain Greiner (2016,2017,2018)
5 *
6 * Copyright (c)  UPMC Sorbonne Universites
7 *
8 * This file is part of ALMOS-MKH
9 *
10 * ALMOS-kernel is free software; you can redistribute it and/or modify it
11 * under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; version 2.0 of the License.
13 *
14 * ALMOS-kernel is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
17 * General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License
20 * along with ALMOS-kernel; if not, write to the Free Software Foundation,
21 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 */
23
24#ifndef _DQDT_H_
25#define _DQDT_H_
26
27#include <kernel_config.h>
28#include <hal_kernel_types.h>
29#include <hal_atomic.h>
30
31/****************************************************************************************
32 * This DQDT infrastructure maintains a topological description of ressources usage
33 * (number of threads, and number of physical pages allocated) in each cluster.
34 *
35 * - If X_SIZE or Y_SIZE are equal to 1, it makes the assumption that the cluster
36 *   topology is a one dimensionnal vector, an build the smallest one-dimensionnal
37 *   quad-tree covering this one-dimensionnal vector. If the number of clusters
38 *   is not a power of 4, the tree is truncated as required.
39 *
40 *   TODO : the mapping for the one dimensionnal topology is not implemented yet [AG].
41 *
42 * - If both Y_SIZE and Y_SIZE are larger than 1, it makes the assumption that
43 *   the clusters topology is a 2D mesh. The [X,Y] coordinates of a cluster are
44 *   obtained from the CXY identifier using the following rules :
45 *      X = CXY >> Y_WIDTH   /  Y = CXY & ((1<<Y_WIDTH)-1)
46 *   If the mesh X_SIZE and Y_SIZE dimensions are not equal, or are not power of 2,
47 *   we build the smallest two dimensionnal quad-tree covering all clusters,
48 *   and this tree is truncated as required.
49 *   The root node is always implemented in cluster [0,0]
50 *   The mesh size is supposed to contain at most 32 * 32 clusters.
51 *   There are at most 6 DQDT nodes in a cluster
52 *   . Level 0 nodes exist on all clusters and have no children.
53 *   . Level 1 nodes exist when both X and Y coordinates are multiple of 2
54 *   . Level 2 nodes exist when both X and Y coordinates are multiple of 4
55 *   . Level 3 nodes exist when both X and Y coordinates are multiple of 8
56 *   . Level 4 nodes exist when both X and Y coordinates are multiple of 16
57 *   . Level 5 nodes exist when both X and Y coordinates are multiple of 32
58 *
59 *   TODO : the cluster_info[x][y] array is not taken into account [AG].
60 ***************************************************************************************/
61
62/****************************************************************************************
63 * This structure describes a node of the DQDT.
64 * The max number of children is 4, but it can be smaller for some nodes.
65 * Level 0 nodes are the clusters, and have no children.
66 * The root node has no parent, and is always stored in cluster[0,0].
67 ***************************************************************************************/
68typedef struct dqdt_node_s
69{
70        uint32_t            level;               // node level
71        uint32_t            arity;               // actual children number in this node
72    uint32_t            threads;             // current number of threads in subtree
73    uint32_t            pages;               // current number of pages in subtree
74        xptr_t              parent;              // extended pointer on parent node
75        xptr_t              children[4];         // extended pointers on children nodes
76}
77dqdt_node_t;
78
79
80/****************************************************************************************
81 * This local function initializes the local DQDT structures.
82 * The information describing the hardware platform topology and the cluster
83 * indexing policy is defined by the three arguments below.
84 * This initialisation is done in parallel, locally in each cluster, because the DQDT
85 * is allocated as a global variable in the cluster_manager, and the local addresses
86 * are identical in all clusters.
87 ****************************************************************************************
88 * @ x_size   : number of clusters (containing memory and CPUs) in a row
89 * @ y_size   : number of clusters (containing memory and CPUs) in a column
90 * @ return the number of levels in quad-tree.
91 ***************************************************************************************/
92uint32_t dqdt_init( uint32_t x_size,
93                    uint32_t y_size );
94
95/****************************************************************************************
96 * This local function updates the total number of threads in level 0 DQDT node,
97 * and propagates the variation to the DQDT upper levels.
98 * It should be called on each thread creation or destruction.
99 ****************************************************************************************
100 * @ increment : increment (can be positive or negative)
101 ***************************************************************************************/
102void dqdt_update_threads( int32_t  increment );
103
104/****************************************************************************************
105 * This local function updates the total number of pages in level 0 DQDT node,
106 * and propagates the variation to the DQDT upper levels.
107 * It should be called on each physical memory page allocation or release.
108 ****************************************************************************************
109 * @ increment : increment (can be positive or negative)
110 ***************************************************************************************/
111void dqdt_update_pages( int32_t increment );
112
113/****************************************************************************************
114 * This function can be called in any cluster. It traverses the DQDT tree
115 * from the root to the bottom, to analyse the computing load and select the cluster
116 * with the lowest number ot threads to place a new process.
117 ****************************************************************************************
118 * @ returns the cluster identifier with the lowest computing load.
119 ***************************************************************************************/
120cxy_t dqdt_get_cluster_for_process( void );
121
122/****************************************************************************************
123 * This function can be called in any cluster. It traverses the DQDT tree
124 * from the root to the bottom, to analyse the memory load and select the cluster
125 * with the lowest memory load for dynamic memory allocation with no locality constraint.
126 ****************************************************************************************
127 * @ returns the cluster identifier with the lowest memory load.
128 ***************************************************************************************/
129cxy_t dqdt_get_cluster_for_memory( void );
130
131/****************************************************************************************
132 * This function displays on kernel TXT0 the DQDT state for all nodes in the quad-tree.
133 * It traverses the quadtree from root to bottom, and can be called by a thread
134 * running in any cluster
135 ***************************************************************************************/
136void dqdt_display( void );
137
138
139#endif  /* _DQDT_H_ */
Note: See TracBrowser for help on using the repository browser.