A Submesh Allocation Scheme Based on Classification of Tasks and Submeshes


The KIPS Transactions:PartA, Vol. 10, No. 6, pp. 643-650, Dec. 2003
10.3745/KIPSTA.2003.10.6.643,   PDF Download:

Abstract

This paper presents a new submesh allocation scheme for mesh-connected multicomputer systems. The key idea in the proposed allocation scheme is to reduce the submesh search time using classified free submesh lists (CFSL). This scheme reduces the submesh search time by classifying independent free submeshes according to their types (square, horizontal rectangle, vertical rectangle) and searching the best-fit submesh from the classified free submesh list. When no suitable submesh is found, the search can be continued by using the expansion index (EI), which is stored as an attribute of each submesh, is used to form a larger submesh. Through simulation, we show that the proposed strategy improves the performance compared to previous strategies with respect to submesh search time.


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]
L. W. Ju and J. C. Ho, "A Submesh Allocation Scheme Based on Classification of Tasks and Submeshes," The KIPS Transactions:PartA, vol. 10, no. 6, pp. 643-650, 2003. DOI: 10.3745/KIPSTA.2003.10.6.643.

[ACM Style]
Lee Won Ju and Jeon Chang Ho. 2003. A Submesh Allocation Scheme Based on Classification of Tasks and Submeshes. The KIPS Transactions:PartA, 10, 6, (2003), 643-650. DOI: 10.3745/KIPSTA.2003.10.6.643.