國立清華大學

資訊工程學系

Department Of Computer Science

National Tsing Hua University

專題演講

SEMINAR

主 講 人:  Prof. Jingling Xue

SPEAKER   (UNSW, Australia)

題  目：Comparability Graph Coloring for Managing Stream Register Files

TOPIC

時  間：101年5月22日(二)  PM 3:20-4:20

DATE

地    點：資電館129

PLACE

          連絡人：李政崑教授

敬請踴躍參加

Speaker’s Bio:

Professor Xue leads the Programming Languages and Compilers Group and its subgroup Compiler Research Group (CORG) at UNSW. His research interests are programming languages, compiler optimisations, computer architecture, parallel computing, distributed systems and cluster computing, and embedded systems. His current projects include concurrent programming for multicores, compiler techniques for OO languages, static program analysis for bugs and security vulnerabilities, compiler techniques for memory hierarchy performance, compiler techniques for embedded systems, compiler support for power and energy management, and parallelising and optimising compilers.

Abstract:

A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements.

During the execution of a kernel, all streams accessed must be communicated through the SRF (Stream Register File), a non-bypassing software-managed on-chip memory. Therefore, optimising utilisation of the SRF is crucial for good performance.

In this talk, I will introduce a compiler technique that aims to optimise utilisation of SRF by means of comparability graph coloring. The key insight is that the interference graphs formed by the streams in stream applications tend to be comparability graphs or decomposable into a set of multiple comparability graphs. Our compiler algorithm can find optimal or near-optimal colorings for stream applications, thereby obtaining better solutions than First-Fit bin-packing in many applications tested.