Comparability graph coloring for optimizing utilization of stream register files in stream processors

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, optimizing utilization of the SRF is crucial for good performance. 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. We present a compiler algorithm that can find optimal or near-optimal colorings in stream IGs, thereby improving SRF utilization than the First-Fit bin-packing algorithm, the best in the literature. Categories and Subject Descriptors D.3.4 [Programming Languages]: Processors--compilers and optimization; B.3.2 [Memory Structures]: Design Styles--Primary memory General Terms Algorithms, Languages, Performance Keywords Stream proces...

• Type: Conference
• Year: 2009
• Where: PPOPP
• Authors: Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying Zhang
• Keywords: Keywords Stream Processor, Multiple Comparability Graphs, Parallel Computing, PPOPP 2009, Stream Igs