Abstract
Horizontal architectures are attractive for cost-effective, high performance scientific computing. They are, however, very difficult to schedule. Consequently, it is difficult to develop compilers that can generate efficient code for such architectures. The polycyclic architecture has been developed specifically to make the task of scheduling easy. As a result, it has been possible to develop a powerful scheduling algorithm that yields optimal and near-optimal schedules for iterative computations. This novel architecture and this scheduling algorithm are the topic of this paper.
- 1 Processor Handbook, Floating Point Systems, Inc., Publication No. FPS-860-7259-003, Feb. 1979.Google Scholar
- 2 CDC Advanced Flexible Processor Microcode Cross Assembler (MICA) Reference Manual, Control Data Corp., Publication No. 77900500, Apr. 1980.Google Scholar
- 3 A. V. Aho and J. D. Ullman, Principles of Compiler Design, Addison Wesley, New York, 1977. Google Scholar
Digital Library
- 4 M. S. Hecht, Flow Analysis of Computer Programs, Elsevier, New York, 1977. Google Scholar
Digital Library
- 5 W. B. Ackerman, "Data flow languages", Proc. National Computer Conference 1979, AFIPS Press, pp. 1087-1095, 1979.Google Scholar
- 6 Arvind, K. P. Gostelow and W. Plouffe, "An asynchronous programming language and computing machine", Dept. of Information and Computer Science Tech. Rep. No. 114A, Univ. of California, Irvine, 1978.Google Scholar
- 7 J. R. McGraw, "Data flow computing - software development", IEEE Trans. on Computing, Vol. C-29, No. 12, pp. 1095-1103, Dec. 1980.Google Scholar
- 8 J. R. Coffman (ed.), Computer and Job-Shop Scheduling Theory, John Wiley, New York, 1976.Google Scholar
- 9 K. R. Baker, Introduction to Sequencing and Scheduling, John Wiley, New York, 1974.Google Scholar
- 10 T. C. Hu, "Parallel sequencing and assembly line problems", Operations Research, Vol. 9, No. 6, pp. 841-848, 1961.Google Scholar
Digital Library
- 11 M. Tokoro, E. Tamura, K. Takase and K. Tamura, "An approach to microprogram optimization considering resource occupancy and instruction formats", Proc. 10th Annual Workshop on Microprogramming, pp. 92-108, Oct. 1977. Google Scholar
Digital Library
- 12 M. Tokoro, T. Takizuka, E. Tamura and I. Yamaura, "A technique of global optimization of microprograms", Proc. 11th Annual Workshop on Microprogramming, pp. 41-50, 1978. Google Scholar
Digital Library
- 13 D. Landskov, S. Davidson and B. Shriver, "Local microcode compaction tecniques", Computing Surveys, Vol. 12, No. 3, pp. 261-294, Sep. 1980. Google Scholar
Digital Library
- 14 T. L. Adam, K. M. Chandy and J. R. Dickson, "A comparison of list schedules for parallel processing systems", Communications of the ACM, Vol. 17, No. 12, pp. 685-690, 1974. Google Scholar
Digital Library
- 15 E. G. Coffman and R. L. Graham, "Optimal scheduling for two processor systems", Acta Informatica, Vol. 1, No. 3, pp. 200-213, 1972.Google Scholar
Digital Library
- 16 W. H. Kohler "A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems", IEEE Trans. on Computers, Vol. C-24, No. 12, pp. 1235-1238, Dec. 1975.Google Scholar
- 17 C. v. Ramamoorthy, K. M. Chandy and M. J. Gonzalez, "Optimal scheduling strategies in a multiprocessor system", IEEE Trans. on Computers, Vol. C-21, No. 2, pp. 137-146, Feb. 1972.Google Scholar
- 18 M. J. Gonzalez, "Deterministic processor scheduling", Computing Surveys, Vol. 9, No. 3, pp. 173-204, Sep. 1977. Google Scholar
Digital Library
- 19 J. H. Patel and E. S. Davidson, "Improving the throughput of a pipeline by insertion of delays", Proc. 3rd Annual Symposium on Computer Architecture, pp. 159-164, Jan. 1976. Google Scholar
Digital Library
- 20 E. J. McCluskey, Theory and Design of Switching Circuits, McGraw-Hill, New York, 1965.Google Scholar
- 21 S. R. Das, D. K. Banerji and A. Chattopadhyay, "On control memory minimization in microprogrammed computers", IEEE Trans. on Computers, Vol. C-23, No. 9, pp 845-848, Sep. 1973.Google Scholar
- 22 T. Jayasri and T. Basu, "An approach to organizing microinstructions which minimizes the width of control storage words", IEEE Trans. on Computers, Vol. C-25, No. 5, pp. 514-521, May 1976.Google Scholar
- 23 T. Agerwala, "Microprogram optimization: a survey", IEEE Trans. on Computers, Vol. C-25, No. 10, pp. 962-973, Oct. 1976.Google Scholar
- 24 J. H. Patel, "Processor-memory interconnections for multiprocessors", Proc. 6th Annual Symposium on Computer Architecture, pp. 168-177, April 1979. Google Scholar
Digital Library
Index Terms
Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing
Recommendations
Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing
MICRO 14: Proceedings of the 14th annual workshop on MicroprogrammingHorizontal architectures are attractive for cost-effective, high performance scientific computing. They are, however, very difficult to schedule. Consequently, it is difficult to develop compilers that can generate efficient code for such architectures. ...
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 ...
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74: Proceedings of the 7th conference on Winter simulation - Volume 2The schedule-constrained job scheduling problem is defined as the problem of deciding what jobs should co-exist in the memory of a multiprogrammed computer to insure satisfactory schedule performance and adequate resource utilization. At the present ...






Comments