In the 2007 Sidney Fernbach Award lecture, I argued for going fully implicit in time-dependent simulations in which the stability restriction for explicit methods is more stringent than is required for accuracy in resolving the phenomena of interest. These include multirate problems with good scale separation, coupled multiphysics problems, and “outer loop” problems in design, control, inversion, and assimilation. The basis for the argument was that scalable and effective algorithms are known and available in open-source software that harvest much legacy code in “call-back” form and thus offer a reasonable learning curve. While none of this has disappeared, much new has appeared that forces consideration of additional algorithmic and software infrastructure in bridging the widening gap between ambitious applications and austere architectures. We comment on the evolution of this infrastructure and attempt to integrate approaches described in the workshop under a bigger tent.