✦ LIBER ✦

Scheduling PVM tasks

✍ Scribed by Jiubin Ju; Yong Wang; Yu Yin

Publisher: Springer
Year: 1997
Tongue: English
Weight: 622 KB
Volume: 12
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02951336

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling coupled tasks

✍ Roy D. Shapiro 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

Assigning task by parallel genetic algor

Assigning task by parallel genetic algorithm based on PVM

✍ Zheng Zhi-jun; Dong Xiao-she; Zheng Shou-qi 📂 Article 📅 2001 🏛 Wuhan University 🌐 English ⚖ 530 KB

List scheduling of parallel tasks

✍ Qingzhou Wang; Kam Hoi Cheng 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 940 KB

Deadline scheduling of multiprocessor ta

Deadline scheduling of multiprocessor tasks

✍ J. Blazewicz; M. Drozdowski; D. de Werra; J. Weglarz 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 815 KB

LPT scheduling for fuzzy tasks

✍ Tzung-Pei Hong; Cheng-Ming Huang; Kun-Ming Yu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Scheduling mainly concerns allocating resources to tasks over time, under necessary constraints. In the past, the processing time for each task was usually assigned or estimated as a fixed value. In many real-world applications, however, the processing time for each job may vary dynamically with the

General multiprocessor task scheduling

✍ Jianer Chen; Chung-Yee Lee 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocat