Abstract
The prevalent concepts of control-flow and data-flow to build computers have their limitations and weaknesses in exploiting parallelism to the utmost limit. Hence, this paper presents a novel technique to handle parallel computations, called associative dataflow. This approach eliminates the major bottleneck in dataflow architectures concerning the matching of tokens and enhancement of their performance. Preliminary results have indicated faster execution speed and higher ALU utilization for the proposed model compared to conventional dataflow model. These results forecast a promising future for associative dataflow model of computations.
| Original language | English |
|---|---|
| Pages (from-to) | 322-328 |
| Number of pages | 7 |
| Journal | Conference Proceedings - IEEE SOUTHEASTCON |
| Publication status | Published - 1995 |
| Externally published | Yes |
| Event | Proceedings of the IEEE Southeastcon '95 Conference - Raleigh, NC, USA Duration: Mar 26 1995 → Mar 29 1995 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering