<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05479738</id>
  <dt>j</dt>
  <an>05479738</an>
  <augroup>
    <au>Brekhov, O.M.</au>
    <au>Moraru, V.A.</au>
  </augroup>
  <ti>Analytical modeling of dataflow computers.</ti>
  <so>Autom. Remote Control 54, No. 11, 1868-1879 (1993).</so>
  <py>1993</py>
  <pu>MAIK Nauka/Interperiodica Publishing, Moscow; Springer, New York, NY</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
    <cc>F.1.1</cc>
  </ccgroup>
  <utgroup>
    <ut>two-stage dataflow computer</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: A probabilistic model of a two-stage dataflow computer is proposed, and a recurrent procedure is suggested for determining the stationary probabilities for the modeled system to be in one or another state. The performance of the system under consideration is estimated for various processor loads. A model of a multiprocessor computer with a look-ahead fetch of instructions was developed with the aim of comparing the performances of dataflow and traditional computers. The results obtained enabled us to determine the dataflow computer performance as a function of the parameters of task, memory, processors, and switching network, and to identify the classes of tasks where the dataflow computer has an edge in performance.</ab>
    <rv></rv>
  </abgroup>
</item>