✦ LIBER ✦

Scheduling task graphs optimally with A*

✍ Scribed by Ahmed Zaki Semar Shahul; Oliver Sinnen

Book ID: 106539544
Publisher: Springer US
Year: 2010
Tongue: English
Weight: 818 KB
Volume: 51
Category: Article
ISSN: 0920-8542
DOI: 10.1007/s11227-010-0395-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling loosely connected task graphs

✍ Abhiram G. Ranade 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We present a polynomial time algorithm for precedence-constrained scheduling problems in which the task graph can be partitioned into large disjoint parts by removing edges with high float, where the float of an edge is defined as the difference between the length of the longest path in the graph an

Optimal parallel scheduling for the 2-st

Optimal parallel scheduling for the 2-steps graph with constant task cost

✍ Mounir Marrakchi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Optimal Scheduling for UET/UET-UCT Gener

Optimal Scheduling for UET/UET-UCT Generalizedn-Dimensional Grid Task Graphs

✍ Theodore Andronikos; Nectarios Koziris; George Papakonstantinou; Panayiotis Tsan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 535 KB

A Novel SAT-Based Approach to the Task G

A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem

✍ Nocco, S.; Quer, S. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 1015 KB

Optimal scheduling of progressive proces

Optimal scheduling of progressive processing tasks

✍ Shlomo Zilberstein; Abdel-Illah Mouaddib 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Dynamic task-level voltage scheduling op

Dynamic task-level voltage scheduling optimizations

✍ Barnett, J.A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 534 KB