ABSTRACT
A new system, that of matrix grammars, for two-dimensional picture processing, is introduced. A hierarchy, induced on Chomsky's is found. Language operations such as union, catenation (row and column), Kleene's closure (row and column), and homomorphisms are investigated. It is found that the smallest class of these languages may serve as the class of arrays, which is defined as the smallest class of arrays closed under union, catenation (row and column) and Kleene's closure (row and column). Eight possible ways of defining a matrix language are discussed and it is suggested that one of them may lead to a normal form of matrix grammars. The method is advantageous over others on several points. Perhaps the most interesting of all is that it provides a compromise between purely sequential methods, which take too much time for large arrays and purely parallel methods, which usually take too much hardware for large arrays.
- Sequential/parallel matrix picture languages
Recommendations
Sequential/parallel matrix picture languages
A new system, that of matrix grammars, for two-dimensional picture processing, is introduced. A hierarchy, induced on Chomsky's is found. Language operations such as union, catenation (row and column), Kleene's closure (row and column), and ...
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization
In this paper, we describe scalable parallel algorithms for symmetric sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1,024 processors on a Cray T3D parallel computer. Through our ...
Communication-optimal Parallel and Sequential Cholesky Decomposition
Numerical algorithms have two kinds of costs: arithmetic and communication, by which we mean either moving data between levels of a memory hierarchy (in the sequential case) or over a network connecting processors (in the parallel case). Communication ...
Comments