LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 361-363 of 486
-
Dynamic Algebras: Examples, Constructions, Application
(1979-07)Dynamic algebras combine the classes of Boolean (B V ' 0) and regular (R U ; *) algebras into a single finitely axiomatized variety (B R ♦) resembling an R-module with "scalar" multiplication ♦. The basis result is that * ... -
Algorithms for Scheduling Tasks on Unrelated Processors
(1979-06)Several algorithms are presented for the nonpreemptive assignment of n independent tasks to m unrelated processors. One algorithm requires polynomial time in n and m, and is at most 2√m times worse than optimal in the worst ... -
Report on the Second Workshop on Data Flow Computer and Program Organization
(1979-06)The following report comprises an edited transcript of presentations made at the Workshop of Data Flow Computer and Program Organization, held at MIT on July 9-13, 1978, and co-sponsored by the Lawrence Livermore Laboratory ...


