zhuxt2015 commented on issue #10996: URL: https://github.com/apache/dolphinscheduler/issues/10996#issuecomment-1185368285
> 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. @jieguangzhou We can not exactly get task memory usage before execute task, Can only be estimated. -- 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]
