Scheduling instructions by direct placement

Abstract

Abstract. This paper presents a simple and efficient method for instruction scheduling within basic blocks. An implementation prowed to be extremely small while producing results comparable to other more complicated techniques. The algorithm is of quadratic complexity in the number of instructions but a linear run-time is achieved in practice. Because no (code) look-ahead is needed, the algorithm is even suitable for one-pass compilers.