主讲人简介：何黎刚现为英国华威大学（University of Warwick）计算机系副教授（华威大学2016年最新英国大学综合排名第6，计算机系最新英国大学研究实力排名（REF Ranking）第2），研究领域为高性能计算，并行分布式处理和云计算。在国际知名期刊（例如IEEE Transactions on Parallel and Distributed Systems, Journal of Parallel and Distributed Computing, Journal of Computer and System Sciences等）和重要会议上(例如VLDB，IPDPS, ICPP, ICSOC等)发表上述领域的论文90余篇。Dr.He在英国主持过来自英国EPRSC、Leverhulme及公司的多项科研项目资助。Dr. He为多家国际期刊的编委或专刊客座编委（例如CCPE等），并经常担任国际会议（如ICPP等）的会议主席及程序委员会成员。
讲座简介：It is common nowadays that multiple cores reside on the same chip and share the on-chip cache. Resource sharing may cause performance degradation of the co-running jobs. Job co-scheduling is a technique that can effectively alleviate the contention. Many co-schedulers have been developed in the literature, but most of them do not aim to find the optimal co-scheduling solution. Being able to determine the optimal solution is critical for evaluating co-scheduling systems. Moreover, most co-schedulers only consider serial jobs. However, there often exist both parallel and serial jobs in many situations. This talk presents our work to tackle these issues. In this work, a graph-based method is developed to find the optimal co-scheduling solution for serial jobs, and then the method is extended to incorporate parallel jobs. A number of optimization measures are also developed to accelerate the solving process. Moreover, a flexible approximation technique is proposed to strike the balance between the solving speed and the solution quality.