Details
-
Improvement
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
2.5
Description
Currently, we validate partition states one-by-one and the whole algorithm has complexity O (G * P * N * logP), where G - number of cache groups, P - number of partition in each of cache groups, N - the number of nodes. Overall complexity can be optimized (logP can be removed). We also should consider parallelization of algorithm.
Attachments
Issue Links
- links to