A Data Flow Implementation of a Competition-Based Connectionist Model

A recently proposed connectionist model of computation, the competition-based model, has been implemented using a data flow system on a parallel MIMD computer. The implementation is an interactive system in which the user supplies arbitrary networks for running simulations. Following a description of the system, theoretical estimates of and experimental results on the speedup achieved over a sequential implementation are presented. In particular, the importance of minimizing the fanout of nodes in connectionist models intended for parallel architectures is emphasized.