Title :
Using clerk in parallel processing
Author :
Stout, Quentin F. ; Stout, Quentin F. ; Stout, Quentin F. ; Stout, Quentin F.
Abstract :
Some models of parallel computation consist of copies of a single finite automaton, connected together in a regular fashion. In such computers clerks can be a useful data structure, enabling one to simulate a more powerful computer for which optimal algorithms are easier to design. Clerks are used here to give optimal algorithms for the 3-dimensional connected is problem on a parallel processing array, and a circle construction problem on a pyramid cellular automaton.
Keywords :
Algorithm design and analysis; Automata; Computational modeling; Computer science; Concurrent computing; Data structures; Parallel processing; Principal component analysis; Random access memory; Read-write memory;
Conference_Titel :
Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
Conference_Location :
Chicago, IL, USA
DOI :
10.1109/SFCS.1982.48
