File tree 2 files changed +9
-2
lines changed
2 files changed +9
-2
lines changed Original file line number Diff line number Diff line change @@ -228,6 +228,11 @@ Can be retrieved using umfMemspaceHighestCapacityGet.
228
228
Memspace backed by an aggregated list of NUMA nodes identified as highest bandwidth after selecting each available NUMA node as the initiator.
229
229
Querying the bandwidth value requires HMAT support on the platform. Calling ` umfMemspaceHighestBandwidthGet() ` will return NULL if it's not supported.
230
230
231
+ #### Lowest latency memspace
232
+
233
+ Memspace backed by an aggregated list of NUMA nodes identified as lowest latency after selecting each available NUMA node as the initiator.
234
+ Querying the latency value requires HMAT support on the platform. Calling ` umfMemspaceLowestLatencyGet() ` will return NULL if it's not supported.
235
+
231
236
### Proxy library
232
237
233
238
UMF provides the UMF proxy library (` umf_proxy ` ) that makes it possible
Original file line number Diff line number Diff line change @@ -57,12 +57,14 @@ umf_memspace_handle_t umfMemspaceHostAllGet(void);
57
57
umf_memspace_handle_t umfMemspaceHighestCapacityGet (void );
58
58
59
59
/// \brief Retrieves predefined highest bandwidth memspace.
60
- /// \return highest bandwidth memspace handle on success or NULL on failure.
60
+ /// \return highest bandwidth memspace handle on success or NULL on
61
+ /// failure (no HMAT support).
61
62
///
62
63
umf_memspace_handle_t umfMemspaceHighestBandwidthGet (void );
63
64
64
65
/// \brief Retrieves predefined lowest latency memspace.
65
- /// \return lowest latency memspace handle on success or NULL on failure.
66
+ /// \return lowest latency memspace handle on success or NULL on
67
+ /// failure (no HMAT support).
66
68
///
67
69
umf_memspace_handle_t umfMemspaceLowestLatencyGet (void );
68
70
You can’t perform that action at this time.
0 commit comments