Modulo scheduling is a framework within which a wide variety of algorithms and heuristics may be defined for software pipelining innermost loops. This paper presents a practical algorithm, iterative modulo scheduling, that is capable of dealing with realistic machine models. This paper also characterizes the algorithm in terms of the quality of the generated schedules as well the computational expense incurred.

crucial with the advent of high speed networks. This paper addresses the problem of determining minimum cost paths to nodes in a Multicast group satisfying delay bounds and delay variation bounds. A routing protocol is proposed and compared with previous schemes like DVMA (Delay Variation Bounded Multicast Algorithm). The results show that the scheme proposed improves over the DVMA in the variation bounds achieved and is comparatively far more eWcient. I.