Research on the Cost of Open Nested Transaction in the Open Reconfigurable Network

Abstract

<p class="Abstract">Open reconfigurable network (ORN) is proposed to meet users&rsquo; diversified and dynamic requirements. Path deployment is a typical service in the ORN, and can be executed in the way of open nested transaction for high efficiency. In this transaction, each operation on network nodes (NNs) is a sub-transaction, which costs CPU resources. In this paper, first we build the cost model of the path deployment of three kinds of sub-transactions execution&mdash;prepare in advance, implement concurrently and prepare dynamically. Secondly, we analyze two main approaches of path deployment in the ORN&mdash;unicast and multicast, and we concluded that multicast costs more than unicast when we ignore the time. Finally, based on the comprehensive consideration of cost and time, we propose the optimal way to execute nested transaction in the ORN.</p

A Communication-aware Scheduling Algorithm for Hardware Task Scheduling Model on FPGA-based Reconfigurable Systems

“…The original fragmentation is 0. After placing a task T (3,3) The maximum adjacent edges in Fig.6(a) are still 6. But in Fig.6(b), the adjacent edges of task T's right side are adjacent to communication channel.…”

“…When a configuration is loaded, the connecting and disconnecting of IR are changed. IR is a very important part in FPGA and mainly reflects the connecting requirement, which cannot be neglected in real model [3]. However, there is little investigation into data communications.…”