Design and Performance Evaluation of EXMAN: An EXtended MANchester Data Flow Computer

Patnaik,; Govindarajan,; Ramadoss,

doi:10.1109/tc.1986.1676747

Cited by 25 publications

(9 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 1 and Fig.6 it is clear that the matching unit is the primary bottleneck point and limits the performance of the system when the software parallelism is high. Similar observations have been made in the literature through simulation studies [12,16], and one solution to this problem is the use of multiple matching units [16]. Next, we consider various changes to the architecture and study their effects on the overall performance of the system.…”

Section: Resultsmentioning

confidence: 56%

“…Consequently, through our model we have been able to identify the various hardware bottleneck centers by studying the behavior of the machine under varying load conditions. Although our results indicate that the matching unit is a bottleneck point, providing two matching units [16] only partially solves the problem. Various architectures incorporating multiple matching and node store units have been analyzed in this paper both from the performance and reliability considerations.…”

Section: Introductionmentioning

confidence: 56%

“…A few dataflow architectures have been implemented [6,12], a number of prototypes have been proposed [1,4,8,14,17], and some of them have been simulated [5,10,16]. Depending on the way the data tokens are handled, dataflow computers can be divided into the static model and the dynamic model [13].…”

Section: Introductionmentioning

confidence: 99%

“…Performance evaluation of the Manchester dataflow machine has been carried out through simulation studies [16] and through experiments on a prototype machine [12]. However, no analytical modeling of the Manchester dataflow architecture has been reported in the literature.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Analytical modeling and architectural modifications of a dataflow computer

Ghosal¹,

Bhuyan²

1987

Proceedings of the 14th Annual International Symposium on Computer Architecture - ISCA '87

View full text Add to dashboard Cite

Dataflow computers are an alternative to the von Neumann architectures and are capable of exploiting large amount of parallelism inherent in many computer applications. This paper deals with the performance analysis of the Manchester dataflow computer based on queueing network models. The model of the dataflow computer has been validated by comparing the analytical results with those obtained from the prototype Manchester dataflow computer. The bottleneck centers in the prototype machine have been identified through the model and various architectural modifications have been investigated both from performance and reliability viewpoints.

show abstract

Section: Resultsmentioning

confidence: 56%

Section: Introductionmentioning

confidence: 56%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Analytical modeling and architectural modifications of a dataflow computer

Ghosal¹,

Bhuyan²

1987

Proceedings of the 14th Annual International Symposium on Computer Architecture - ISCA '87

View full text Add to dashboard Cite

show abstract

“…In this approach, an enhanced array structure is used to extend the basic Manchester machine [36]. The machine, referred to as the EXtended MANchester (EXMAN) computer, alleviates the problem of memory overhead by having token pointers pointing to the starting location of the array and increases the access speed by utilizing conventional random access structures.…”

Section: Ex Te Nde D Manc He Ster Approac Hmentioning

confidence: 99%

Issues in Dataflow Computing

Liu

Hurson

1993

Advances in Computers

View full text Add to dashboard Cite

Dataflow Computers: Their History and Future

Hurson

Kavi

2007

Wiley Encyclopedia of Computer Science and Engineering

View full text Add to dashboard Cite

The dataflow model of computation offers an attractive alternative to control‐flow in extracting parallelism from programs. The execution of a dataflow instruction is based on the availability of its operand(s); hence, the synchronization of parallel activities is implicit in the dataflow model. Instructions in dataflow model do not impose any constraints on sequencing except for the data dependencies in the program. The elegant representation of concurrency in dataflow computation led to considerable interest in dataflow modes over the past three decades. These efforts have led to successively more elaborate architechtural implementations of the model. However, studies form past projects have revealed a number of inefficiencies in dataflow computing. Recent advances that may address these deficiencies have generated a renewed interest in dataflow. In this article we will survey the various issues and developments in dataflow computing.

show abstract

Design and Performance Evaluation of EXMAN: An EXtended MANchester Data Flow Computer

Cited by 25 publications

References 16 publications

Analytical modeling and architectural modifications of a dataflow computer

Analytical modeling and architectural modifications of a dataflow computer

Issues in Dataflow Computing

Dataflow Computers: Their History and Future

Contact Info

Product

Resources

About