Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 190 for bound (0.02 sec)

  1. ci/official/requirements_updater/nvidia-requirements.txt

    nvidia-cublas-cu12>=12.5.3.2,<13.0
    nvidia-cuda-cupti-cu12>=12.5.82,<13.0
    nvidia-cuda-nvcc-cu12>=12.5.82,<13.0
    nvidia-cuda-nvrtc-cu12>=12.5.82,<13.0
    nvidia-cuda-runtime-cu12>=12.5.82,<13.0
    # The upper bound is set for the CUDNN API compatibility.
    # See
    # https://docs.nvidia.com/deeplearning/cudnn/backend/latest/developer/forward-compatibility.html#cudnn-api-compatibility
    nvidia-cudnn-cu12>=9.3.0.75,<10.0
    nvidia-cufft-cu12>=11.2.3.61,<12.0
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Wed Sep 03 23:57:17 UTC 2025
    - 646 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 Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 24K bytes
    - Viewed (0)
  3. api/maven-api-core/src/main/java/org/apache/maven/api/Lifecycle.java

         */
        Collection<Alias> aliases();
    
        /**
         * A phase in the lifecycle.
         *
         * A phase is identified by its name. It also contains a list of plugins bound to that phase,
         * a list of {@link Link links}, and a list of sub-phases.  This forms a tree of phases.
         */
        interface Phase {
    
            // ======================
            // Maven defined phases
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  4. docs/fa/docs/async.md

    و چون بیشتر زمان اجرا صرف کار واقعی می‌شه (به جای انتظار)، و کار توی کامپیوتر با <abbr title="واحد پردازش مرکزی">CPU</abbr> انجام می‌شه، به این مشکلات می‌گن "CPU bound".
    
    ---
    
    مثال‌های رایج عملیات CPU bound چیزایی هستن که نیاز به پردازش ریاضی پیچیده دارن.
    
    مثلاً:
    
    * پردازش **صدا** یا **تصویر**.
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 32.9K bytes
    - Viewed (0)
  5. docs/es/docs/async.md

    * que una query de base de datos devuelva los resultados
    * etc.
    
    Como el tiempo de ejecución se consume principalmente esperando operaciones de <abbr title="Input and Output">I/O</abbr>, las llaman operaciones "I/O bound".
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 24.7K bytes
    - Viewed (0)
  6. docs/fr/docs/async.md

    ---
    
    Des exemples communs d'opérations "CPU bounds" sont les procédés qui requièrent des traitements mathématiques complexes.
    
    Par exemple :
    
    * Traitements d'**audio** et d'**images**.
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 25.4K bytes
    - Viewed (0)
  7. docs/ru/docs/async.md

    * получение результатов запроса к базе данных
    * и т. д.
    
    Поскольку в основном время тратится на ожидание выполнения операций <abbr title="Ввода-вывода">I/O</abbr>,
    их обычно называют операциями, <abbr title="I/O bound">ограниченными скоростью ввода-вывода</abbr>.
    
    Код называют "асинхронным", потому что компьютеру / программе не требуется "синхронизироваться" с медленной задачей и,
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 39.8K bytes
    - Viewed (0)
  8. cmd/data-usage-cache.go

    		if v := d.find(want[:idx]); v != nil {
    			_, ok := v.Children[want]
    			if ok {
    				found := hashPath(want[:idx])
    				return &found
    			}
    		}
    	}
    	for k, v := range d.Cache {
    		_, ok := v.Children[want]
    		if ok {
    			found := dataUsageHash(k)
    			return &found
    		}
    	}
    	return nil
    }
    
    // deleteRecursive will delete an entry recursively, but not change its parent.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 34.7K bytes
    - Viewed (0)
  9. docs/de/docs/async.md

    * usw.
    
    Da die Ausführungszeit hier hauptsächlich durch das Warten auf <abbr title="Input and Output – Eingabe und Ausgabe">I/O</abbr>-Operationen verbraucht wird, nennt man dies auch „I/O-lastige“ („I/O bound“) Operationen.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 26.5K bytes
    - Viewed (0)
  10. docs/tr/docs/async.md

    Yürütme süresinin çoğu (beklemek yerine) iş yapıldığından ve bilgisayardaki iş bir <abbr title="Central Processing Unit">CPU</abbr> tarafından yapıldığından, bu sorunlara "CPU bound" diyorlar".
    
    ---
    
    CPU'ya bağlı işlemlerin yaygın örnekleri, karmaşık matematik işlemleri gerektiren işlerdir.
    
    Örneğin:
    
    * **Ses** veya **görüntü işleme**.
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 21.8K bytes
    - Viewed (0)
Back to top