- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for Shuffle (0.16 sec)
-
cmd/erasure-metadata-utils.go
return shuffledPartsMetadata } // shuffleDisks - shuffle input disks slice depending on the // erasure distribution. Return shuffled slice of disks with // their expected distribution. func shuffleDisks(disks []StorageAPI, distribution []int) (shuffledDisks []StorageAPI) { if distribution == nil { return disks } shuffledDisks = make([]StorageAPI, len(disks)) // Shuffle disks for expected distribution.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Apr 23 17:15:52 GMT 2024 - 11.3K bytes - Viewed (0) -
docs/bigdata/README.md
mapreduce.fileoutputcommitter.algorithm.version=2 # Use the latest committer version mapreduce.job.reduce.slowstart.completedmaps=0.99 # 99% map, then reduce mapreduce.reduce.shuffle.input.buffer.percent=0.9 # Min % buffer in RAM mapreduce.reduce.shuffle.merge.percent=0.9 # Minimum % merges in RAM mapreduce.reduce.speculative=false # Disable speculation for reducing mapreduce.task.io.sort.factor=999 # Threshold before writing to disk
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) -
cmd/xl-storage-format-v2_test.go
} buf = xlMetaV2TrimData(buf) vers = append(vers, metaCacheEntry{ name: "a", metadata: buf, }) } // Shuffle... for i := 0; i < 100; i++ { rng := rand.New(rand.NewSource(int64(i))) rng.Shuffle(len(vers), func(i, j int) { vers[i], vers[j] = vers[j], vers[i] }) var entries []chan metaCacheEntry for _, v := range vers { v.cached = nil
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Mar 08 17:50:48 GMT 2024 - 36.4K bytes - Viewed (0) -
cmd/global-heal.go
if len(disks) < er.setDriveCount/2 { return fmt.Errorf("not enough drives (found=%d, healing=%d, total=%d) are available to heal `%s`", len(disks), healing, er.setDriveCount, tracker.disk.String()) } rand.Shuffle(len(disks), func(i, j int) { disks[i], disks[j] = disks[j], disks[i] }) expectedDisks := len(disks)/2 + 1 fallbackDisks := disks[expectedDisks:] disks = disks[:expectedDisks]
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 15K bytes - Viewed (1) -
cmd/erasure.go
NextCycle: oldCache.Info.NextCycle, }, Cache: make(map[string]dataUsageEntry, len(oldCache.Cache)), } // Put all buckets into channel. bucketCh := make(chan BucketInfo, len(buckets)) // Shuffle buckets to ensure total randomness of buckets, being scanned. // Otherwise same set of buckets get scanned across erasure sets always. // at any given point in time. This allows different buckets to be scanned
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 16K bytes - Viewed (1) -
cmd/metacache-set.go
askDisks = len(disks) // use all available drives } // However many we ask, versions must exist on ~50% listingQuorum := (askDisks + 1) / 2 if askDisks > 0 && len(disks) > askDisks { rand.Shuffle(len(disks), func(i, j int) { disks[i], disks[j] = disks[j], disks[i] }) fallbackDisks = disks[askDisks:] disks = disks[:askDisks] } // How to resolve results.
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed May 01 17:59:08 GMT 2024 - 30.4K bytes - Viewed (0) -
cmd/metacache-entries_test.go
// Run for a number of times, shuffling the input to ensure that output is consistent. for i := 0; i < 10; i++ { t.Run(fmt.Sprintf("test-%d-%s-run-%d", testID, tt.name, i), func(t *testing.T) { if i > 0 { rng.Shuffle(len(tt.m), func(i, j int) { tt.m[i], tt.m[j] = tt.m[j], tt.m[i] }) } gotSelected, gotOk := tt.m.resolve(&tt.r) if gotOk != tt.wantOk {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Jan 02 17:15:06 GMT 2022 - 31.6K bytes - Viewed (0)