By Topic

Parallel history sensitive computations in dataflow architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Park, J.H. ; Dept. of Comput. Sci., Oklahoma State Univ., Stillwater, OK, USA ; George, K.M.

This paper addresses the history sensitive computation problem in dataflow architecture. Current solutions use memory which is going a step backwards to Von Neumann model of computers. Furthermore, these solutions are not suitable for exploiting parallelism. In this paper, a new memoryless solution is reviewed and approaches based on forwarding, pipelining, and loop unfolding to maximize its parallel processing are presented. Forwarding mechanisms are presented for both static and dynamic dataflow environments

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996