✦ LIBER ✦

New bounds on time and number of processors for multiprocessor optimal schedules

✍ Scribed by Hao Sun; Pu Liu; Jikai Li; Dechung Peng

Publisher: Wuhan University
Year: 1996
Tongue: English
Weight: 363 KB
Volume: 1
Category: Article
ISSN: 1007-1202
DOI: 10.1007/bf02900854

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Branch and bound methods for scheduling

Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors

✍ Andreas Krämer 📂 Article 📅 1997 🏛 Springer 🌐 German ⚖ 930 KB

ILP Formulations for Scheduling Ordered

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors

✍ Manoel Campêlo; Ricardo Corrêa; Nelson Maculan; Fébio Protti 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Bounding the Number of Processors and Ch

Bounding the Number of Processors and Checkpoints Needed in Time-minimal Parallel Reversal Schedules

✍ A. Walther 📂 Article 📅 2003 🏛 Springer Vienna 🌐 English ⚖ 388 KB

Upper bound on the number of processors

Upper bound on the number of processors for scheduling with interprocessor communication delays

✍ Aziz Moukrim 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 185 KB

Improved Lower Bounds on Time and Proces

Improved Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems

✍ K.K. Jain; V. Rajaraman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 577 KB

Optimal Compile-Time Multiprocessor Sche

Optimal Compile-Time Multiprocessor Scheduling Based on the O–1 Linear Programming Algorithm with the Branch and Bound Technique

✍ D.Antony Louis Piriyakumar; C.Siva Ram Murthy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 238 KB

This paper is organized as follows. We describe the formulation of the problem and the required definitions in Section II. In Section III, the performance improvement over [6] due to processor isomorphism and look ahead pruning in reducing the search space is explained, along with a note on the lowe