graph_executor.h

Go to the documentation of this file.

/*
 * Copyright (c) Meta Platforms, Inc. and affiliates.
 *
 * This source code is licensed under the MIT license found in the
 * LICENSE file in the root directory of this source tree.
 */
 
#pragma once
#include <dispenso/concurrent_vector.h>
#include <dispenso/detail/graph_executor_impl.h>
#include <dispenso/graph.h>
#include <dispenso/parallel_for.h>
#include <dispenso/platform.h>
 
namespace dispenso {
class SingleThreadExecutor : public detail::ExecutorBase {
 public:
  template <typename G>
  void operator()(const G& graph);
 
 private:
  std::vector<const Node*> nodesToExecute_;
  std::vector<const Node*> nodesToExecuteNext_;
};
class ParallelForExecutor : public detail::ExecutorBase {
 public:
  template <typename TaskSetT, typename G>
  void operator()(TaskSetT& taskSet, const G& graph);
 
 private:
  // Per-thread state for collecting ready nodes locally during parallel_for
  struct ThreadLocalCollector {
    std::vector<const Node*> readyNodes;
  };
 
  std::vector<const Node*> nodesToExecute_;
  std::vector<const Node*> nodesToExecuteNext_;
  std::vector<ThreadLocalCollector> threadStates_;
};
class ConcurrentTaskSetExecutor : public detail::ExecutorBase {
 public:
  template <typename G>
  void operator()(
      dispenso::ConcurrentTaskSet& tasks,
      const G& graph,
      bool wait = true,
      float poolRecursiveLoadFactor = 3.0f);
 
 private:
  std::vector<const Node*> startNodes_;
};
 
class ForwardPropagator : public detail::ExecutorBase {
 public:
  template <class G>
  void operator()(const G& graph);
 
 private:
  template <class N>
  void propagateIncompleteStateBidirectionally();
 
  std::vector<const Node*> nodesToVisit_;
  std::vector<const Node*> nodesToVisitNext_;
  std::unordered_set<const Node*> visited_;
  std::unordered_set<const std::vector<const BiPropNode*>*> groups_;
};
} // namespace dispenso