Non-contiguous processor allocation algorithms for distributed memory multicomputers
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Efficient job scheduling in a mesh multicomputer without discrimination against large jobs
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
Job Scheduling in Mesh Multicomputers
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers
IEEE Transactions on Computers
Comparison of SBA – family task allocation algorithms for mesh structured networks
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Static and dynamic allocation algorithms in mesh structured networks
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Simulation-based evaluation of distributed mesh allocation algorithms
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 0.00 |
The performance of a multicomputer system depends on the processor management strategy. Processor management deals with processor allocation and job scheduling. Most of the processor allocation and job scheduling schemes proposed in the literature incur high implementation complexity and are therefore impractical to be integrated. In this paper, we propose an integrated processor management scheme that includes a bypass-queue scheduling policy and a fixed-orientation allocation algorithm. Both policies have very low complexities and are hence suitable to be integrated. Both policies improve the system performance considerably when applied in isolation. The integrated scheme provides even better performance.