- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 917 for optimal (0.41 sec)
-
cmd/warm-backend-minio.go
maxPartsCount = 10000 maxPartSize = 1024 * 1024 * 1024 * 5 minPartSize = 1024 * 1024 * 128 // chosen by us to be optimal for HDDs ) // optimalPartInfo - calculate the optimal part info for a given // object size. // // NOTE: Assumption here is that for any object to be uploaded to any S3 compatible // object storage it will have the following parameters as constants.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Apr 21 11:43:18 GMT 2024 - 3.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
// n: expected insertions // b: m/n, bits per insertion // p: expected false positive probability // // 1) Optimal k = b * ln2 // 2) p = (1 - e ^ (-kn/m))^k // 3) For optimal k: p = 2 ^ (-k) ~= 0.6185^b // 4) For optimal k: m = -nlnp / ((ln2) ^ 2) /** * Computes the optimal k (number of hashes per element inserted in Bloom filter), given the * expected insertions and total number of bits in the Bloom filter.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
docs/bigdata/README.md
alias kv-pairify='yq ".configuration[]" | jq ".[]" | jq -r ".name + \"=\" + .value"' ``` Let's take for example a set of 12 compute nodes with an aggregate memory of _1.2TiB_, we need to do following settings for optimal results. Add the following optimal entries for _core-site.xml_ to configure _s3a_ with **MinIO**. Most important options here are ``` cat ${HADOOP_CONF_DIR}/core-site.xml | kv-pairify | grep "mapred"
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) -
android/guava/src/com/google/common/collect/SingletonImmutableSet.java
final class SingletonImmutableSet<E> extends ImmutableSet<E> { // We deliberately avoid caching the asList and hashCode here, to ensure that with // compressed oops, a SingletonImmutableSet packs all the way down to the optimal 16 bytes. final transient E element; SingletonImmutableSet(E element) { this.element = Preconditions.checkNotNull(element); } @Override public int size() { return 1; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 2.5K bytes - Viewed (0) -
internal/config/api/help.go
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Mar 15 01:07:19 GMT 2024 - 4.7K bytes - Viewed (0) -
docs/throttle/README.md
Example: Limit a MinIO cluster to accept at max 1600 simultaneous S3 API requests across all nodes of the cluster. ```sh export MINIO_API_REQUESTS_MAX=1600
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat Feb 12 00:51:25 GMT 2022 - 2.4K bytes - Viewed (0) -
internal/crypto/sse.go
// to derive & seal the key-encryption-key and to en/decrypt the object data. // This algorithm should not be used for new objects because its key derivation // is not optimal. See: https://github.com/minio/minio/pull/6121 InsecureSealAlgorithm = "DARE-SHA256" ) // Type represents an AWS SSE type: // - SSE-C // - SSE-S3 // - SSE-KMS type Type interface { fmt.Stringer
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Aug 30 15:26:43 GMT 2022 - 4.4K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
type endpointSet struct { argPatterns []ellipses.ArgPattern endpoints []string // Endpoints saved from previous GetEndpoints(). setIndexes [][]uint64 // All the sets. } // Supported set sizes this is used to find the optimal // single set size. var setSizes = []uint64{2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16} // getDivisibleSize - returns a greatest common divisor of // all the ellipses sizes.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 14.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
tester.testAllPublicInstanceMethods(BloomFilter.create(Funnels.unencodedCharsFunnel(), 100)); tester.testAllPublicStaticMethods(BloomFilter.class); } /** Tests that we never get an optimal hashes number of zero. */ public void testOptimalHashes() { for (int n = 1; n < 1000; n++) { for (int m = 0; m < 1000; m++) { assertTrue(BloomFilter.optimalNumOfHashFunctions(n, m) > 0); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
cni/pkg/nodeagent/netns_linux.go
// Unlock the current thread only when we successfully switched back // to the original namespace; otherwise leave the thread locked which // will force the runtime to scrap the current thread, that is maybe // not as optimal but at least always safe to do. runtime.UnlockOSThread() } }() return toRun() } var wg sync.WaitGroup wg.Add(1) // Start the callback in a new green thread so that if we later fail
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Wed Jan 31 10:05:36 GMT 2024 - 2.7K bytes - Viewed (0)