Solving data placement as an integer linear program (ILP) is precise but slow. CATER combines ILP for global optimality and heuristics for real-time adaptability, reducing computation time by 90% while keeping constraint violations at 0%.
🌟 Follow us on LinkedIn! https://www.linkedin.com/company/clever-project/?viewAsMember=true
🌟 Check the updates from the website: www.cleverproject.eu
🌟 Full paper in: https://zenodo.org/records/11128962