In this paper, the relation between parallel and sequential algorithms is discussed. We regard algorithms as definitions of transformations and investigated the relation between the sets of transformations defined by parallel and sequential algorithms. Three problems are treated mainly. The problems and the results for the problems may be summarized as follows. (1) Characterization of transformations which are both parallel and sequential-A necessary and sufficient condition for a transformation to be both parallel and sequential has been established. (2) Equivalence problems-The equivalence problem for two algorithms, one of which is parallel, is decidable, hence, the equivalence problem for two sequential algorithms is undecidable, i.e. an algorithm for deciding whether or not two given algorithms, one of which is parallel, define the same transformation has been presented. However, we have shown there is no algorithm for deciding whether or not two given sequential algorithms define the same transformation. (3) Translation problems-An algorithm for translating a parallel (sequential) algorithm into an equivalent sequential (parallel) algorithm has been presented.
All Science Journal Classification (ASJC) codes
- コンピュータ ビジョンおよびパターン認識