Scheduling Invasive Multi-Core Programs Under Uncertainty (A05*)

该项目探索并数学分析了不确定输入下多核系统中的调度和资源管理算法。我们在入侵计算范例中开发了算法，这些算法可以处理不确定的任务集、未知的到达时间或不确定的任务执行时间，同时提供关于非功能属性的可证明的性能保证。新提出的项目具有基础性，建立在算法理论和数学优化方法的基础上。

This project explores and mathematically analyses algorithms for scheduling and resource management in multi-core systems under uncertain input. We develop algorithms within the invasive computing paradigm that can handle e.g. uncertain task sets, unknown arrival times or uncertain task execution times while giving provable performance guarantees regarding non-functional properties. The newly proposed project is of foundational character and builds on methods from algorithms theory and mathematical optimisation.