An Efficient Processor Allocation Algorithm Using Two-dimensional Packing

Authors:
Injae Hwang
Affiliations:
-
Venue:
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Year:
1997

Citing 3
Cited 0

Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
Subcube Allocation and Task Migration in Hypercube Multiprocessors

IEEE Transactions on Computers
A two-dimensional adaptive mesh generation method

Journal of Computational Physics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mesh is one of the most widely used interconnection networks for multiprocessor systems. In this paper, we propose an approach to partition a given mesh into m submeshes which can be allocated to m tasks with grid structures. We adapt two-dimensional packing to solve the submesh allocation problem. Due to the intractability of the two-dimensional packing problem, finding an optimal solution is computationally infeasible. We develop an efficient heuristic packing algorithm called TP-heuristic. Allocating a submesh to each task is achieved using the results of packing. We propose two different methods called uniform scaling and non-uniform scaling. Experiments were carried out to test the accuracy of solutions provided by our allocation algorithm.