Title :
A simple machine [based on the SK-combinator reduction mechanism]
Author :
Dickinson, Alex ; Pope, Michael T.
Author_Institution :
AT&T Bell Labs., Holmdel, NJ, USA
Abstract :
A simple machine architecture based on an extension to the combinator notation is described. Code travels along a unidirectional stream and is executed in parallel by simple finite state machine based cells separated by sections of a first-in, first-out (FIFO) buffer. The resulting regularity and structural simplicity ensure a good match to VLSI implementation. It is verified that the extended combinator is a viable execution model. Preliminary simulation results are presented
Keywords :
VLSI; finite state machines; parallel architectures; FIFO buffer; SK-combinator reduction mechanism; VLSI implementation; combinator notation; finite state machine based cells; parallel code execution; regularity; simple machine architecture; simulation; structural simplicity; unidirectional stream; Automata; Biochemistry; Biological system modeling; Biology computing; Computational modeling; Concurrent computing; Magnetic heads; Sequences; Very large scale integration; Writing;
Conference_Titel :
TENCON '92. ''Technology Enabling Tomorrow : Computers, Communications and Automation towards the 21st Century.' 1992 IEEE Region 10 International Conference.
Conference_Location :
Melbourne, Vic.
Print_ISBN :
0-7803-0849-2
DOI :
10.1109/TENCON.1992.271851
