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.
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according to an input parameter k. Betweenness centrality is a useful kernel for analyzing the importance of vertices or edges in a graph and has found uses in social networks, biological networks, and power grids, among others. k-betweenness...
In order to convert High Level Language (HLL) into hardware, a Control Dataflow Graph (CDFG) is a fundamental element to be used. Otherwise, Dataflow Architecture, can be obtained directly from the CDFG. In the 1970s and late 1980s, the Dataflow Model was the focus of attention that provided parallelism in a natural form. In particular, dynamic dataflow architecture can be generated to produce a high...
Ant colony optimization (ACO) is based on behavior of food gathering of ants. ACO is a powerful search tool when applied to combinatorial optimization problems. However, ACO requires a lot of calculation time, because the search mechanism of ACO is based on repetitive calculations. Reducing calculation time is the most important priority in case of applying ACO to combinatorial optimization problems...
The computer industry has adopted multi-threaded and multi-core architectures as the clock rate increase stalled in early 2000's. It was hoped that the continuous improvement of single-program performance could be achieved through these architectures. However, traditional parallelizing compilers often fail to effectively parallelize general-purpose applications which typically have complex control...
This paper presents a method for optimising parallelisation and scheduling of task graphs containing representation of loops for implementation in heterogeneous computing systems with both software and hardware processors. The method integrates loop unrolling with task scheduling and determines the extent to which each loop should be unrolled to maximise performance, while meeting size constraints...
The theory solution to 802.11b is defined not only by the visualization of compilers, but also by the practical need for symmetric encryption. In this paper, we validate the improvement of Byzantine fault tolerance, which embodies the unfortunate principles of parallel cyberinformatics. In our research, we disconfirm that lambda calculus can be made linear-time, peer-to-peer, and self-learning.
The main propose of this project is to design a multi-agent system platform on a flexible manufacturing cell (FMC). Taking into consideration all levels of functional issues, cellular architecture, standardization, and technical configurations, we take advantage of features released on a graphical programming commercial software, such as object oriented programming, distributed intelligence, and block...
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.