In this paper we study the efficiency of Strong Stability Preserving (SSP) Runge–Kutta methods that can be implemented with a low number registers using their Shu–Osher representation. SSP have been studied in literature and stepsize restrictions ensure numerical monotonicity found. However, for some problems, observed are larger than theoretical ones. Aiming at obtaining additional properties ...