A VLIW architecture for a trace scheduling compiler

  • Authors:

  • Robert P. Colwell;Robert P. Nix;John J. O'Donnell;David B. Papworth;Paul K. Rodman

  • Affiliations:

  • Multiflow Computer, Branford, CT;Multiflow Computer, Branford, CT;Multiflow Computer, Branford, CT;Multiflow Computer, Branford, CT;Multiflow Computer, Branford, CT

  • Venue:
  • ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
  • Year:
  • 1987

Quantified Score

Hi-index 0.01

Visualization

Abstract

Very Long Instruction Word (VLIW) architectures were promised to deliver far more than the factor of two or three that current architectures achieve from overlapped execution. Using a new type of compiler which compacts ordinary sequential code into long instruction words, a VLIW machine was expected to provide from ten to thirty times the performance of a more conventional machine built of the same implementation technology.Multiflow Computer, Inc., has now built a VLIW called the TRACETM along with its companion Trace SchedulingTM compacting compiler. This new machine has fulfilled the performance promises that were made. Using many fast functional units in parallel, this machine extends some of the basic Reduced-Instruction-Set precepts: the architecture is load/store, the microarchitecture is exposed to the compiler, there is no microcode, and there is almost no hardware devoted to synchronization, arbitration, or interlocking of any kind (the compiler has sole responsibility for runtime resource usage).This paper discusses the design of this machine and presents some initial performance results.