✦ LIBER ✦

Finding a Feasible Schedule on a Tree-Connected Processor System

✍ Scribed by Tsuyoshi Kawaguchi; Seiki Kyan; Kenji Onaga

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving tree problems on a mesh-connecte

✍ Mikhail J. Atallah; Susanne E. Hambrusch 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 963 KB

Lagrange Interpolation on a Processor Tr

✍ B. Goertzel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Scheduling independent two processor tas

✍ J. Błaz̀ewicz; M. Drozdowski; G. Schmidt; D. De Werra 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 606 KB

A note on optimal scheduling for two-pro

✍ Andrzej Rowicki 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 561 KB

A note on optimal preemptive scheduling

✍ Andrzej Rowicki 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 522 KB

Scheduling independent multiprocessor ta

✍ J Błałewicz; M Drozdowski; G Schmidt; D de Werra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 707 KB