- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 825 for Threads (0.28 sec)
-
docs/bigdata/README.md
``` hive.blobstore.use.blobstore.as.scratchdir=true hive.exec.input.listing.max.threads=50 hive.load.dynamic.partitions.thread=25 hive.metastore.fshandler.threads=50 hive.mv.files.threads=40 mapreduce.input.fileinputformat.list-status.num-threads=50 ```
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 14.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/ExecutionListBenchmark.java
executorService = new ThreadPoolExecutor( NUM_THREADS, NUM_THREADS, Long.MAX_VALUE, TimeUnit.SECONDS, new ArrayBlockingQueue<Runnable>(1000)); executorService.prestartAllCoreThreads(); final AtomicInteger integer = new AtomicInteger(); // Execute a bunch of tasks to ensure that our threads are allocated and hot for (int i = 0; i < NUM_THREADS * 10; i++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 17 15:19:38 GMT 2023 - 20.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Callables.java
* running will have the given name. * * @param callable The callable to wrap * @param nameSupplier The supplier of thread names, {@link Supplier#get get} will be called once * for each invocation of the wrapped callable. */ @J2ktIncompatible @GwtIncompatible // threads static <T extends @Nullable Object> Callable<T> threadRenaming(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 18:32:03 GMT 2023 - 4.4K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* 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 * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations,
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) -
src/main/java/org/codelibs/fess/app/web/api/admin/stats/ApiAdminStatsAction.java
return jvmGcObj; }).toArray(n -> new JvmGcObj[n]); final Threads threads = jvmStats.getThreads(); final JvmThreadsObj jvmThreadsObj = new JvmThreadsObj(); jvmObj.threads = jvmThreadsObj; jvmThreadsObj.count = threads.getCount(); jvmThreadsObj.peak = threads.getPeakCount(); final Classes classes = jvmStats.getClasses();
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 12.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/CallablesTest.java
public @Nullable Void call() throws Exception { assertEquals(Thread.currentThread().getName(), newName.get()); return null; } }; Callables.threadRenaming(callable, newName).call(); assertEquals(oldName, Thread.currentThread().getName()); } @J2ktIncompatible @GwtIncompatible // threads public void testRenaming_exceptionalReturn() throws Exception {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 5.4K bytes - Viewed (0) -
misc/cgo/gmp/fib.go
// that pass integers back and forth. No actual // concurrency, just threads and synchronization // and foreign code on multiple pthreads. package main import ( big "." "runtime" ) func fibber(c chan *big.Int, out chan string, n int64) { // Keep the fibbers in dedicated operating system // threads, so that this program tests coordination // between pthreads and not just goroutines. runtime.LockOSThread()
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Apr 10 22:32:35 GMT 2023 - 919 bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* 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 * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow, * and because threads are typically not bound to CPUS forever, * may not occur at all. However, despite these limitations,
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) -
android/guava-tests/benchmark/com/google/common/util/concurrent/ExecutionListBenchmark.java
executorService = new ThreadPoolExecutor( NUM_THREADS, NUM_THREADS, Long.MAX_VALUE, TimeUnit.SECONDS, new ArrayBlockingQueue<Runnable>(1000)); executorService.prestartAllCoreThreads(); final AtomicInteger integer = new AtomicInteger(); // Execute a bunch of tasks to ensure that our threads are allocated and hot for (int i = 0; i < NUM_THREADS * 10; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 17 15:19:38 GMT 2023 - 20.4K bytes - Viewed (0) -
.github/workflows/lock.yml
name: 'Lock Threads' on: schedule: - cron: '0 0 * * *' workflow_dispatch: permissions: issues: write concurrency: group: lock jobs: action: runs-on: ubuntu-latest steps: - uses: dessant/lock-threads@v3 with: github-token: ${{ github.token }} issue-inactive-days: '365' exclude-any-issue-labels: 'do-not-close'
Others - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Jan 30 03:27:43 GMT 2022 - 447 bytes - Viewed (0)