Search Options

Results per page
Sort
Preferred Languages
Advance

Results 91 - 100 of 1,718 for central (0.36 sec)

  1. 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)
  2. docs/ko/docs/async.md

    이 시나리오에서, (당신을 포함한) 각각의 청소부들은 프로세서가 될 것이고, 각자의 역할을 수행합니다.
    
    실행 시간의 대부분이 대기가 아닌 실제 작업에 소요되고, 컴퓨터에서 작업은 <abbr title="Central Processing Unit">CPU</abbr>에서 이루어지므로, 이러한 문제를 "CPU에 묶였"다고 합니다.
    
    ---
    
    CPU에 묶인 연산에 관한 흔한 예시는 복잡한 수학 처리를 필요로 하는 경우입니다.
    
    예를 들어:
    
    * **오디오** 또는 **이미지** 처리.
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu Apr 18 19:53:19 UTC 2024
    - 26.7K bytes
    - Viewed (0)
  3. 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)
  4. 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)
  5. docs/ja/docs/async.md

    このシナリオでは、清掃員 (あなたを含む) のそれぞれがプロセッサとなり、それぞれの役割を果たします。
    
    また、実行時間のほとんどは (待機ではなく) 実際の作業に費やされ、コンピュータでの作業は<abbr title="Central Processing Unit">CPU</abbr>によって行われます。これらの問題は「CPUバウンド」と言います。
    
    ---
    
    CPUバウンド操作の一般的な例は、複雑な数学処理が必要なものです。
    
    例えば:
    
    * **オーディオ** や **画像処理**。
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Thu Apr 18 19:53:19 UTC 2024
    - 27.8K bytes
    - Viewed (0)
  6. docs/de/docs/how-to/general.md

    Nils Lindemann <******@****.***> 1711822722 +0100
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Sat Mar 30 18:18:42 UTC 2024
    - 2.9K bytes
    - Viewed (0)
  7. pkg/collateral/control.go

    	"github.com/spf13/cobra/doc"
    	"github.com/spf13/pflag"
    	"sigs.k8s.io/yaml"
    
    	"istio.io/istio/pkg/collateral/metrics"
    	"istio.io/istio/pkg/env"
    )
    
    // Control determines the behavior of the EmitCollateral function
    type Control struct {
    	// OutputDir specifies the directory to output the collateral files
    	OutputDir string
    
    	// EmitManPages controls whether to produce man pages.
    	EmitManPages bool
    
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Wed Jan 10 03:51:36 UTC 2024
    - 17.8K bytes
    - Viewed (0)
  8. docs/zh/docs/how-to/general.md

    Bill Zhong <******@****.***> 1713829269 -0230
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Mon Apr 22 23:41:09 UTC 2024
    - 2.1K bytes
    - Viewed (0)
  9. docs/tr/docs/how-to/general.md

    Hasan Sezer Taşan <******@****.***> 1716826852 +0300
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Mon May 27 16:20:52 UTC 2024
    - 2.6K bytes
    - Viewed (0)
  10. src/runtime/proc.go

    	if len(pp.sudogcache) == 0 {
    		lock(&sched.sudoglock)
    		// First, try to grab a batch from central cache.
    		for len(pp.sudogcache) < cap(pp.sudogcache)/2 && sched.sudogcache != nil {
    			s := sched.sudogcache
    			sched.sudogcache = s.next
    			s.next = nil
    			pp.sudogcache = append(pp.sudogcache, s)
    		}
    		unlock(&sched.sudoglock)
    		// If the central cache is empty, allocate a new one.
    		if len(pp.sudogcache) == 0 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 207.5K bytes
    - Viewed (0)
Back to top