Now showing items 376-378 of 486

    • Efficient Scheduling of Tasks Without Full Use of Processor Resources 

      Jaffe, Jeffrey (1979-01)
      The nonpreemptive scheduling of a partially ordered set of tasks on a machine with m processors of different speeds is studied. Heuristics are presented which benefit from selective non-use of slow processors. The performance ...
    • The Equivalence of R. E. Programs and Data Flow Schemes 

      Jaffe, Jeffrey (1979-01)
      The Expressibe power of the data flow schemes of Dennis is evaluated. It is shown that data flow schemes have the power to express an arbitrary determinate functional. The proof involves a demonstration that "restricted ...
    • Operational Semantics of a Data Flow Language 

      Brock, Jarvis D. (1978-12)
      A data flow machine achieves high performance by the concurrent execution of machine code consisting of data flow graphs which explicitly represent the data dependencies among program instructions. This thesis presents the ...