- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 81 for Nodes (0.17 sec)
-
cmd/bucket-stats_gen.go
switch msgp.UnsafeString(field) { case "Nodes": var zb0002 uint32 zb0002, err = dc.ReadArrayHeader() if err != nil { err = msgp.WrapError(err, "Nodes") return } if cap(z.Nodes) >= int(zb0002) { z.Nodes = (z.Nodes)[:zb0002] } else { z.Nodes = make([]ReplQNodeStats, zb0002) } for za0001 := range z.Nodes { err = z.Nodes[za0001].DecodeMsg(dc) if err != nil {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Feb 06 06:00:45 UTC 2024 - 57.5K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_subgraphs_pass.cc
private: // The subgraph extracted from the input graph, suitable for being turned // into a FunctionDef. Inputs are fed by _Arg nodes, and outputs are // returned by _Retval nodes. std::unique_ptr<Graph> graph_; // Which device are these nodes on? Used to assign a device to the call // node. string device_; // NodeDef for the function call node. NodeDef call_node_def_;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 08:47:20 UTC 2024 - 51K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
// back to a pessimistic analysis. The optimistic analysis assigns the same // symbolic predicate to all the merge nodes whose preceding enter nodes have // the same frame name on the first iteration. On the second iteration, if all // the merge nodes are pattern matched into the same AndRecurrence predicate // instance, the optimistic assignment of the same symbolic predicate is correct
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
pkg/controller/nodelifecycle/node_lifecycle_controller.go
logger.Info("Controller detected that some Nodes are Ready. Exiting master disruption mode") // When exiting disruption mode update probe timestamps on all Nodes. now := nc.now() for i := range nodes { v := nc.nodeHealthMap.getDeepCopy(nodes[i].Name) v.probeTimestamp = now v.readyTransitionTimestamp = now nc.nodeHealthMap.set(nodes[i].Name, v) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 51.6K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/defaultpreemption/default_preemption_test.go
nodes: []string{"node1"}, expected: false, }, } for _, test := range tests { t.Run(test.name, func(t *testing.T) { logger, ctx := ktesting.NewTestContext(t) ctx, cancel := context.WithCancel(ctx) defer cancel() var nodes []*v1.Node for _, n := range test.nodes { nodes = append(nodes, st.MakeNode().Name(n).Obj()) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 82.8K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
} std::optional<string> MarkForCompilationPassImpl::GetXlaScope(Node* node) { // Look for either _XlaScope or _XlaInternalScope on both nodes to guide // clustering. If both nodes have a scope and the scopes do not match, do // not cluster along this edge. If even one of the nodes lacks a scope // attribute, then it is treated as a "bridge" and a cluster may be created // along it. //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0) -
pkg/controller/volume/attachdetach/reconciler/reconciler_test.go
nodeLister := informerFactory.Core().V1().Nodes().Lister() nsu := statusupdater.NewFakeNodeStatusUpdater(false /* returnError */) rc := NewReconciler( reconcilerLoopPeriod, maxWaitForUnmountDuration, syncLoopPeriod, false, false, dsw, asw, ad, nsu, nodeLister, fakeRecorder) nodes := []k8stypes.NodeName{} for _, n := range test.nodes { dsw.AddNode(n.name) nodes = append(nodes, n.name)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 18 07:00:14 UTC 2024 - 72.8K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/noderesources/fit_test.go
snapshot := cache.NewSnapshot(test.existingPods, test.nodes) fh, _ := runtime.NewFramework(ctx, nil, nil, runtime.WithSnapshotSharedLister(snapshot)) args := test.nodeResourcesFitArgs p, err := NewFit(ctx, &args, fh, plfeature.Features{}) if err != nil { t.Fatalf("unexpected error: %v", err) } var gotPriorities framework.NodeScoreList for _, n := range test.nodes { if test.runPreScore {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 57.4K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass_test.cc
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 14 10:11:10 UTC 2024 - 79.6K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/volumebinding/binder_test.go
initPVCs: []*v1.PersistentVolumeClaim{boundPVCNode1a}, nodes: []*v1.Node{node1NoLabels}, shouldFail: true, }, "node-affinity-fails-dynamic-provisioning": { initPVs: []*v1.PersistentVolume{pvNode1a, pvNode2}, initPVCs: []*v1.PersistentVolumeClaim{selectedNodePVC}, claimToProvision: selectedNodePVC, nodes: []*v1.Node{node1, node2},
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 25 09:46:58 UTC 2024 - 82.8K bytes - Viewed (0)