Evaluation of On-Chip Static Interconnection Networks
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Non-contiguous processor allocation algorithms for distributed memory multicomputers
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme
IEEE Transactions on Parallel and Distributed Systems
Lookahead Processor Allocation in Mesh-Connected Massively Parallel Multicomputer
Proceedings of the 8th International Symposium on Parallel Processing
An efficient processor allocation scheme for mesh connected parallel computers
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
An efficient task allocation scheme for two-dimensional mesh-connected systems
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
(R) A Flexible Processor Allocation Strategy for Mesh Connected Parallel Systems
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3
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
Limit Allocation: An Efficient Processor Management Scheme for Hypercubes
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
| Hi-index | 0.00 |
In general parallel computer systems, scheduling incoming jobs has been identified to be an important factor determining the overall performance, in addition to the allocation of processors to the scheduled jobs. The authors propose an efficient scheduling scheme for two-dimensional meshes. By employing the largest job first and scan-all policy along with the waiting time limit, the proposed scheme can alleviate the fragmentation problem. Contrary to the previous largest-job-first scheduling schemes, large jobs do not block small jobs in the scheme. As a result, the mean response time is significantly reduced as identified by comprehensive computer simulation.