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.
Minimum spanning tree is a classical problem in graph theory that plays a key role in a broad domain of applications.This paper proposes a minimum spanning tree algorithm using Prim's approach on Nvidia GPU under CUDA architecture. By using new developed GPU-based Min-Reduction data parallel primitive in the key step of the algorithm, higher efficiency is achieved. Experimental results show that we...
In this paper, we give a new algorithm evolving from Atallah's algorithm proposed in 1984, and we make many improvements: First of all, combining replaced sewing in order to simplify the third step; Secondly, we delete the fourth step. And we simplify the construction of the auxiliary graph, avoiding the second time to find Euler tour and the introduction of a mass storage array. The improvements...
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...
With the research and application of intelligent transportation system, there is a higher requirement for solving the optimal path problem in large scale transportation networks in real time. In order to get the effective optimal path algorithms for the actual transportation networks, three optimal path algorithms are chosen to be parallelized. The parallel optimal path algorithms are then implemented...
Modern microprocessors are becoming increasingly parallel devices, and GPUs are at the leading edge of this trend. Designing parallel algorithms for manycore chips like the GPU can present interesting challenges, particularly for computations on sparse data structures. One particularly common example is the collection of sparse matrix solvers and combinatorial graph algorithms that form the core of...
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.