𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distributed dynamic processor allocation for multicomputers

✍ Scribed by César A.F. De Rose; Hans-Ulrich Heiss; Barry Linnert

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
383 KB
Volume
33
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance of Adaptive Space Sharing Pr
Performance of Adaptive Space Sharing Processor Allocation Policies for Distributed-Memory Multicomputers
✍ Sivarama P. Dandamudi; Hai Yu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Several space sharing policies have been proposed for distributed-memory multicomputer systems. We consider adaptive space sharing policies, as these policies provide a better performance than fixed and static policies by taking system load and user requirements into account. In this paper we propos

Adaptive Distributed Dynamic Channel All
Adaptive Distributed Dynamic Channel Allocation for Wireless Networks
✍ Anurag Kahol; Sumit Khurana; Sandeep K.S. Gupta; Pradip K. Srimani 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Channel allocation schemes in a mobile computing (wireless) environment can be either static or dynamic. Static allocation offers negligible channel acquisition time and zero message complexity and works well at a low system load; the performance steadily decreases as system load increases since man

Efficient dynamic processor allocation f
Efficient dynamic processor allocation for k-ary n-cube massively parallel processors
✍ Huey-Ling Chen; Chung-Ta King 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

ln this paper, we study the problem of allocating processors to application tasks for massively parallel processors (MPPs). Tasks are assumed to arrive dynamically and request processors interconnected in specific topologies. We extend the free-list strategy previously proposed for hypercube systems

Processor Allocation in Multiprogrammed
Processor Allocation in Multiprogrammed Distributed-Memory Parallel Computer Systems
✍ Vijay K. Naik; Sanjeev K. Setia; Mark S. Squillante 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 451 KB

In this paper, we examine three general classes of space-sharing scheduling policies under a workload representative of large-scale scientific computing. These policies differ in the way processors are partitioned among the jobs as well as in the way jobs are prioritized for execution on the partiti