𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for finding ideal schedules

✍ Scribed by Edward G. Coffman; Dariusz Dereniowski; Wiesław Kubiak

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
368 KB
Volume
49
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient parallel algorithm for sche
An efficient parallel algorithm for scheduling interval ordered tasks
✍ Yoojin Chung; Kunsoo Park 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 187 KB

We present an efficient parallel algorithm for scheduling n unit length tasks on m identical processors when the precedence graphs are interval orders. Our algorithm requires Oðlog 2 v þ ðn log nÞ=vÞ time and Oðnv 2 þ n 2 Þ operations on the CREW PRAM, where v can be any number between 1 and n: By c