Home
last modified time | relevance | path

Searched refs:sharded (Results 1 – 5 of 5) sorted by relevance

/third_party/mindspore/mindspore/ccsrc/ps/
Doptimizer_info_builder.h38 bool sharded);
42 … const std::shared_ptr<PServerKernel> &pserver_kernel, bool sharded) = 0;
61 … const std::shared_ptr<PServerKernel> &pserver_kernel, bool sharded) override;
70 … const std::shared_ptr<PServerKernel> &pserver_kernel, bool sharded) override;
79 … const std::shared_ptr<PServerKernel> &pserver_kernel, bool sharded) override;
Doptimizer_info_builder.cc29 bool sharded) { in Build() argument
34 BuildInputs(weight, keys, values, lens, inputs_shape, worker_num, pserver_kernel, sharded); in Build()
148 … const std::shared_ptr<PServerKernel> &, bool sharded) { in BuildInputs() argument
202 grad, indices, sharded); in BuildInputs()
208 bool sharded) { in BuildInputs() argument
245 return new SparseFtrlOptimInfo(weight_addr, accum, linear, grad, indices, sharded); in BuildInputs()
Doptimizer_info.h105 const AddressPtr &indices, bool sharded);
119 const AddressPtr &grad, const AddressPtr &indices, bool sharded);
Doptimizer_info.cc309 const AddressPtr &indices, bool sharded) { in SparseAdamOptimInfo() argument
334 sharded_ = sharded; in SparseAdamOptimInfo()
373 … const AddressPtr &grad, const AddressPtr &indices, bool sharded) { in SparseFtrlOptimInfo() argument
386 sharded_ = sharded; in SparseFtrlOptimInfo()
/third_party/grpc/doc/core/
Dgrpc-polling-engines.md115 - The logic to choose a designated poller is quite complicated. Pollsets are internally sharded int…