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

  • Rau B
  • Glaeser C
  • 34

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • B. R. Rau

  • C. D. Glaeser

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free