Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 133 for cpus (0.17 sec)

  1. cmd/update.go

    		}
    	}
    	uaAppend("; ", "")
    
    	if cpus, err := gopsutilcpu.Info(); err == nil && len(cpus) > 0 {
    		cpuMap := make(map[string]struct{}, len(cpus))
    		coreMap := make(map[string]struct{}, len(cpus))
    		for i := range cpus {
    			cpuMap[cpus[i].PhysicalID] = struct{}{}
    			coreMap[cpus[i].CoreID] = struct{}{}
    		}
    		cpu := cpus[0]
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Wed Apr 24 04:08:47 GMT 2024
    - 18.7K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/hash/Striped64.java

       * using a secondary hash (Marsaglia XorShift) to try to find a
       * free slot.
       *
       * The table size is capped because, when there are more threads
       * than CPUs, supposing that each thread were bound to a CPU,
       * there would exist a perfect hash function mapping threads to
       * slots that eliminates collisions. When we reach capacity, we
       * search for this mapping by randomly varying the hash codes of
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 11.5K bytes
    - Viewed (0)
  3. guava/src/com/google/common/cache/Striped64.java

       * using a secondary hash (Marsaglia XorShift) to try to find a
       * free slot.
       *
       * The table size is capped because, when there are more threads
       * than CPUs, supposing that each thread were bound to a CPU,
       * there would exist a perfect hash function mapping threads to
       * slots that eliminates collisions. When we reach capacity, we
       * search for this mapping by randomly varying the hash codes of
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 11.5K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/cache/Striped64.java

       * using a secondary hash (Marsaglia XorShift) to try to find a
       * free slot.
       *
       * The table size is capped because, when there are more threads
       * than CPUs, supposing that each thread were bound to a CPU,
       * there would exist a perfect hash function mapping threads to
       * slots that eliminates collisions. When we reach capacity, we
       * search for this mapping by randomly varying the hash codes of
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 11.5K bytes
    - Viewed (0)
  5. docs/de/docs/deployment/server-workers.md

    ## Zusammenfassung
    
    Sie können **Gunicorn** (oder auch Uvicorn) als Prozessmanager mit Uvicorn-Workern verwenden, um **Multikern-CPUs** zu nutzen und **mehrere Prozesse parallel** auszuführen.
    
    Sie können diese Tools und Ideen nutzen, wenn Sie **Ihr eigenes Deployment-System** einrichten und sich dabei selbst um die anderen Deployment-Konzepte kümmern.
    
    Plain Text
    - Registered: Sun May 05 07:19:11 GMT 2024
    - Last Modified: Sat Mar 30 18:19:25 GMT 2024
    - 10.1K bytes
    - Viewed (0)
  6. docs/security/README.md

    - [PRF](#prf): HMAC-SHA-256
    - [AEAD](#aead): AES-256-GCM if the CPU supports AES-NI, ChaCha20-Poly1305 otherwise. More specifically AES-256-GCM is only selected for X86-64 CPUs with AES-NI extension.
    
    Plain Text
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Sat Feb 12 00:51:25 GMT 2022
    - 13.8K bytes
    - Viewed (0)
  7. docs/en/docs/deployment/concepts.md

    On the other hand, if you have 2 servers and you are using **100% of their CPU and RAM**, at some point one process will ask for more memory, and the server will have to use the disk as "memory" (which can be thousands of times slower), or even **crash**. Or one process might need to do some computation and would have to wait until the CPU is free again.
    
    Plain Text
    - Registered: Sun May 05 07:19:11 GMT 2024
    - Last Modified: Thu May 02 22:37:31 GMT 2024
    - 18K bytes
    - Viewed (0)
  8. tensorflow/c/eager/c_api_experimental.cc

    void TFE_SetLogicalCpuDevices(TFE_Context* ctx, int num_cpus,
                                  const char* prefix, TF_Status* status) {
      std::vector<std::unique_ptr<tensorflow::Device>> devices;
    
      if (prefix == nullptr || strlen(prefix) == 0)
        prefix = "/job:localhost/replica:0/task:0";
    
      tensorflow::SessionOptions sess_options;
      (*sess_options.config.mutable_device_count())["CPU"] = num_cpus;
      status->status =
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Apr 11 23:52:39 GMT 2024
    - 35.9K bytes
    - Viewed (3)
  9. docs/de/docs/deployment/concepts.md

    Wie viele Systemressourcen möchten Sie verbrauchen/nutzen? Sie mögen „nicht viel“ denken, aber in Wirklichkeit möchten Sie tatsächlich **so viel wie möglich ohne Absturz** verwenden.
    
    Plain Text
    - Registered: Sun May 05 07:19:11 GMT 2024
    - Last Modified: Sat Mar 30 20:16:25 GMT 2024
    - 20.6K bytes
    - Viewed (0)
  10. cmd/notification.go

    		if nErr.Err != nil {
    			peersLogOnceIf(logger.SetReqInfo(ctx, reqInfo), nErr.Err, nErr.Host.String())
    		}
    	}
    }
    
    // GetCPUs - Get all CPU information.
    func (sys *NotificationSys) GetCPUs(ctx context.Context) []madmin.CPUs {
    	reply := make([]madmin.CPUs, len(sys.peerClients))
    
    	g := errgroup.WithNErrs(len(sys.peerClients))
    	for index, client := range sys.peerClients {
    		if client == nil {
    			continue
    		}
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Fri Apr 12 18:13:36 GMT 2024
    - 44.5K bytes
    - Viewed (0)
Back to top