Interior-defined regions, flood-fill algorithms, and a simple 4-connected region filling algorithm are presented together with their properties. An algorithm for region filling using two-dimensional grammars is also presented together with illustrative examples. The results obtained in this article
An Efficient Processor Allocation Algorithm Using Two-Dimensional Packing
✍ Scribed by Injae Hwang
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 122 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
✦ Synopsis
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 twodimensional 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 nonuniform scaling. Experiments were carried out to test the accuracy of solutions provided by our allocation algorithm.
📜 SIMILAR VOLUMES
## Abstract A two‐point Dixon technique using a novel phase‐correction algorithm and commercially available dual‐echo fast gradient‐echo pulse sequence is presented. The phase‐correction algorithm determines the directional rather than phase distribution of signals due to field inhomogeneities. Spe