LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 208-210 of 486

    • Retiming Synchronous Circuitry 

      Leiserson, Charles E.; Saxe, James B. (1986-05)
      This paper shows how the technique of retiming can be used to transform a given sycnhronous circuit into a more efficient circuit under a variety of different cost criteria. We model a circuit as a graph, and we give an ...

    • Floyd-Hoare Logic Defines Semantics 

      Meyer, Albert R. (1986-05)
      The first-order patrial correctness assertions provable in Floyd-Hoare logic about an uninterpreted while-program scheme determine the scheme up to equivalence. This settles an open problem of Meyer and Halpern. The simple ...

    • Randomized Routing on Fat-trees 

      Greenberg, Ronald I.; Leiserson, Charles E. (1986-05)
      Fat-trees are a class of routing networks for hardware-efficient paralle computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the ...