Welcome![Sign In][Sign Up]
Location:
Search - dijkstra parallel

Search list

[BooksDijkstra-omp.c.tar

Description: 迪杰克斯特拉最短路径算法的OpenMP实现。体现了OpenMP并行编程的结构-Stratford迪杰克shortest path algorithm to achieve the OpenMP. Reflects the structure of OpenMP parallel programming
Platform: | Size: 2048 | Author: 祥子 | Hits:

[Process-ThreadDijkstra-omp

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:

[Linux-UnixParallel-computing-techniques

Description: 给出了linux集群系统的设计与实现,对并行程序设计中的消息传递机制给出了详细的说明,针对不同并行计算模型,研究了了并行程序设计的方法,结合数据挖掘技术等,给出并行计算平台的构建方法,并且对并行计算技术在化工过程与优化中的应用有很多优秀的观点。资料内容很丰富,对于研究并行技术的朋友有很大帮助。-Given Linux cluster system design and implementation of parallel programming, the message transfer mechanism gives detailed instructions, according to different parallel computing model, and the research indications parallel programming method and combining the data mining technology, etc, are parallel computing platform building method, and to parallel computing technology in the application of chemical process and optimization of a lot of good point of view. Material content is very rich, for studying parallel technology friend helps a lot.
Platform: | Size: 25996288 | Author: 王鹏 | Hits:

[Data structsparallel-dijkstra

Description: 并行化思路实现dijkstra算法。假设有p个处理器,N个顶点。给每个处理器分配N/p个顶点,求出局部的最小值,复杂度为O (N/p)。然后后一半的处理器将自己的最小值发送给第前p/2个处理器。前一半处理器接收到传来的值后,与局部的最小值比较,作为新值。继续循环,直到剩下一个处理器为止。-Parallelized dijkstra algorithm. Suppose there is p a processor, N vertex. Give each processor distribution N/p a vertex, find out the local minimum value, complexity is O (N/p). And then later half of the processors will sent its own minimum value to the first former p/2 processors. the first half receive the value of the processor and compare with the local minimum value,as a new value. Continue the circulation, until only one processor is left.
Platform: | Size: 744448 | Author: joyce | Hits:

[MPIDj-algorithm-implementation

Description: 包括Dijkstra并行串行算法的实现,可进行并行串行对比,得到时间开销-Including serial parallel Dijkstra algorithm implementation, can be parallel serial contrast, has been spending time
Platform: | Size: 2144256 | Author: berry | Hits:

[AI-NN-PRAlgoritmo Dijkstra

Description: research of dijkstra algorithm with openmp
Platform: | Size: 719872 | Author: ulises009 | Hits:

CodeBus www.codebus.net