Browsing LCS Technical Memos (1974 - 2003) by Author "Arvind,"

Now showing items 1-4 of 4

    • Dataflow Architectures 

      Arvind; Culler, David E. (2/12/86)
      Dataflow graphs are described as a machine language for parallel machines. Static and dynamic dataflow architectures are presented as two implementations of the abstract dataflow model. Static dataflow allows at most one ...

    • Efficient Demand-Driven Evaluation (I) 

      Pingali, Keshav; Arvind (1983-09)
      We describe a program transformation technique for programs in a general stream language L whereby a data-driven evaluation of the transformed program performs exactly the same computation as a demand-driven evaluation of ...

    • Efficient Demand-Driven Evaluation (II) 

      Pingali, Keshav; Arvind (1983-09)
      In Part I of this paper, we presented a scheme whereby a compiler could propogate demands through programs in a powerful stream language L. A data-driven evaluation of the transformed program performed exactly the same ...

    • Two Fundamental Issues in Multiprocessing: The Dataflow Solution 

      Arvind; Iannucci, Robert A. (1985-08)
      To exploit the parallelism inherent in algorithms, any multiprocessor system must address two very basic issues - long memory latencies and waits for synchronization events. It is argued on the basis of the evolution of ...