Preconditioning  Krylov Subspace Methods are commonly used for solving linear system  Standard implementations are communication-bound due to required SpMV and orthogonalization in every iteration  Solution: rearrange algorithms to perform s iterations at a time without communicating (s-step methods)  SpMV in each iteration is replaced with a call to the Matrix Powers Kernel, which performs...

This paper presents an algorithm to compute an optimal (s, S) policy under standard assumptions (stationary data, well-behaved one-period costs, discrete demand, full backlogging, and the average-cost criterion). The method is iterative, starting with an arbitrary, given (s, S) policy and converging to an optimal policy in a finite number of iterations. Any of the available approximations can t...