Space-time scheduling of instruction-level parallelism on a raw machine

  • Authors:
  • Walter Lee;Rajeev Barua;Matthew Frank;Devabhaktuni Srikrishna;Jonathan Babb;Vivek Sarkar;Saman Amarasinghe

  • Affiliations:
  • M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science;M.I.T. Laboratory for Computer Science

  • Venue:
  • Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Increasing demand for both greater parallelism and faster clocks dictate that future generation architectures will need to decentralize their resources and eliminate primitives that require single cycle global communication. A Raw microprocessor distributes all of its resources, including instruction streams, register files, memory ports, and ALUs, over a pipelined two-dimensional mesh interconnect, and exposes them fully to the compiler. Because communication in Raw machines is distributed, compiling for instruction-level parallelism (ILP) requires both spatial instruction partitioning as well as traditional temporal instruction scheduling. In addition, the compiler must explicitly manage all communication through the interconnect, including the global synchronization required at branch points. This paper describes RAWCC, the compiler we have developed for compiling general-purpose sequential programs to the distributed Raw architecture. We present performance results that demonstrate that although Raw machines provide no mechanisms for global communication the Raw compiler can schedule to achieve speedups that scale with the number of available functional units.