𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Performance of parallel computations with dynamic processor allocation

✍ Scribed by Saeed Iqbal; Graham F. Carey

Book ID
106046128
Publisher
Springer
Year
2007
Tongue
English
Weight
440 KB
Volume
24
Category
Article
ISSN
0177-0667

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Processor Allocation Using Partitioning
Processor Allocation Using Partitioning in Mesh Connected Parallel Computers
✍ Prasant Mohapatra πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 326 KB

Several processor allocation schemes for mesh connected parallel computers have been proposed in the literature. These schemes aim at improving system performance by reducing internal fragmentation or by enhancing submesh recognition ability. In this paper, we propose a system partitioning approach

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

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