Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 170 for CPU (0.06 sec)

  1. src/arena/arena.go

    of Go values and free that space manually all at once, safely. The purpose
    of this functionality is to improve efficiency: manually freeing memory
    before a garbage collection delays that cycle. Less frequent cycles means
    the CPU cost of the garbage collector is incurred less frequently.
    
    This functionality in this package is mostly captured in the Arena type.
    Arenas allocate large chunks of memory for Go values, so they're likely to
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Oct 12 20:23:36 UTC 2022
    - 4.3K bytes
    - Viewed (0)
  2. docs/en/docs/async.md

    And as most of the execution time is taken by actual work (instead of waiting), and the work in a computer is done by a <abbr title="Central Processing Unit">CPU</abbr>, they call these problems "CPU bound".
    
    ---
    
    Common examples of CPU bound operations are things that require complex math processing.
    
    For example:
    
    * **Audio** or **image processing**.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Wed Aug 28 23:33:37 UTC 2024
    - 23.5K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/helper/SystemHelper.java

                            logger.info("Cpu Load {}% is greater than {}%. {} waiting thread(s). {} thread is timed out.", current, percent,
                                    waitingThreadNames.size(), threadName);
                        }
                        return false;
                    }
                    if (logger.isInfoEnabled()) {
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Oct 17 12:10:08 UTC 2024
    - 27.2K bytes
    - Viewed (0)
  4. docs/zh/docs/deployment/server-workers.md

    您还可以看到它显示了每个进程的 **PID**,父进程(这是 **进程管理器**)的 PID 为`27365`,每个工作进程的 PID 为:`27368`、`27369`, `27370`和`27367`。
    
    ## 部署概念
    
    在这里,您了解了如何使用 **Gunicorn**(或 Uvicorn)管理 **Uvicorn 工作进程**来**并行**应用程序的执行,利用 CPU 中的 **多核**,并 能够满足**更多请求**。
    
    从上面的部署概念列表来看,使用worker主要有助于**复制**部分,并对**重新启动**有一点帮助,但您仍然需要照顾其他部分:
    
    * **安全 - HTTPS**
    * **启动时运行**
    * ***重新启动***
    * 复制(运行的进程数)
    * **内存**
    * **启动之前的先前步骤**
    
    ## 容器和 Docker
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Tue Aug 06 04:48:30 UTC 2024
    - 8.7K bytes
    - Viewed (0)
  5. RELEASE.md

            *   `tf.raw_ops.Bucketize` op on CPU.
            *   `tf.where` op for data types
                `tf.int32`/`tf.uint32`/`tf.int8`/`tf.uint8`/`tf.int64`.
            *   `tf.random.normal` op for output data type `tf.float32` on CPU.
            *   `tf.random.uniform` op for output data type `tf.float32` on CPU.
            *   `tf.random.categorical` op for output data type `tf.int64` on CPU.
    
    *   `tensorflow.experimental.tensorrt`:
    
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Tue Oct 22 14:33:53 UTC 2024
    - 735.3K bytes
    - Viewed (0)
  6. internal/s3select/simdj/reader_amd64_test.go

    }
    
    var testCases = []struct {
    	name  string
    	array bool
    }{
    	{
    		name: "parking-citations-10",
    	},
    }
    
    func TestNDJSON(t *testing.T) {
    	if !simdjson.SupportedCPU() {
    		t.Skip("Unsupported cpu")
    	}
    
    	for _, tt := range testCases {
    		t.Run(tt.name, func(t *testing.T) {
    			ref := loadCompressed(t, tt.name)
    
    			var err error
    			dst := make(chan simdjson.Object, 100)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 19 18:05:16 UTC 2022
    - 3.9K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/base/internal/Finalizer.java

          return false;
        }
    
        if (!finalizeReference(firstReference, finalizeReferentMethod)) {
          return false;
        }
    
        /*
         * Loop as long as we have references available so as not to waste CPU looking up the Method
         * over and over again.
         */
        while (true) {
          Reference<?> furtherReference = queue.poll();
          if (furtherReference == null) {
            return true;
          }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Aug 23 12:54:09 UTC 2023
    - 9.4K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/CompactHashSet.java

     * Generally speaking, this class reduces object allocation and memory consumption at the price of
     * moderately increased constant factors of CPU. Only use this class when there is a specific reason
     * to prioritize memory over CPU.
     *
     * @author Dimitris Andreou
     * @author Jon Noack
     */
    @GwtIncompatible // not worth using in GWT for now
    @ElementTypesAreNonnullByDefault
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 24K bytes
    - Viewed (0)
  9. tensorflow/c/c_api_experimental.cc

      }
    
      auto* gpu_options = config.mutable_gpu_options();
      gpu_options->set_allow_growth(gpu_memory_allow_growth);
    
      (*config.mutable_device_count())["CPU"] = num_cpu_devices;
    
      // TODO(b/113217601): This is needed for EagerContext::runner_ to use a
      // threadpool, so that we avoid the possibility of running the runner_ in the
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 16:27:48 UTC 2024
    - 29.5K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/util/concurrent/InterruptibleTask.java

            blocker = (Blocker) state;
          }
          spinCount++;
          if (spinCount > MAX_BUSY_WAIT_SPINS) {
            /*
             * If we have spun a lot, just park ourselves. This will save CPU while we wait for a slow
             * interrupting thread. In theory, interruptTask() should be very fast, but due to
             * InterruptibleChannel and JavaLangAccess.blockedOn(Thread, Interruptible), it isn't
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 17 02:42:09 UTC 2024
    - 10.1K bytes
    - Viewed (0)
Back to top