A pipeline bubbles reduction technique for the Monsoon dataflow architecture

Abstract

This paper proposes two typesof new auziliary ory. The first type of the auxiliary matching store achieves high matching rate b y combining the LRU replacement algorithm and a simple match structure together. The second one achieves high match rate b y controlling strictly the number of active processes with an explicit hardware. Owing to some special characteristics of dynamic dataflow computing, this temporary storage must be designed based on the following principles: (a The number of the active processes must be limited. A) The related instructions must be arranged nearby. (c) The replacement of the match slot must be deterministic. can be applied to dynama frame-stnrctured mem-