Typed Separation Set Partitioning for Thread Partitioning of Non-strict Functional Programs


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 8, pp. 2127-2136, Aug. 1998
10.3745/KIPSTE.1998.5.8.2127,   PDF Download:

Abstract

The semantics of non-strict functional languages require fine-grain dynamic scheduling and synchronization, making an efficient implementation on conventional parallel machine difficult. In compiling these languages, the most important step is to extract the sequentially executable portions of a program and to group them into a scheduling unit. This process is called partitioning. In this paper, we propose Typed Separation Set Partitioning algorithm for partitioning non-strict functional programs into threads using type information of input names and output names. Any input cannot be indirectly dependent on outputs whose types are incompatible to those of inputs. This algorithm can generate the longer threads than other partitioning algorithms can do.


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]
Y. C. Mo, J. H. Seok, Y. W. Hee, "Typed Separation Set Partitioning for Thread Partitioning of Non-strict Functional Programs," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 8, pp. 2127-2136, 1998. DOI: 10.3745/KIPSTE.1998.5.8.2127.

[ACM Style]
Yang Chang Mo, Joo Hyung Seok, and Yoo Weon Hee. 1998. Typed Separation Set Partitioning for Thread Partitioning of Non-strict Functional Programs. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 8, (1998), 2127-2136. DOI: 10.3745/KIPSTE.1998.5.8.2127.