jieguangzhou commented on issue #10996: URL: https://github.com/apache/dolphinscheduler/issues/10996#issuecomment-1185577733
> > I think we can treat it as a [knapsack problem](https://en.wikipedia.org/wiki/Knapsack_problem), and use the Hungarian algorithm to solve it. > > > > 1. Worker available memory as backpack capacity > > 2. Task memory is used as item weight > > 3. Task priority as item value (Or other reference values as values) > > > > But there is an assumption: > > > > 1. We know the task memory usage > > > > I don't know if that complicates the problem. > > I learned about the backpack algorithm, I think this issue does not fall into the category of backpack algorithms, but is bin packing problem. I'm sorry I got it wrong, it's more of a generalized assignment problem. But on second thought, our scenario might not be so complicated that it might be harder to maintain the project. I think your approach is fine -- 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]
