@techreport{R-86-22,
TITLE = {Tradeoffs in an Architecture based on Asynchronous Processes},
AUTHOR = {Johan Fagerstr{\"o}m},
YEAR = {1986},
NUMBER = {R-86-22},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-86-22+abstr},
ABSTRACT = {Much research today is devoted to finding new and improved computer architectures in which parallel computations can be performed, the goal being an exploitation of the natural parallelism inherent in many problem descriptions. This paper describes a family of architectures based on asynchronous processes. An important aspect of this class of architectures is its modularity. Within the architecture we hope to avoid the usual bottlenecks of Von Neuman machines and at the same time avoid the problem of dynamically binding every operation as in dataflow machines. A silicon compiler can use the modularity of descriptions to perform various optimizations on instances of the architecture. Examples of various trade-offs possible in the architecture are given.},
IDANR = {LiTH-IDA-R-86-22},
NOTE = {Accepted for 2nd Nordic Symposium on VLSI in Computers and Communications, 1986}