- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 151 for partitioned (0.29 sec)
-
tensorflow/compiler/mlir/tf2xla/transforms/xla_legalize_tf.cc
// Add TF->TF lowering patterns. TF::PopulateTFLoweringBeforeHLOPatterns(context, &legalize_lower_patterns); if (tf2xla_fallback_device_type && prefer_tf2xla) { VLOG(1) << "TF to XLA legalization patterns are partitioned by op into " "either native MLIR legalization, or TF2XLA fallback " "legalzation, with a preference toward TF2XLA."; } else if (tf2xla_fallback_device_type) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 28 21:49:50 UTC 2024 - 10.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/stack_ops_decomposition.cc
FunctionType::get(func.getContext(), new_input_types, func.front().getTerminator()->getOperandTypes())); } // Contains cached information for decomposed callee functions for (stateful) // partitioned call ops. struct PartitionedCallStackOpsInfo { bool signature_change; func::FuncOp decomposed_callee; llvm::SmallDenseMap<int64_t, int64_t> stack_var_arg_to_size_arg; };
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 23.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/passes.h
std::unique_ptr<OperationPass<ModuleOp>> CreateTPUResourceReadForWritePass(); // Creates a pass that reorders partitiioned resource reads and replicated // inputs. std::unique_ptr<OperationPass<func::FuncOp>> CreateTPUReorderReplicateAndPartitionedInputsPass(); // Creates a pass that partitions unpartitioned resource read/write to // partitioned resource variables. std::unique_ptr<OperationPass<func::FuncOp>>
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 21:18:05 UTC 2024 - 31.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/cluster_tf_ops_pass.cc
// in this function should be on the same host. struct FunctionMetadata { // The original function name before partition. llvm::StringRef original_name; // The insertion point of partition functions. Block::iterator insertion_point; // The partitioned function name. llvm::StringRef partition_name; // The input values of the function. llvm::SmallVector<Value, 4> inputs;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 13.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/tpu_sharding_identification.mlir
func.func @cluster_func(%arg0: tensor<*xi32>) -> tensor<*xi32> { func.return %arg0 : tensor<*xi32> } // ----- // Tests output sharding of unpartitioned resource write takes on same sharding // as unpartitioned resource. // CHECK-LABEL: func @partitioned_input_output func.func @partitioned_input_output(%arg0: tensor<!tf_type.resource<tensor<f32>>>) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Feb 20 19:07:52 UTC 2024 - 47.5K bytes - Viewed (0) -
tensorflow/c/experimental/saved_model/core/tf_saved_model_api.cc
// which returns a dict of string key -> EITHER: // 1. python callable (taking a checkpoint key) returning SaveableObject OR // 2. variable (partitioned/resource/reference or otherwise) // https://github.com/tensorflow/tensorflow/blob/ddc1bbad3dfd4a089eb96014f26cc16664b1b2f8/tensorflow/python/training/saving/saveable_object.py#L58.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Feb 27 09:34:33 UTC 2024 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMaker.java
} /** * Guides the allowed concurrency among update operations. Used as a hint for internal sizing. The * table is internally partitioned to try to permit the indicated number of concurrent updates * without contention. Because assignment of entries to these partitions is not necessarily * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 13 14:30:51 UTC 2023 - 12.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/MapMaker.java
} /** * Guides the allowed concurrency among update operations. Used as a hint for internal sizing. The * table is internally partitioned to try to permit the indicated number of concurrent updates * without contention. Because assignment of entries to these partitions is not necessarily * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 13 14:30:51 UTC 2023 - 12.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/tpu_reorder_replicate_and_partitioned_inputs.mlir
// RUN: tf-opt %s -split-input-file -verify-diagnostics -tf-tpu-reorder-replicate-partitioned-inputs | FileCheck %s // CHECK-LABEL:func @simple // CHECK-SAME: ([[ARG0:%.*]]: tensor<!tf_type.resource<tensor<10x3xf32>>>, [[ARG1:%.*]]: tensor<!tf_type.resource<tensor<10x3xf32>>>, [[ARG2:%.*]]: tensor<!tf_type.resource<tensor<10x3xf32>>>, [[ARG3:%.*]]: tensor<!tf_type.resource<tensor<10x3xf32>>>)
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jan 24 23:08:55 UTC 2023 - 14.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
from = partitionPoint + 1; } } } /** * Performs a partition operation on the slice of {@code array} with elements in the range [{@code * from}, {@code to}]. Uses the median of {@code from}, {@code to}, and the midpoint between them * as a pivot. Returns the index which the slice is partitioned around, i.e. if it returns {@code
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0)