LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 394-396 of 486

    • The Use of Queues in the Parallel Data Flow Evaluation of "If-Then-While" Programs 

      Jaffe, Jeffrey (1978-05)
      A property of a model of parallel computation is analyzed. We show that the use of queues may speed-up the execution of well formed data flow schemas by an arbitrarily large factor. A general model of data flow computation ...

    • Arithemtical Completeness in Logics of Programs 

      Harel, David (1978-04)
      We consider the problem of designing arithmetically complete axiom systems for proving general properties of programs; 1.e. axiom systems which are complete over arithmetical universes, when all first-order formulae which ...

    • Lower Bounds on Information Transfer in Distributed Computations 

      Abelson, Harold (1978-04)
      We derive a lower bound on the interprocessor information transfer required for computing a function in a distributed network. The bound is expressed in terms of the function's derivatives, and we use it to exhibit functions ...