Search Options

Results per page
Sort
Preferred Languages
Advance

Results 71 - 80 of 821 for more (0.05 sec)

  1. tensorflow/compiler/mlir/mlir_graph_optimization_pass.h

    #include "mlir/Dialect/Func/IR/FuncOps.h"  // from @llvm-project
    #include "mlir/IR/BuiltinOps.h"  // from @llvm-project
    #include "tensorflow/core/common_runtime/function_optimization_registry.h"
    #include "tensorflow/core/common_runtime/optimization_registry.h"
    
    namespace tensorflow {
    
    // -------------------------------------------------------------------------- //
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Oct 03 22:53:34 UTC 2023
    - 8.4K bytes
    - Viewed (0)
  2. tensorflow/compiler/jit/clone_constants_for_better_clustering.cc

    #include <string>
    
    #include "absl/algorithm/container.h"
    #include "tensorflow/compiler/jit/xla_cluster_util.h"
    #include "xla/status_macros.h"
    #include "tensorflow/core/framework/node_def.pb.h"
    #include "tensorflow/core/framework/tensor.pb.h"
    #include "tensorflow/core/util/dump_graph.h"
    
    namespace tensorflow {
    
    using tsl::StatusOr;
    
    class CloneConstantsForBetterClusteringPassImpl {
     public:
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  3. tensorflow/compiler/mlir/quantization/common/attrs_and_constraints.h

    // Permutation from the OIHW (== (output features, input features, height,
    // width)) tensor format to HWIO. This is commonly used to transpose convolution
    // weights represented as OIHW format to HWIO, which is more desirable for
    // certain downstream optimization passes (e.g. XLA).
    inline constexpr std::array<int64_t, 4> kOihwToHwioPermutation = {2, 3, 1, 0};
    
    // Returns true if the value has static shape.
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 9.9K bytes
    - Viewed (0)
  4. tensorflow/compiler/mlir/quantization/tensorflow/python/quantize_model.py

        raise ValueError(
            'Representative dataset is not a mapping (got: '
            f'{type(representative_dataset)}), but there is more than one '
            'signature key provided. Please provide a map of '
            '{signature_key -> dataset} with more than one signature key.'
        )
      else:
        representative_dataset_map = {
            list(signature_def_map.keys())[0]: representative_dataset,
        }
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Fri May 17 03:36:50 UTC 2024
    - 34.2K bytes
    - Viewed (0)
  5. tensorflow/c/experimental/filesystem/plugins/posix/posix_filesystem.cc

      auto posix_file = static_cast<PosixFile*>(file->plugin_file);
      char* dst = buffer;
      int64_t read = 0;
    
      while (n > 0) {
        // Some platforms, notably macs, throw `EINVAL` if `pread` is asked to read
        // more than fits in a 32-bit integer.
        size_t requested_read_length;
        if (n > INT32_MAX)
          requested_read_length = INT32_MAX;
        else
          requested_read_length = n;
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Sun Mar 24 20:08:23 UTC 2024
    - 15.8K bytes
    - Viewed (0)
  6. tensorflow/compiler/mlir/tf2xla/transforms/legalize_tf_collective.cc

            return failure();
          }
    
          int64_t channel_id = channel_id_++;
          // FIXME(b/226139061): Mode should be set to CrossReplicaAndPartition
          // in order to use XLA:GPU for more than one workers.
          // The mode is set to use CrossReplica to keep the
          // behavior on the primary user of this optimized path, because
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 16K bytes
    - Viewed (0)
  7. tensorflow/compiler/mlir/tensorflow/transforms/convert_control_to_data_outputs.cc

          // trait, then we don't need to chain resource ops accessing this resource
          // between iterations: Every iteration will create a new independent
          // resource. This enables more parallelism across iterations.
          if (!side_effect_analysis.IsUniqueResourceAllocationId(
                  resource_and_device.first)) {
            chain_resource_to_ops_map[resource_and_device].insert(&op);
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 28.7K bytes
    - Viewed (0)
  8. tensorflow/compiler/mlir/quantization/stablehlo/passes/bridge/convert_tf_quant_types.cc

    auto *mlir_tf_quant_op_count = ::tensorflow::monitoring::Counter<1>::New(
        "/tensorflow/core/tf2xla/tf_quant_op_count" /*metric_name*/,
        "Counts the number of ops that has qint types" /*metric description*/,
        "op_name" /*metric label*/);
    
    // Returns wether a type is illegal. Here we consider TF qint types illegal.
    // See pass description in passes.td for more info about how illegal types are
    // treated in this pass.
    bool IsIllegalType(Type type) {
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 12.6K bytes
    - Viewed (0)
  9. tensorflow/compiler/jit/flags.cc

    #include "absl/strings/strip.h"
    #include "tensorflow/compiler/mlir/tensorflow/utils/dump_graph.h"
    #include "xla/parse_flags_from_env.h"
    #include "tensorflow/core/platform/macros.h"
    #include "tensorflow/core/tpu/kernels/sparse_core_xla_flags_defaults.h"
    #include "tensorflow/core/util/command_line_flags.h"
    
    namespace tensorflow {
    namespace {
    
    BuildXlaOpsPassFlags* build_ops_flags;
    MarkForCompilationPassFlags* mark_for_compilation_flags;
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Apr 17 18:52:57 UTC 2024
    - 24.5K bytes
    - Viewed (0)
  10. tensorflow/compiler/mlir/tensorflow/transforms/executor_island_coarsening.cc

    // recursively mutate the IR (resulting in quadratic behavior when moving
    // operations). A rough sketch of the coarsening algorithm is shown below:
    //
    // // The algorithm iterates until a fixpoint is reached, i.e. when no more
    // // islands can be merged.
    // while (changed) {
    //   // In the first phase we try to merge islands with their nearest consumer
    //   // iff the consumer is another island.
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 19.7K bytes
    - Viewed (0)
Back to top