Dynamic processor allocation in large mesh-connected multicomputers
From MaRDI portal
Recommendations
- Efficient processor allocation strategies for mesh-connected parallel computers
- Contention-free 2D-mesh cluster allocation in hypercubes
- Using parallel program characteristics in dynamic processor allocation policies
- Efficient algorithms for dynamic allocation of distributed memory
- Comparison of Allocation Algorithms for Mesh Structured Networks with Using Multistage Simulation
Cited in
(9)- Efficient processor allocation strategies for mesh-connected parallel computers
- Performance improvement of allocation schemes for mesh-connected computers
- Comparing processor allocation strategies in multiprogrammed shared-memory multiprocessors
- Dynamic processor allocation in scalable multiprocessors using boolean algebra*
- Low overhead multiprocessor allocation strategies exploiting system spare capacity for fault detection and location
- A tool for binding threads to processors
- On task relocation in two-dimensional meshes
- Efficient processor management schemes for mesh-connected multicomputers
- A simulator for adaptive parallel applications
This page was built for publication: Dynamic processor allocation in large mesh-connected multicomputers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796140)