This paper describes a technique for obtaining maximumthroughput schedules for iterative data-flow graphs, given a limited set of resources. The method is based on the use of the scheduling-range chart, where the scheduling window of each operation is displayed. This scheduling window, or scheduling range, is relative to a reference operation, and can be finite or infinite. The information in t...