EdColeman commented on issue #4521: URL: https://github.com/apache/accumulo/issues/4521#issuecomment-2093012145
I was wondering if instead of going in a predictable order if the algorithm picked a random start point? Maybe treat the list of tables (by id?) as a ring buffer, and then start somewhere random in the buffer and walk-through the candidates until you reach the start point? This may help preventing getting stuck on tables that sort first. An alternative may be to gather a count of all tables that need migration and then work them off in order, starting with the largest counts. Would this help it converge faster? -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
