- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 706 for _nodes (0.45 sec)
-
pkg/kubelet/cm/topologymanager/numa_info_test.go
}, { name: "positive test 2 nodes", topology: []cadvisorapi.Node{ { Id: 0, }, { Id: 1, }, }, expectedNUMAInfo: &NUMAInfo{ Nodes: []int{0, 1}, NUMADistances: NUMADistances{ 0: nil, 1: nil, }, }, }, { name: "positive test 2 nodes, with PreferClosestNUMA", topology: []cadvisorapi.Node{ { Id: 0,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Nov 09 16:52:14 UTC 2022 - 11.6K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/cpu_assignment.go
// sockets contain a bigger number of CPUs (free and busy) than NUMA nodes, or equivalently that each // socket contains more than one NUMA node. // // If instead sockets are lower in the memory hierarchy than NUMA nodes, they are sorted as follows. // First, they are sorted by number of free CPUs in the NUMA nodes that contain them. Then, for each
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 25 23:56:21 UTC 2024 - 36.3K bytes - Viewed (0) -
subprojects/core/src/test/groovy/org/gradle/internal/build/PlannedNodeGraphTest.groovy
nodes[1].nodeDependencies*.name == [] nodes[2].nodeIdentity.name == "task3" nodes[2].nodeDependencies*.name == [] nodes[3].nodeIdentity.name == "task4" nodes[3].nodeDependencies*.name == ["transformStep2"] nodes[4].nodeIdentity.name == "transformStep1" nodes[4].nodeDependencies*.name == ["task2", "task3"]
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Mar 21 13:11:56 UTC 2023 - 11.5K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/DefaultExecutionPlan.java
SortedSet<Node> sorted = new TreeSet<>(NodeComparator.INSTANCE); sorted.addAll(nodes); doAddEntryNodes(sorted, ordinal); } private void doAddEntryNodes(SortedSet<? extends Node> nodes, int ordinal) { scheduledNodes = null; LinkedList<Node> queue = new LinkedList<>(); OrdinalGroup group = ordinalNodeAccess.group(ordinal);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 13.6K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/interpodaffinity/scoring_test.go
}, // there are 2 regions, say regionChina(node1,node3,node4) and regionIndia(node2,node5), both regions have nodes that match the preference. // But there are more nodes(actually more existing pods) in regionChina that match the preference than regionIndia.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 03:30:06 UTC 2023 - 44.8K bytes - Viewed (0) -
platforms/software/dependency-management/src/test/groovy/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeStateTest.groovy
def modules1 = endorseFrom1.targetComponent.nodes[0].ownStrictVersionConstraints.getModules() def modules2 = endorseFrom2.targetComponent.nodes[0].ownStrictVersionConstraints.getModules() modulesAll.size() == 5 modules1.size() == 1 modules2.size() == 4 modulesAll == modules1 + modules2 endorseFrom1.targetComponent.nodes[0].ownStrictVersionConstraints != endorsedStrictVersions
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 10.9K bytes - Viewed (0) -
pkg/kubemark/controller.go
if err != nil { return err } if len(nodes) < absDelta { return fmt.Errorf("can't remove %d nodes from %s nodegroup, not enough nodes: %d", absDelta, nodeGroup, len(nodes)) } for i, node := range nodes { if i == absDelta { return nil } if err := kubemarkController.RemoveNodeFromNodeGroup(nodeGroup, node); err != nil { return err } } case delta > 0:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jul 17 23:02:17 UTC 2020 - 14.1K bytes - Viewed (0) -
pkg/scheduler/internal/cache/cache.go
// is no longer available on any node, the image entry will be removed from imageStates. func (cache *cacheImpl) removeNodeImageStates(node *v1.Node) { if node == nil { return } for _, image := range node.Status.Images { for _, name := range image.Names { state, ok := cache.imageStates[name] if ok { state.Nodes.Delete(node.Name) if state.Nodes.Len() == 0 {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 24 09:56:48 UTC 2023 - 24.9K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/conflicts/DefaultCapabilitiesConflictHandler.java
final Set<NodeState> nodes = findNodesFor(capability); Collection<NodeState> implicitCapabilityProviders = candidate.getImplicitCapabilityProviders(); nodes.addAll(implicitCapabilityProviders); NodeState node = candidate.getNode(); if (nodes.add(node) && nodes.size() > 1) { // The registered nodes may contain nodes which are no longer selected.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 12.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 30 20:12:45 UTC 2023 - 19.8K bytes - Viewed (0)