- Sort Score
- Result 10 results
- Languages All
Results 181 - 190 of 3,800 for central (0.12 sec)
-
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:
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Mon May 20 00:24:48 UTC 2024 - 23K bytes - Viewed (0) -
docs/de/docs/async.md
Und da die meiste Ausführungszeit durch tatsächliche Arbeit (anstatt durch Warten) in Anspruch genommen wird und die Arbeit in einem Computer von einer <abbr title="Central Processing Unit – Zentrale Recheneinheit">CPU</abbr> erledigt wird, werden diese Probleme als „CPU-lastig“ („CPU bound“) bezeichnet. ---
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat Mar 30 18:06:16 UTC 2024 - 26.6K bytes - Viewed (0) -
docs/zh/docs/async.md
无论是否轮流执行(并发),都需要相同的时间来完成,而你也会完成相同的工作量。 但在这种情况下,如果你能带上 8 名前收银员/厨师,现在是清洁工一起清扫,他们中的每一个人(加上你)都能占据房子的一个区域来清扫,你就可以在额外的帮助下并行的更快地完成所有工作。 在这个场景中,每个清洁工(包括您)都将是一个处理器,完成这个工作的一部分。 由于大多数执行时间是由实际工作(而不是等待)占用的,并且计算机中的工作是由 <abbr title="Central Processing Unit">CPU</abbr> 完成的,所以他们称这些问题为"CPU 密集型"。 --- CPU 密集型操作的常见示例是需要复杂的数学处理。 例如: * **音频**或**图像**处理; * **计算机视觉**: 一幅图像由数百万像素组成,每个像素有3种颜色值,处理通常需要同时对这些像素进行计算;
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 21.1K bytes - Viewed (0) -
pkg/apis/batch/validation/validation_test.go
`Australia/Victoria`, `Australia/West`, `Australia/Yancowinna`, `Brazil/Acre`, `Brazil/DeNoronha`, `Brazil/East`, `Brazil/West`, `Canada/Atlantic`, `Canada/Central`, `Canada/Eastern`, `Canada/Mountain`, `Canada/Newfoundland`, `Canada/Pacific`, `Canada/Saskatchewan`, `Canada/Yukon`, `CET`, `Chile/Continental`, `Chile/EasterIsland`,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 20:49:09 UTC 2024 - 124.3K bytes - Viewed (0) -
src/runtime/arena.go
s.freeIndexForScan = 1 // Set up the range for allocation. s.userArenaChunkFree = makeAddrRange(base, base+s.elemsize) // Put the large span in the mcentral swept list so that it's // visible to the background sweeper. h.central[spc].mcentral.fullSwept(h.sweepgen).push(s) // Set up an allocation header. Avoid write barriers here because this type // is not a real type, and it exists in an invalid location.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:44:56 UTC 2024 - 37.9K bytes - Viewed (0) -
docs/ko/docs/async.md
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 26.7K bytes - Viewed (0) -
docs/en/docs/how-to/general.md
# General - How To - Recipes Here are several pointers to other places in the docs, for general or frequent questions. ## Filter Data - Security To ensure that you don't return more data than you should, read the docs for [Tutorial - Response Model - Return Type](../tutorial/response-model.md){.internal-link target=_blank}. ## Documentation Tags - OpenAPI
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat Aug 19 19:54:04 UTC 2023 - 2.3K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/jvm/building_java_projects.adoc
.Declaring dependencies ==== include::sample[dir="snippets/java/basic/kotlin",files="build.gradle.kts[tags=java-dependency-mgmt]"]
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Apr 01 15:00:23 UTC 2024 - 44.1K bytes - Viewed (0) -
src/runtime/panic.go
// After this point we can copy the stack. if !d.heap { return } mp := acquirem() pp := mp.p.ptr() if len(pp.deferpool) == cap(pp.deferpool) { // Transfer half of local cache to the central cache. var first, last *_defer for len(pp.deferpool) > cap(pp.deferpool)/2 { n := len(pp.deferpool) d := pp.deferpool[n-1] pp.deferpool[n-1] = nil pp.deferpool = pp.deferpool[:n-1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 43.8K bytes - Viewed (0) -
docs/ja/docs/async.md
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 27.8K bytes - Viewed (0)