Proceedings of the 16th Annual International Symposium on Computer Architecture - ISCA '89 1989
DOI: 10.1145/74925.74930
|View full text |Cite
|
Sign up to set email alerts
|

The Epsilon dataflow processor

Abstract: The spsilon dataBow architecture is designed for high speed uniprocessor execution as well as for parallel operation in a multiprocessor system. The Epsilon architecture directly matches ready operands, thus eliminating the need for associative matching stores. Epsilon also supports low cost data fan out and critical sections.A 10 MFLOPS CMOS/TTL processor prototype is running and its performance has been measured with several benchmarks.The prototype processor has demonstrated sustained performance exceeding … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0
4

Year Published

1991
1991
2014
2014

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 44 publications
(11 citation statements)
references
References 7 publications
0
6
0
4
Order By: Relevance
“…Unfortunately, this is often difficult with the standard Von Neumman approach to computing, motivating aggressive research on alternative models such as TRIPS [17,19] and Raw [25]. A popular alternative was the DataFlow model, where instructions can execute as soon as they have their input operands available [7,6,10,9,18], instead of following the program order. Although dataflow ideas are in use, e.g., in Tomasulo's algorithm [24] actual DataFlow machines were never popular.…”
Section: Introductionmentioning
confidence: 99%
“…Unfortunately, this is often difficult with the standard Von Neumman approach to computing, motivating aggressive research on alternative models such as TRIPS [17,19] and Raw [25]. A popular alternative was the DataFlow model, where instructions can execute as soon as they have their input operands available [7,6,10,9,18], instead of following the program order. Although dataflow ideas are in use, e.g., in Tomasulo's algorithm [24] actual DataFlow machines were never popular.…”
Section: Introductionmentioning
confidence: 99%
“…I-structures [6]. On the other hand, asynchronous transfer of control (context switching) is notoriously expensive on current machines, leading many researchers to examine asynchronous parallel execution models through the study of real machines [11,13,15,22,25,27], paper architectures [1, 5, 14, 16, 1 9 ], and abstract machines [21]. In all of these proposals, the scheduling of threads is viewed as a property of the machine, invisible to the compiler.…”
Section: Introductionmentioning
confidence: 99%
“…As máquinas dinâmicas (Shimada et al, 1986;Gurd et al, 1985;Kishi et al, 1983;Grafe et al, 1989;Papadopoulos e Culler, 1990) são uma evolução das máquinas estáticas, por nelas permitirem que mais de um token esteja presente em um arco, o que significa utilizar toda a potencialidade da programação a fluxo de dados, exigindo, no entanto um tratamento mais complexo na implementação do sistema, pois é preciso além de armazenar os dados, identificar os parceiros dos dados que disparam uma operação.…”
Section: Capítulo 3 Máquinas a Fluxo De Dadosunclassified