skip to main content
article
Free Access

Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing

Published:01 December 1981Publication History
Skip Abstract Section

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.

References

  1. 1 Processor Handbook, Floating Point Systems, Inc., Publication No. FPS-860-7259-003, Feb. 1979.Google ScholarGoogle Scholar
  2. 2 CDC Advanced Flexible Processor Microcode Cross Assembler (MICA) Reference Manual, Control Data Corp., Publication No. 77900500, Apr. 1980.Google ScholarGoogle Scholar
  3. 3 A. V. Aho and J. D. Ullman, Principles of Compiler Design, Addison Wesley, New York, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 M. S. Hecht, Flow Analysis of Computer Programs, Elsevier, New York, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 W. B. Ackerman, "Data flow languages", Proc. National Computer Conference 1979, AFIPS Press, pp. 1087-1095, 1979.Google ScholarGoogle Scholar
  6. 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 ScholarGoogle Scholar
  7. 7 J. R. McGraw, "Data flow computing - software development", IEEE Trans. on Computing, Vol. C-29, No. 12, pp. 1095-1103, Dec. 1980.Google ScholarGoogle Scholar
  8. 8 J. R. Coffman (ed.), Computer and Job-Shop Scheduling Theory, John Wiley, New York, 1976.Google ScholarGoogle Scholar
  9. 9 K. R. Baker, Introduction to Sequencing and Scheduling, John Wiley, New York, 1974.Google ScholarGoogle Scholar
  10. 10 T. C. Hu, "Parallel sequencing and assembly line problems", Operations Research, Vol. 9, No. 6, pp. 841-848, 1961.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 D. Landskov, S. Davidson and B. Shriver, "Local microcode compaction tecniques", Computing Surveys, Vol. 12, No. 3, pp. 261-294, Sep. 1980. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle Scholar
  17. 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 ScholarGoogle Scholar
  18. 18 M. J. Gonzalez, "Deterministic processor scheduling", Computing Surveys, Vol. 9, No. 3, pp. 173-204, Sep. 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 E. J. McCluskey, Theory and Design of Switching Circuits, McGraw-Hill, New York, 1965.Google ScholarGoogle Scholar
  21. 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 ScholarGoogle Scholar
  22. 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 ScholarGoogle Scholar
  23. 23 T. Agerwala, "Microprogram optimization: a survey", IEEE Trans. on Computers, Vol. C-25, No. 10, pp. 962-973, Oct. 1976.Google ScholarGoogle Scholar
  24. 24 J. H. Patel, "Processor-memory interconnections for multiprocessors", Proc. 6th Annual Symposium on Computer Architecture, pp. 168-177, April 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM SIGMICRO Newsletter
            ACM SIGMICRO Newsletter  Volume 12, Issue 4
            Dec. 1981
            187 pages
            ISSN:1050-916X
            DOI:10.1145/1014192
            Issue’s Table of Contents
            • cover image ACM Conferences
              MICRO 14: Proceedings of the 14th annual workshop on Microprogramming
              December 1981
              214 pages

            Copyright © 1981 Authors

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 December 1981

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!