A Comparative Study of Models of Parallel Computation
暂无分享,去创建一个
In recent years, a large number of models of parallel computation have been proposed. These models have rather diverse motivations including problems from operating systems, hardware, numerical algorithms and others. In a recent thesis, Petersonl has proved that most of these models are equivalent in the sense that they generate the same set of "computations." This no tion of equivalence, which is a straightforward gener alization of the notion of equivalence of grammars in automata. theory, is rather unsatisfactory in that it does not distinguish among models that intuitively are not equivalent.
[1] Richard J. Lipton. Limitations of synchronization primitives with conditional branching and global variables , 1974, STOC '74.
[2] Axel van Lamsweerde,et al. On an Extension of Dijkstra's Semaphore Primitives , 1972, Inf. Process. Lett..
[3] Richard M. Karp,et al. Parallel Program Schemata , 1969, J. Comput. Syst. Sci..
[4] Shimon Even,et al. Parallelism in tape-sorting , 1974, Commun. ACM.
[5] Robert M. Keller,et al. On Maximally Parallel Schemata , 1970, SWAT.