The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Various parallel applications require a low-latency interconnection network to achieve high performance and high scalability. Recently proposed random network topologies achieve low latency, but they require each switch to have a large number of routing table entries, e.g., larger than N for an N-node network, for implementing a minimal routing. In this study, we propose the use of a random network...
A theoretical foundation for any turbo interleaver to be a contention-free interleaver to access data in parallel by a butterfly network is presented. A contention-free parallel access of multiple memories in parallel plays a crucial role for implementing high speed turbo decoders for high data rate applications. The presented theoretical analysis shows that a butterfly network has a sufficiently...
In this paper we propose a set of different configurations of failure recovery schemes, developed for network-on-chip (NoC) based systems. These configurations exploit the fact that communication in NoCs tends to be partitioned and eventually localized. The failure recovery approach is based on checkpoint and rollback and is aimed towards fast recovery from system or application level failures. The...
This paper presents a new Clos network routing algorithm in order to reduce the high time complexity of original algorithm for Clos network. The paper illustrates that it is an independent problem whether a column in specification matrix is completive. As a result, it eliminates backtrackings among columns and backtrackings among elements in the same column. The presented algorithm completely achieves...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.