The paper presents results of an approximation study of cyclic queueing phenomena that occur in multiprogrammed computer systems. Based on Wald's Identity and using ideas of diffusion, the objective is to develop convenient and nearly explicit formulas relating processor use in such systems to simple program parameters and the level of multiprogramming. Some numerical results to indicate the quality of the proposed approximation are given. (Author)