- Sort Score
- Result 10 results
- Languages All
Results 1 - 9 of 9 for host_graph (0.18 sec)
-
tensorflow/compiler/jit/extract_outside_compilation_pass.cc
if (!sequencer->in_edges().empty()) { (*host_graph)->AddControlEdge(sequencer, (*host_graph)->sink_node()); } PruneForReverseReachability( host_graph->get(), std::unordered_set<const Node*>{(*host_graph)->sink_node()}); // Postprocess edges between different outside compilations. TF_RETURN_IF_ERROR(PostprocessEdgesBetweenOutsideCompilations( host_graph->get(), outside_compilation_attr_name));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 104.7K bytes - Viewed (0) -
tensorflow/compiler/jit/extract_outside_compilation_pass_test.cc
host_func_attrs["_device_ordinal"] = device_ordinal_temp_value; TF_CHECK_OK(FunctionDefToBodyHelper( *fld.Find("host_graph"), AttrSlice(&host_func_attrs), &fld, &host_fbody)); Graph *host_graph = host_fbody->graph; Node *key_placeholder = nullptr, *sequencer = nullptr; for (Node *n : host_graph->nodes()) { if (n->type_string() == "Placeholder" && absl::EndsWith(n->name(), "_key_placeholder")) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 41K bytes - Viewed (0) -
tensorflow/compiler/jit/extract_outside_compilation_pass.h
// XlaHostCompute nodes. Each outside compilation subgraph will be rewritten by // `RewriteOutsideCompilationSubgraphFn`, and they will be merged into one // single host side graph (`host_graph`). // // xla_cluster_attr_name and outside_compilation_attr_name: attr name for XLA // computation and outside compilation. Required for // `RewriteOutsideCompilationSubgraphFn`.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 5.3K bytes - Viewed (0) -
tensorflow/cc/training/queue_runner.cc
mutex_lock l(mu_); return status_; } Status QueueRunner::ExportCostGraph(CostGraphDef* cost_graph) const { if (!cg_mu_) { return Status(absl::StatusCode::kFailedPrecondition, "This QueueRunner doesn't collect a cost graph."); } mutex_lock l(*cg_mu_); cost_graph->MergeFrom(*cost_graph_); return absl::OkStatus(); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 08:30:37 UTC 2024 - 7K bytes - Viewed (0) -
tensorflow/cc/training/queue_runner.h
/// otherwise returns the first captured failure status. Status Join() final; /// Returns the latest status. Status GetStatus(); // Returns the stored cost model. Status ExportCostGraph(CostGraphDef* cost_graph) const override; private: QueueRunner() : coord_(nullptr), stopped_(false), cg_mu_(nullptr) {} // Initializes the instance with the QueueRunnerDef proto. Status Init(const QueueRunnerDef& queue_runner_def);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Aug 31 18:27:00 UTC 2022 - 5K bytes - Viewed (0) -
tensorflow/c/c_api_function_test.cc
EXPECT_EQ(TF_GraphNumFunctions(host_graph_), 1); EXPECT_EQ(TF_GraphGetFunctions(host_graph_, funcs, 0, s_), 0); ASSERT_EQ(TF_OK, TF_GetCode(s_)) << TF_Message(s_); EXPECT_EQ(TF_GraphGetFunctions(host_graph_, funcs, 1, s_), 1); ASSERT_EQ(TF_OK, TF_GetCode(s_)) << TF_Message(s_); AssertEqual(func0, funcs[0]); TF_DeleteFunction(funcs[0]); EXPECT_EQ(TF_GraphGetFunctions(host_graph_, funcs, 2, s_), 1);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jul 20 22:08:54 UTC 2023 - 63.6K bytes - Viewed (0) -
tensorflow/cc/training/coordinator.h
#ifndef TENSORFLOW_CC_TRAINING_COORDINATOR_H_ #define TENSORFLOW_CC_TRAINING_COORDINATOR_H_ #include <atomic> #include <memory> #include <unordered_set> #include <vector> #include "tensorflow/core/framework/cost_graph.pb.h" #include "tensorflow/core/lib/core/status.h" #include "tensorflow/core/platform/macros.h" #include "tensorflow/core/platform/mutex.h" #include "tensorflow/core/protobuf/config.pb.h"
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Oct 12 08:49:52 UTC 2023 - 4.4K bytes - Viewed (0) -
tensorflow/cc/training/coordinator.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 08:30:37 UTC 2024 - 3.2K bytes - Viewed (0) -
tensorflow/c/c_api.cc
*input = {oper, 0}; return true; } // Copies `src_graph` into `dst_graph`. Any node in `src_graph` with input // `src_inputs[i]` will have that input replaced with `dst_inputs[i]`. `prefix` // will be prepended to copied node names. `control_deps` are nodes in // `dst_graph` that the copied `src_graph` nodes will have control dependencies
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Apr 15 03:35:10 UTC 2024 - 102.3K bytes - Viewed (0)