VeloGraphX
High-performance dynamic graph analytics in C++20
Loading...
Searching...
No Matches
velographx::NumaLocalScheduler Class Reference

#include <numa_scheduler.hpp>

Public Member Functions

 NumaLocalScheduler (WorkStealingPool &pool, std::vector< NumaVertexPartition > partitions)
 
std::size_t preferred_queue_for_node (std::size_t node_id, std::size_t sequence=0) const noexcept
 
std::size_t preferred_queue_for_vertex (std::size_t vertex, std::size_t sequence=0) const noexcept
 
void submit_for_vertex (std::size_t vertex, WorkStealingPool::Task task, std::size_t sequence=0)
 
template<class Fn >
void parallel_for_partitions (Fn &&fn)
 
const std::vector< NumaVertexPartition > & partitions () const noexcept
 

Detailed Description

Definition at line 14 of file numa_scheduler.hpp.

Constructor & Destructor Documentation

◆ NumaLocalScheduler()

velographx::NumaLocalScheduler::NumaLocalScheduler ( WorkStealingPool pool,
std::vector< NumaVertexPartition partitions 
)
inline

Definition at line 16 of file numa_scheduler.hpp.

Member Function Documentation

◆ parallel_for_partitions()

template<class Fn >
void velographx::NumaLocalScheduler::parallel_for_partitions ( Fn &&  fn)
inline

◆ partitions()

const std::vector< NumaVertexPartition > & velographx::NumaLocalScheduler::partitions ( ) const
inlinenoexcept

Definition at line 62 of file numa_scheduler.hpp.

◆ preferred_queue_for_node()

std::size_t velographx::NumaLocalScheduler::preferred_queue_for_node ( std::size_t  node_id,
std::size_t  sequence = 0 
) const
inlinenoexcept

◆ preferred_queue_for_vertex()

std::size_t velographx::NumaLocalScheduler::preferred_queue_for_vertex ( std::size_t  vertex,
std::size_t  sequence = 0 
) const
inlinenoexcept

◆ submit_for_vertex()

void velographx::NumaLocalScheduler::submit_for_vertex ( std::size_t  vertex,
WorkStealingPool::Task  task,
std::size_t  sequence = 0 
)
inline

The documentation for this class was generated from the following file: