Search Options

Results per page
Sort
Preferred Languages
Advance

Results 91 - 100 of 1,734 for Nodes (0.04 sec)

  1. android/guava/src/com/google/common/graph/Graph.java

     * whose edges are anonymous entities with no identity or information of their own.
     *
     * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes.
     *
     * <p>There are three primary interfaces provided to represent graphs. In order of increasing
     * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 13.6K bytes
    - Viewed (0)
  2. guava/src/com/google/common/graph/Graph.java

     * whose edges are anonymous entities with no identity or information of their own.
     *
     * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes.
     *
     * <p>There are three primary interfaces provided to represent graphs. In order of increasing
     * complexity they are: {@link Graph}, {@link ValueGraph}, and {@link Network}. You should generally
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jan 22 17:29:38 UTC 2024
    - 13.6K bytes
    - Viewed (0)
  3. samples/kind-lb/setupkind.sh

      NUMNODES=${NUMNODES:-2}
    fi
    
    NODES=$(cat <<-EOM
    nodes:
    - role: control-plane
    EOM
    )
    
    if [[ -n "${NUMNODES}" ]]; then
    for _ in $(seq 1 "${NUMNODES}"); do
      NODES+=$(printf "\n%s" "- role: worker")
    done
    fi
    
    CONFIG=$(cat <<-EOM
    kind: Cluster
    apiVersion: kind.x-k8s.io/v1alpha4
    ${FEATURES}
    name: ${CLUSTERNAME}
    ${NODES}
    networking:
      ipFamily: ${IPFAMILY}
    EOM
    )
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Mon Oct 02 19:08:19 UTC 2023
    - 7.7K bytes
    - Viewed (0)
  4. pkg/scheduler/framework/plugins/podtopologyspread/scoring.go

    // Since <size> is at least 1 (all nodes that passed the Filters are in the
    // same topology), and k8s supports 5k nodes, the result is in the interval
    // <1.09, 8.52>.
    //
    // Note: <size> could also be zero when no nodes have the required topologies,
    // however we don't care about topology weight in this case as we return a 0
    // score for all nodes.
    func topologyNormalizingWeight(size int) float64 {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Dec 15 03:30:06 UTC 2023
    - 10.1K bytes
    - Viewed (0)
  5. pkg/controller/nodelifecycle/metrics.go

    			Help:           "Gauge measuring percentage of healthy nodes per zone.",
    			StabilityLevel: metrics.ALPHA,
    		},
    		[]string{"zone"},
    	)
    	zoneSize = metrics.NewGaugeVec(
    		&metrics.GaugeOpts{
    			Subsystem:      nodeControllerSubsystem,
    			Name:           zoneSizeKey,
    			Help:           "Gauge measuring number of registered Nodes per zones.",
    			StabilityLevel: metrics.ALPHA,
    		},
    		[]string{"zone"},
    	)
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Mon Mar 13 21:55:34 UTC 2023
    - 3.3K bytes
    - Viewed (0)
  6. pkg/controller/podgc/gc_controller_test.go

    			creationTime := time.Unix(0, 0)
    			nodes := make([]*v1.Node, 0, len(test.nodes))
    			for _, node := range test.nodes {
    				creationTime = creationTime.Add(2 * time.Hour)
    				nodes = append(nodes, &v1.Node{
    					ObjectMeta: metav1.ObjectMeta{Name: node.name, CreationTimestamp: metav1.Time{Time: creationTime}},
    					Spec: v1.NodeSpec{
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Jun 12 08:16:48 UTC 2024
    - 29K bytes
    - Viewed (0)
  7. cmd/kubeadm/app/phases/upgrade/versiongetter_test.go

    		{
    			name:    "node list is empty",
    			nodes:   &v1.NodeList{},
    			want:    map[string][]string{},
    			wantErr: false,
    		},
    	}
    	for _, tt := range tests {
    		client := clientsetfake.NewSimpleClientset()
    		t.Run(tt.name, func(t *testing.T) {
    			for _, node := range tt.nodes.Items {
    				err := client.Tracker().Create(schema.GroupVersionResource{Version: "v1", Resource: "nodes"}, &node, "")
    				if err != nil {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sun Mar 03 03:03:29 UTC 2024
    - 6.1K bytes
    - Viewed (0)
  8. pkg/scheduler/apis/config/types_pluginargs.go

    const (
    	// LeastAllocated strategy prioritizes nodes with least allocated resources.
    	LeastAllocated ScoringStrategyType = "LeastAllocated"
    	// MostAllocated strategy prioritizes nodes with most allocated resources.
    	MostAllocated ScoringStrategyType = "MostAllocated"
    	// RequestedToCapacityRatio strategy allows specifying a custom shape function
    	// to score nodes based on the request to capacity ratio.
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Jan 13 23:15:53 UTC 2023
    - 8.4K bytes
    - Viewed (0)
  9. pkg/controller/volume/attachdetach/cache/desired_state_of_world.go

    )
    
    // DesiredStateOfWorld defines a set of thread-safe operations supported on
    // the attach/detach controller's desired state of the world cache.
    // This cache contains nodes->volumes->pods where nodes are all the nodes
    // managed by the attach/detach controller, volumes are all the volumes that
    // should be attached to the specified node, and pods are the pods that
    // reference the volume and are scheduled to that node.
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Mar 01 10:42:15 UTC 2024
    - 13.5K bytes
    - Viewed (0)
  10. cmd/kube-controller-manager/app/options/nodelifecyclecontroller.go

    	fs.Float32Var(&o.NodeEvictionRate, "node-eviction-rate", 0.1, "Number of nodes per second on which pods are deleted in case of node failure when a zone is healthy (see --unhealthy-zone-threshold for definition of healthy/unhealthy). Zone refers to entire cluster in non-multizone clusters.")
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Jul 21 09:25:51 UTC 2023
    - 3.8K bytes
    - Viewed (0)
Back to top