The Optimal Organization of Serial Memory Transfers

Abstract

This paper is concerned with the optimal compilation of programs whose function is to transfer words of information from one location in a serial memory to another. The most important optimization tool is the ``timing schedule,'' which facilitates the analysis of various transfer schemes and the determination of the fastest one. The procedure described for optimizing serial transfers is readily programmable for computer execution, and is directly applicable to a general class of transportation problems.