𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Divisible task scheduling – Concept and verification

✍ Scribed by Jacek Błażewicz; Maciej Drozdowski; Mariusz Markiewicz

Book ID
104304694
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
197 KB
Volume
25
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

In this work the idea of a divisible task is presented. The divisible task is a computation which can be divided with arbitrary granularity into independent parts solved in parallel by distributed computers. A simple model of a communication delay and a computation time is adopted, based on which various computer architectures and communication methods are analyzed. We review the ways of applying the divisible task concept in the case of a linear array, star, bus, hypercube, and mesh of processors. Then, the results of an empirical justi-®cation of the analysis are presented.

📜 SIMILAR VOLUMES

Task scheduling and moral hazard
Task scheduling and moral hazard
✍ Tymofiy Mylovanov; Patrick W. Schmitz 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 200 KB
General multiprocessor task scheduling
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

Task Scheduling in Networks
Task Scheduling in Networks
✍ Phillips, Cynthia; Stein, Clifford; Wein, Joel 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 380 KB