Program Structuring Algorithms for Dynamically Reconfigurable Parallel Systems Based on Redundant Connection Switches
Published • Apr 5, 2005
NobleIDNI4P49W28R78S46
Authors:
Eryk Laskowski
Abstract
A new program graph structuring algorithm for dynamically reconfigurable multi-processor systems based on the look-ahead dynamic connection reconfiguration is presented. This architectural model enables elimination of connection reconfiguration time overheads. It consists in preparing link connectio...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!