Efficient Mapping Scheme for Parallel Processing


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 4, pp. 766-780, Jul. 1996
10.3745/KIPSTE.1996.3.4.766,   PDF Download:

Abstract

This paper presents a mapping scheme for parallel processing using an accurate characterization of the communication overhead. A set of objective functions is formulated to evaluate the optimality of mapping a problem graph into a system graph into a system graph. One of them is especially suitable for real-time applecations of parallel processing. These objective functions are different from the conventional objective functions in that the edges in the system graph is employed. This facilitates a more accurate quantification of the communication overhead. An efficient mapping scheme has been developed for the objective functions, where two levels of assignment optimization procedures are employed:initial assignment and pairwise exchange. The mapping scheme has been tested using the hypercube as a system graph.


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]
K. S. Soo and J. M. Seog, "Efficient Mapping Scheme for Parallel Processing," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 4, pp. 766-780, 1996. DOI: 10.3745/KIPSTE.1996.3.4.766.

[ACM Style]
Kim Seog Soo and Jun Moon Seog. 1996. Efficient Mapping Scheme for Parallel Processing. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 4, (1996), 766-780. DOI: 10.3745/KIPSTE.1996.3.4.766.