Abstract
One of the key issues in the efficient use of pipelines is the problem of pipeline scheduling. An overview of the research in pipeline scheduling is presented. The scheduling problem for multifunction, dynamically reconfigurable pipelines is studied from the point of view of retargetable microcode compilation. A modified greedy strategy using the criterion of the earliest completion time tc is presented with an example.
- {AF87} A. Aliphas and J. A. Feldman. The versatility of digital signal processing chips. In IEEE Spectrum, pages 40--45, June 1987. Google Scholar
Digital Library
- {Amd85} Am29500 Application Note. Advanced Micro Devices, Santa Clara, CA, 1985.Google Scholar
- {BSKT79} U. Banarjee, S. Shen, D. J. Kuck, and R. A Towle. Time and parallel processor bounds for fortran-like loops. In IEEE Transactions on Computers, pages 660--670, Sep. 1979.Google Scholar
Digital Library
- {Dav74} E. S. Davidson, Scheduling for pipelined processors. In Proc. 7th International Conference on Systems Sciences, pages 58--60, 1974.Google Scholar
- {DTSP75} E. S. Davidson, A. T. Thomas, L. E. Shar, and J. H. Patel. Effective control for pipelined computers. In Proceedings of COMPCON Conference, pages 181--184, 1975.Google Scholar
- {Gro83} T. Gross. Code Optimization of Pipeline Constraints. Technical Report, Computer Systems Laboratory, Stanford University, Dec. 1983. Technical Report No. 83--255.Google Scholar
Digital Library
- {HB84} K. Hwang and K. Briggs. Computer Architecture and Parallel Processing. McGraw-Hill, 1984. Google Scholar
Digital Library
- {HD86} P. Y. T. Hsu and E. S. Davidson. Highly concurrent scalar processing. In Proc. 13th Annual International Symposium on Computer Architecture, pages 386--395, 1986. Google Scholar
Digital Library
- {JMKN86} H. V. Jagadish, R. B. Mathews, T. Kailath, and J. A. Newkirk. A study of pipelining in computing arrays. IEEE Transactions on Computers, 431--439, May 1986. Google Scholar
Digital Library
- {Kog81} P. M. Kogge. The Architecture of Pipelined Computers. McGraw-Hill Co., 1981. Google Scholar
Digital Library
- {KSA74} A. K. Kamal, H. Singh, and D. P. Agrawal. A generalized pipeline array. In IEEE Transactions on Computers, pages 533--536, May 1974.Google Scholar
- {LS84} J. K. F. Lee and A. J. Smith. Branch prediction strategies and branch target buffer design. Computer, 6--22, Jan. 1984.Google Scholar
- {MC84} W. H. McAllister and J. R. Carlson. Floating-point chip set speeds real-time computer operation. Hewlett-Packard Journal, 17--23, 1984.Google Scholar
- {MDSW86} R.A. Mueller, M.R. Duda, P.H. Sweany, and J.S. Walicki. Horizon: A Retargetable Compiler for Horizontal Micro-Architectures. IEEE Transactions on Software Engineering (Special Issue on Firmware Engineering), 1986. Submitted for publication. Google Scholar
Digital Library
- {MH86} S. McFarling and J. Heneasy. Reducing the cost of branches. In Proc. 13th ISCA, pages 396--403, June 1986. Google Scholar
Digital Library
- {MSDP86} R.A. Mueller, B. Su, M.R. Duda, and B. Plomondon. A Case Study in Signal Processing Microprogramming with the URPR Software Pipelining Technique. In Proceedings of the 19th Microprogramming Workshop (MICRO-19), New York, NY, October 1986. Google Scholar
Digital Library
- {Plo87} B. L. Plomondon. Targeting the Horizon Compiler to a Signal Processor: a Case Study. Master's thesis, Computer Science Department, Colorado State University, Spring 1987.Google Scholar
- {RG81} B. R. Rau and C. D. Glaeser. Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing. In Proc. 14th Annual Workshop on Microprogramming, pages 183--198, 1981. Google Scholar
Digital Library
- {RL75} C. V. Ramamoorthy and H. F. Li. Some problems in parallel and pipeline processing. In Proc. COMPCON, pages 177--180, 1975.Google Scholar
- {Sol87} D. Soltis. Branch handling algorithms for pipelined RISC processors. 1987. Termpaper in the Parallel Processing Course, Spring '87, CS-CSU.Google Scholar
- {Tap84} J. Tappe. The minimal average latency of multiconfigurable pipelines. Parallel Computing, 181--183, 1984. North-Holland, 0167--8191/84.Google Scholar
- {TD74} A. T. Thomas and E. S. Davidson. Scheduling of multiconfigurable pipelines. In Proc. 12th Allerton Conference on Circuits and Systems Theory, pages 658--669, 1974.Google Scholar
- {WR84} R. G. Wedig and M. A. Rose. The reduction of branch instruction execution overhead using structured control flow. In Proc. 11th ISCA, pages 119--125, June 1984. Google Scholar
Digital Library
Index Terms
Operation scheduling in reconfigurable, multifunction pipelines
Recommendations
Operation scheduling in reconfigurable, multifunction pipelines
MICRO 20: Proceedings of the 20th annual workshop on MicroprogrammingOne of the key issues in the efficient use of pipelines is the problem of pipeline scheduling. An overview of the research in pipeline scheduling is presented. The scheduling problem for multifunction, dynamically reconfigurable pipelines is studied ...
Scheduling Multiprocessor Tasks to Minimize Schedule Length
The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for ...
Improving schedule stability in single-machine rescheduling for new operation insertion
The problem studied here entails inserting a new operation into an existing predictive schedule (preschedule) on a (non-preemptive) single machine by rescheduling its operations, so that the resultant schedule is the most stable one among schedules with ...






Comments