PIPELINED EXECUTION IN MULTI-USER SEQUENTIAL RECURSIVE LOOPS

Abstract

Recursive sections in a data path are constraints to the minimum value of data introduction latency (R) in that data path. Minimizing loop execution times is a way to increase the virtual data introduction frequency (1/ R), with the minimum values set by the loops themselves. For a number of applications, another method is possible to decrease the restart time while actually increasing the total execution time of the loop (Lr). An advantage of this method is that the increase of execution time is an external constraint. This paper presents a description of such problems, with the steps of scheduling performed for an application of this type.