- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 390 for nodeIPs (0.12 sec)
-
pkg/controller/volume/attachdetach/cache/actual_state_of_world.go
if !volumeExists || len(volumeObj.nodesAttachedTo) == 0 { return []types.NodeName{} } nodes := []types.NodeName{} for nodeName, nodesAttached := range volumeObj.nodesAttachedTo { if nodesAttached.attachedConfirmed { nodes = append(nodes, nodeName) } } return nodes } func (asw *actualStateOfWorld) GetVolumesToReportAttached(logger klog.Logger) map[types.NodeName][]v1.AttachedVolume {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 11 07:35:17 UTC 2024 - 28.7K bytes - Viewed (0) -
tensorflow/cc/framework/gradients.cc
} } // BFS from nodes in 'inputs_' along out edges for the entire graph. Internal // output nodes are recorded during the traversal. All nodes that are output // nodes but not internal output nodes are considered the frontier of the // output nodes, and thus our stop backprop nodes. while (!queue.empty()) { std::pair<Node*, Node*> p = queue.front();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 05:57:22 UTC 2024 - 22K bytes - Viewed (0) -
cluster/gce/config-default.sh
export E2E_STORAGE_TEST_ENVIRONMENT="${KUBE_E2E_STORAGE_TEST_ENVIRONMENT:-false}" # Evict pods whenever compute resource availability on the nodes gets below a threshold. EVICTION_HARD="${EVICTION_HARD:-memory.available<250Mi,nodefs.available<10%,nodefs.inodesFree<5%}" # Optional: custom scheduling algorithm SCHEDULING_ALGORITHM_PROVIDER="${SCHEDULING_ALGORITHM_PROVIDER:-}"
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Mar 16 20:16:32 UTC 2024 - 26.9K bytes - Viewed (0) -
cluster/gce/config-test.sh
NODE_ACCELERATORS='' fi # To avoid failing large tests due to some flakes in starting nodes, allow # for a small percentage of nodes to not start during cluster startup. ALLOWED_NOTREADY_NODES=${ALLOWED_NOTREADY_NODES:-$(($(get-num-nodes) / 100))} # By default a cluster will be started with the master and nodes # on Container-optimized OS (cos, previously known as gci). If
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 18 17:20:24 UTC 2024 - 29.8K bytes - Viewed (0) -
tensorflow/compiler/jit/shape_inference.cc
} } // Sometimes we have VariableShape nodes in while loop (after Enter nodes). // They won't be constant-folded because TensorFlow constant folding does // not handle Enter nodes (and thus does not handle any nodes after Enter // nodes). We try to replace such VariableShape nodes with Const nodes here. if (n->type_string() == "VariableShape") {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 00:41:19 UTC 2024 - 13K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_util.cc
// Gather all outside compilation to outside compilation nodes. std::vector<Node*> placeholder_nodes; for (Node* n : g->nodes()) { if (n->type_string() == "Placeholder" && HasNodeAttr(n->def(), kOutsideCompilationOriginalNodeAttrName)) { placeholder_nodes.push_back(n); } } // Remove the placeholder nodes, and reconnect original edge. auto node_name_index = g->BuildNodeNameIndex();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 15.5K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/filtering.go
node := nodeInfo.Node() if !pl.enableNodeInclusionPolicyInPodTopologySpread { // spreading is applied to nodes that pass those filters. // Ignore parsing errors for backwards compatibility. if match, _ := requiredNodeAffinity.Match(node); !match { return } } // Ensure current node's labels contains all topologyKeys in 'Constraints'. if !nodeLabelsMatchSpreadConstraints(node.Labels, constraints) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Feb 28 10:42:29 UTC 2024 - 12.4K bytes - Viewed (1) -
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
pkg/volume/csi/nodeinfomanager/nodeinfomanager.go
newNode, updated, err := update(node) if err != nil { return err } node = newNode needUpdate = needUpdate || updated } if needUpdate { // PatchNodeStatus can update both node's status and labels or annotations // Updating status by directly updating node does not work _, _, updateErr := nodeutil.PatchNodeStatus(kubeClient.CoreV1(), types.NodeName(node.Name), originalNode, node) return updateErr
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 11 09:02:45 UTC 2024 - 20.1K bytes - Viewed (0) -
pkg/scheduler/schedule_one.go
} } nodes := allNodes if !preRes.AllNodes() { nodes = make([]*framework.NodeInfo, 0, len(preRes.NodeNames)) for nodeName := range preRes.NodeNames { // PreRes may return nodeName(s) which do not exist; we verify // node exists in the Snapshot. if nodeInfo, err := sched.nodeInfoSnapshot.Get(nodeName); err == nil { nodes = append(nodes, nodeInfo) } } }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jun 06 13:28:08 UTC 2024 - 43.4K bytes - Viewed (0)