Register binding for predicated execution in DSP applications

Conference Paper · February 2000with3 Reads
DOI: 10.1109/SBCCI.2000.876017 · Source: IEEE Xplore
Conference: Integrated Circuits and Systems Design, 2000. Proceedings. 13th Symposium on

    Abstract

    Predicated execution is an efficient mechanism to avoid
    conditional constructs in application programs. In this paper we
    describe how an existing method for register binding can be extended to
    support predicated execution. The method exploits the combination of
    register constraints, resource and timing constraints and models the
    overlap of value lifetimes in a conflict graph. In our extension,
    mutually exclusive values are identified and are used for reconstructing
    the conflict graph. Register binding for predicated execution in case of
    software pipelining is also addressed in this paper. Experiments in the
    Facts environment show that the register pressure is greatly reduced
    with this technique