Construction with parallel derivatives of the closure of a parallel program schema
暂无分享,去创建一个
The parallel derivative of a set of strings is introduced. Given a serial, repetition-free parallel program schema, its closure is constructed by taking parallel derivatives of its set of computations. The construction resembles the construction of a state diagram from a regular expression by means of derivatives.
[1] Raymond E. Miller,et al. A Comparison of Some Theoretical Models of Parallel Computation , 1973, IEEE Transactions on Computers.
[2] Dean N. Arden. Delayed-logic and finite-state machines , 1961, SWCT.
[3] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.
[4] Robert M. Keller,et al. Parallel program schemata and maximal parallelism , 1972 .
[5] Robert M. Keller,et al. Parallel Program Schemata and Maximal Parallelism I. Fundamental Results , 1973, JACM.