Paper Info
Title
A Functional Execution Model for a Non-Dataflow Tagged Token Architecture
Abstract
The author proposes a new execution model for a non-dataflow tagged-token architecture which is not Petri-net based but rather more closely related to the lambda calculus. The model exploits a functional programming style having applicative-order evaluation. The computation's execution graph is dynamically generated according to easily understood dynamic tagging rules which have been demonstrated to be implementable. The model permits conceptually unbounded parallelism for an interesting class of list-oriented computations. The author explains the model with the help of a simple dot-product computation as an example. He highlights some of the major differences between the dataflow paradigm and his own. Architectural issues toward implementation are briefly discussed.
Year
DOI
Venue
1992
10.1109/IPPS.1992.222978
Beverly Hills, CA
Keywords
Field
DocType
dynamic tagging rule,new execution model,functional execution model,execution graph,conceptually unbounded parallelism,functional programming style,list-oriented computation,non-dataflow tagged token architecture,dataflow paradigm,architectural issue,simple dot-product computation,applicative-order evaluation,concurrent computing,calculus,parallel processing,parallel programming,functional programming,petri net,computer architecture,computer applications,lead,lambda calculus
Lambda calculus,Architecture,Programming language,Functional programming,Computer science,Theoretical computer science,Exploit,Dataflow,Execution model,Security token,Computation
Conference
ISBN
Citations 
PageRank 
0-8186-2672-0
2
0.55
References 
Authors
16
1
Name
Order
Citations
PageRank
Glenn Jennings120.55