A Study on Generation of Parallel Task in High Perormance language


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 6, pp. 1636-1651, Jun. 1997
10.3745/KIPSTE.1997.4.6.1636,   PDF Download:

Abstract

In task parallel language like Fortran M, programmer writes a task parallel program using parallel constructs which is provided. When some data dependencies exist between called procedures in various applications, it is difficult for programmer to write program according to their dependencies. Therefore, it is desirous that compiler can detect some implicit parallelisms and transform a program to parallelized form by using the task parallel constructs like PROCESSES block or PROCESSDO loop of Fortran M. But current task parallel language compilers can''t provide these works. In this paper, we analyze the cases according to dependence relations and detect the implicit parallelism which can be transformed to task parallel constructs like PROCESSES block and PROCESSDO loop of Fortran M. Also, For the case which program can be paralleized both PROCESSES block and PROCESSDO loop, we analyze that which construct is more effective for various conditions.


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]
P. S. Soon and K. M. Soon, "A Study on Generation of Parallel Task in High Perormance language," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 6, pp. 1636-1651, 1997. DOI: 10.3745/KIPSTE.1997.4.6.1636.

[ACM Style]
Park Sung Soon and Koo Mi Soon. 1997. A Study on Generation of Parallel Task in High Perormance language. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 6, (1997), 1636-1651. DOI: 10.3745/KIPSTE.1997.4.6.1636.