主講人：何黎剛

時(shí)間：2017年9月1日（周五）15：00

地點(diǎn)：東校區信息館401學(xué)術(shù)報告廳

主講人簡(jiǎn)介：何黎剛現為英國華威大學(xué)（University of Warwick）計算機系副教授（華威大學(xué)2016年最新英國大學(xué)綜合排名第6，計算機系最新英國大學(xué)研究實(shí)力排名（REF Ranking）第2），研究領(lǐng)域為高性能計算，并行分布式處理和云計算。在國際知名期刊（例如IEEE Transactions on Parallel and Distributed Systems, Journal of Parallel and Distributed Computing, Journal of Computer and System Sciences等）和重要會(huì )議上(例如VLDB，IPDPS, ICPP, ICSOC等)發(fā)表上述領(lǐng)域的論文90余篇。Dr.He在英國主持過(guò)來(lái)自英國EPRSC、Leverhulme及公司的多項科研項目資助。Dr. He為多家國際期刊的編委或專(zhuān)刊客座編委（例如CCPE等），并經(jīng)常擔任國際會(huì )議（如ICPP等）的會(huì )議主席及程序委員會(huì )成員。

講座簡(jiǎn)介：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.

信息科學(xué)與工程學(xué)院

2017年8月30日