Theoretical Performance Bounds and Parallelization of a Two-Dimensional Packing Algorithm


The KIPS Transactions:PartA, Vol. 10, No. 1, pp. 43-48, Mar. 2003
10.3745/KIPSTA.2003.10.1.43,   PDF Download:

Abstract

Two-dimensional packing algorithm can be used for allocating submeshes in mesh multiprocessor systems. Previously, we developed an efficient packing algorithm called TP heuristic, and showed how the results of the packing could be used for allocating submeshes. In this paper, we present theoretical performance bounds for TP heuristic. We also present a parallel version of the algorithm that consumes reduced time when it is executed by multiple processors in mesh multiprocessors.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
I. J. Hwang and D. K. Hong, "Theoretical Performance Bounds and Parallelization of a Two-Dimensional Packing Algorithm," The KIPS Transactions:PartA, vol. 10, no. 1, pp. 43-48, 2003. DOI: 10.3745/KIPSTA.2003.10.1.43.

[ACM Style]
In Jae Hwang and Dong Kweon Hong. 2003. Theoretical Performance Bounds and Parallelization of a Two-Dimensional Packing Algorithm. The KIPS Transactions:PartA, 10, 1, (2003), 43-48. DOI: 10.3745/KIPSTA.2003.10.1.43.