A new code generation algorithm for 2-offset producer order queue computation model

  • Authors:
  • Arquimedes Canedo;Ben Abderazek;Masahiro Sowa

  • Affiliations:
  • Graduate School of Information Systems, The University of Electro-Communications, Chofugaoka 1-5-1, Chofu-shi, 182-8585, Tokyo, Japan;Graduate School of Information Systems, The University of Electro-Communications, Chofugaoka 1-5-1, Chofu-shi, 182-8585, Tokyo, Japan;Graduate School of Information Systems, The University of Electro-Communications, Chofugaoka 1-5-1, Chofu-shi, 182-8585, Tokyo, Japan

  • Venue:
  • Computer Languages, Systems and Structures
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Queue computing is an attractive alternative for the compulsive demand of high-performance architectures. Code generation for queue machines has some problems but the solutions have not been studied thoroughly. A new parallel queue computation model, 2-offset P-Code queue computation model, is presented together with a new code generation algorithm. The code generation algorithm takes leveled DAGs as input and produces 2-offset P-Code assembly. We also developed a queue compiler to evaluate the new algorithm and compiled a set of C language benchmark programs for the 2-offset P-Code. The queue compiler generates between 8.55% less instructions and 10.55% more instructions than an actual MIPS32 compiler for the compiled programs.