VLSI implementation of a variable-length pipeline scheme for data-driven processors

A VLSI-oriented variable-length pipeline structure for data-driven processors is presented. Ordinary inline pipelines have the problem of minimizing the average total processing time through the pipeline, since subdivision of a function along the pipeline is usually optimized for the most complex operations in spite of the fact that simpler operations need fewer stages. As a solution to this problem, a variable-length pipeline scheme in which data go through only the necessary stages according to information contained within is proposed. The scheme has been implemented on a test chip to verify performance. The chip demonstrated a minimum fall-through time (data transmission time from input to output) of 14.4 ns and a data transmission rate in the pipeline of 59 megaword/s (that is, 1/16.9 ns) as a first-in first-out (FIFO) store. By modifying the data transfer control and allocating the processing functions corresponding to the data interval of 16.9 ns, this scheme is applicable as a high-performance processing unit for data-driven processors. >

[1]  T. Tamura,et al.  VLSI implementation of the variable length pipeline scheme for data-driven processors , 1988, Symposium 1988 on VLSI Circuits.

[2]  T. Temma,et al.  A VLSI image pipeline processor , 1984, 1984 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[3]  Toshiyuki Tamura,et al.  An elastic pipeline mechanism by self-timed circuits , 1988 .

[4]  Satoshi Matsumoto,et al.  VLSI design of a one-chip data-driven processor: Q-v1 , 1987, FJCC.

[5]  Hiroki Miura,et al.  Hardware Structure of a One-Chip Data Driven Processor: Q-p , 1987, ICPP.