Description: 基于Java多线程实现所有顶点间最短路径的并行算法-Java-based multi-threaded realize the shortest path between all vertices of the parallel algorithm Platform: |
Size: 135168 |
Author:john |
Hits:
Description: C语言和OpenMP编写的可在多核或SMP处理器上进行多线程运行的最短路径算法。可了解多核多线程和OpenMP的并行编程技术。-C language and can be prepared OpenMP or multi-core processors on SMP multi-threading to run the shortest path algorithm. Learn to multi-core multi-thread and OpenMP parallel programming technology. Platform: |
Size: 2048 |
Author:computing |
Hits:
Description: 本文根据脉冲耦合神经网络（PCNN）并行运行的特点，提出了基于PCNN 模型的迷宫最短路径搜索算法。
从理论上对该算法进行了分析和讨论，并给出了具体的算法和实验结果，验证了该方法的有效性。与其他算法相比，
该方法可以在最短的时间内完成最短路径的搜索。-Based on Pulse Coupled Neural Network (PCNN) run in parallel the characteristics of PCNN model is proposed based on the shortest path maze searching algorithm. In theory the algorithm is analyzed and discussed, and given a specific algorithm and experimental results verify the effectiveness of the method. Compared with other algorithms, the method can be completed within the shortest possible time the shortest path search. Platform: |
Size: 347136 |
Author:wangxx |
Hits:
Description: 本文在脉冲耦合神经网络(PCNN2Pulse Coupled Neural Network) 的基础上,提出了时延脉冲耦合神经网络
(DPCNN2Delay PCNN) ,并将其成功地用于求解最短路径,同时给出了基于DPCNN 的最短路径求解算法. Caulfield 与
Kinser 提出了用PCNN 求解迷宫问题的方法,虽然他们的方法也可用于求解最短路径,但所需神经元的数量巨大,而本
文的方法所需的神经元的数量远小于他们的方法. 同时,本文的方法充分利用了DPCNN 脉冲快速并行传播的特点,可
迅速地求出最短路径,其所需的计算量仅正比于最短路径的长度,与路径图的复杂程度及路径图中的通路总数无关.
计算机仿真结果表明,采用本文的方法,用少量的神经元就可迅速地求出最短路径.- This paper presents DPCNN(Delay Pulse Coupled Neural Network) based on PCNN and uses DPCNN to find the
shortest path successfully.Meanwhile ,the algorithmof finding the shortest path based on DPCNN is described. Caulfield and Kinser in2
troduced the PCNN method to solve the maze problem and although their method also can be used to find the shortest path ,a large
quantity of neurons are needed. However ,the approach proposed in this paper needed very fewer neurons than proposed by Caulfield
and Kinser. In the meantime ,due to the pulse parallel transmission characteristic of DPCNN ,the approach proposed can find the short2
est path quickly. The computational complexity of our approach is only related to the length of the shortest path , and independent to
the path graph complexity and the number of existing paths in the graph. The results of computer simulations show that by using the
approach proposed in this paper ,we can use a small quantity of neurons to find the shortest p Platform: |
Size: 102400 |
Author:wangxx |
Hits:
Description: 针对目前图形处理器(GPU) 上的动态数据处理问题，在分析现有并行单源最短路径(SSSP) 算法的基础上，对 GPU上的Moore SSSP算法进行并行化设计与实现。搜索时，综合应用层次化任务分配、层次化工作队列、层次化 Kernel 调用等策略。在不同类型图数据上进行实验测试，实验结果表明，该算法能有效减少空线程开销、访存开销以及同步时间。-For dynamic data processing on the graphics processor (GPU), the analysis of existing parallel single-source shortest path (SSSP) algorithm based on the Moore SSSP algorithm on GPU Parallel design and realization. Search application level task allocation, hierarchical work queue, hierarchical Kernel call strategy. Experimental tests on the different types of map data, experimental results show that the algorithm can effectively reduce the empty thread overhead and memory access overhead and synchronization time. Platform: |
Size: 1076224 |
Author:JIANGLILY |
Hits:
Description: 高性能计算与云计算
实验报告
——MPI 求最短路径
本实验的目的是通过练习掌握分布存储并行编程的知识和技巧。
1. 了解并行算法的设计方法
2. 掌握MPI并行程序编写的基本步骤
3. 掌握MPI编程环境和工具的使用
4. 了解MPI程序调试和调优的技巧
-High-performance computing and cloud computing lab report MPI seeking purpose of this experiment is the shortest path through a distributed memory parallel programming practice to master the knowledge and skills. 1. Understand the parallel algorithm design method 2. Master the basic steps 3. MPI parallel programming using MPI programming environment and master the tools 4. Understand MPI debugging and tuning tips Platform: |
Size: 184320 |
Author:alfred artorius |
Hits:
Description: 图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。遗传算法是解优化问题的有效算法，而并行遗传算法是遗传算法研究中的一个重要方向，受到了研究人员的高度重视。(Graph theory plays an important role in computer science. It provides a simple and systematic modeling method for many problems. Many problems can be translated into graph theory problems, and then solved by the basic algorithm of graph theory. Genetic algorithm is an efficient algorithm for solving optimization problems, and parallel genetic algorithm is an important direction of genetic algorithm research, and has attracted much attention of researchers.) Platform: |
Size: 27648 |
Author:四姑娘
|
Hits:
Description: In this report, we study on the intermodal transportation system of Pearl River Delta city group. In the system, each city is regarded as a node. For convenience, we remove some unimportant cities and simplify the system from 14 nodes to 5 nodes. Because people need to travel from one city to another, we define a set of directed links between nodes, and each link has some specific attributes such as tail (origin), head (destination), transport mode, cost, duration, etc.
We choose C++ language to code the defined network. In this report, we want to find the cheapest path in terms of the attribute from an origin s to a destination d.
We use link label setting method to find the shortest path for an intermodal transportation routing problem. This method works for a network with parallel links. Also, in the network, link attribute must be nonnegative. Platform: |
Size: 1024 |
Author:鱼888
|
Hits:
Search - parallel shortest path