Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme

Authors:
K. Li;K. H. Cheng
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1991

Citing 6
Cited 12

Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics

Management Science
Static job scheduling in partitionable mesh connected systems

Journal of Parallel and Distributed Computing
A two-dimensional buddy systems for dynamic resource allocation in a partitionable mesh connected system

Journal of Parallel and Distributed Computing
Buddy systems

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori

Fundamentals of Computer Alori

An Efficient Method for Approximating Submesh Reliability of Two-Dimensional Meshes

IEEE Transactions on Parallel and Distributed Systems
A new “quad-tree-based” sub-system allocation technique for mesh-connected parallel machines

ICS '99 Proceedings of the 13th international conference on Supercomputing
A parallel island model genetic algorithm for the multiprocessor scheduling problem

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
An efficient processor partitioning and thread mapping strategy for mesh-connected multiprocessor systems

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Impact of job mix on optimizations for space sharing schedulers

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
On Dependability Evaluation of Mesh-Connected Processors

IEEE Transactions on Computers
Effect of Job Size Characteristics on Job Scheduling Performance

IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A "Generalized k-Tree-Based Model to Sub-system Allocation" for Partitionable Multi-dimensional Mesh-Connected Architectures

ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Largest-job-first-scan-all scheduling policy for 2D mesh-connected systems

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems

Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
Multitoroidal Interconnects For Tightly Coupled Supercomputers

IEEE Transactions on Parallel and Distributed Systems
Scheduling independent jobs for torus connected networks with/without link contention

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The job scheduling problem in a partitionable mesh-connected system in which jobs require square meshes and the system is a square mesh whose size is a power of two is discussed. A heuristic algorithm of time complexity O(n(log n+log p)), in which n is the number of jobs to be scheduled and p is the size of the system is presented. The algorithm adopts the largest-job-first scheduling policy and uses a two-dimensional buddy system as the system partitioning scheme. It is shown that, in the worst case, the algorithm produces a schedule four times longer than an optimal schedule, and, on the average, schedules generated by the algorithm are twice as long as optimal schedules.