- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for pessimistic (0.19 sec)
-
subprojects/core/src/main/java/org/gradle/api/internal/initialization/DefaultClassLoaderScope.java
private List<ClassLoader> exportLoaders; // if not null, is not empty private ClassPath local = ClassPath.EMPTY; private List<ClassLoader> ownLoaders; // If these are not null, we are pessimistic (loaders asked for before locking) private MultiParentClassLoader exportingClassLoader; private MultiParentClassLoader localClassLoader; // What is actually exposed
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jan 12 20:19:43 UTC 2024 - 8.9K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
// The optimistic mode does not converge. Let's fall back to the // pessimistic mode. TF_RETURN_IF_ERROR( PopulateFrame(sub_topo, /*use_optimistic_mode=*/false, nullptr)); } VLOG(2) << "Done populating frame " << cur_frame_name << " using the " << (success ? "optimistic" : "pessimistic") << " mode."; } return absl::OkStatus(); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/internal/classpath/transforms/LambdaSerializationTransformer.java
// * LDC can be 2 or 3 bytes (in which case it is actually LDC_W, but ASM hides this from us). // It depends on how big is the argument, and we have no control over this, so let's be pessimistic. // * IFEQ itself is 3 bytes. However, ASM's CodeSizeEvaluator gives an upper bound of 8, because offsets
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Oct 04 14:26:38 UTC 2023 - 15.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/analysis/resource_alias_analysis.cc
// calls a function that has not yet been analyzed, we will not be able to // backtrack through that function call (our analysis will be correct but // pessimistic). for (CallGraphNode* node : scc) { if (node->isExternal()) continue; Region* region = node->getCallableRegion(); GetOrCreateAnalysis(*region); } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 28.2K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis_test.cc
Output add1 = ops::Add(root.WithOpName("add1"), iv1, iv2); // NB! iv0 and iv1 are equivalent and a smarter deadness analysis would have // noticed that. Today we are pessimistic here because we assign an // uninterpreted symbol to merges with backedges. VLogGraphIfAsked(*root.graph()); { std::unique_ptr<DeadnessAnalysis> result;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 06:59:07 UTC 2024 - 51.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/passes/extract_outside_compilation.cc
// cluster that will be moved to the host at the same time since both // defining op and user op will be moved to host. if (cluster_ops.count(user)) { continue; } // This is pessimistic and in some cases will add extra communication. if (!HasOutsideCompilationAncestor(user) || has_dynamic_outputs || HasDynamicOutputs(user)) { if (!user_set.insert(user).second) continue;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 30 21:25:12 UTC 2024 - 68.3K bytes - Viewed (0) -
src/runtime/mgcscavenge.go
// that the overheads of scavenging are better amortized, so better // scavenging throughput. // // The current value is chosen assuming a cost of ~10µs/physical page // (this is somewhat pessimistic), which implies a worst-case latency of // about 160µs for 4 KiB physical pages. The current value is biased // toward latency over throughput. const scavengeQuantum = 64 << 10
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0)