排序方式： 共有6条查询结果，搜索用时 15 毫秒
1
1.
As a parallel programming model, Map-Reduce is used for distributed computing of massive data. Map-Reduce model encapsulates
the details of parallel implementation, fault-tolerant processing, local computing and load balancing, etc., provides a simple but powerful interface. In case of having no clear idea about distributed and parallel programming, this
interface can be utilized to save development time. This paper introduces the method of using Hadoop, the open-source Map-Reduce
software platform, to combine PCs to carry out scalable parallel computing. Our experiment using 12 PCs to compute N-body problem based on Map-Reduce model shows that we can get a 9.8x speedup ratio. This work indicates that the Map-Reduce can be applied in scalable parallel computing. 相似文献
2.
行固定法是一种基于MPI并应用在高性能计算机系统上的并行算法，该算法很好地运用了矩阵的特性，不论用高斯消去
法解线性方程组、还是对矩阵进行Lu分解或者对矩阵进行m次幂计算的大规模并行计算时，由于该算法将各行的计算固定在
各节点上，有效地实现了计算的局部性，减少了通信开销，从而获得了比较好的加速比. 相似文献
3.
行固定法是一种基于ＭＰＩ并应用在高性能计算机系统上的并行算法,该算法很好地运用了矩阵的特性,不论用高斯消去法解线性方程组、还是对矩阵进行ＬＵ分解或者对矩阵进行ｍ次幂计算的大规模并行计算时,由于该算法将各行的计算固定在各节点上,有效地实现了计算的局部性,减少了通信开销,从而获得了比较好的加速比． 相似文献
4.
Blocking optimized SIMD tree search on modern processors 总被引：2，自引：0，他引：2
Tree search is a widely used fundamental algorithm. Modern processors provide tremendous computing power by integrating multiple
cores, each with a vector processing unit. This paper reviews some studies on exploiting single instruction multiple date
(SIMD) capacity of processors to improve the performance of tree search, and proposes several improvement methods on reported
SIMD tree search algorithms. Based on blocking tree structure, blocking for memory alignment and dynamic blocking prefetch
are proposed to optimize the overhead of memory access. Furthermore, as a way of non-linear loop unrolling, the search branch
unwinding shows that the number of branches can exceed the data width of SIMD instructions in the SIMD search algorithm. The
experiments suggest that blocking optimized SIMD tree search algorithm can achieve 1.6 times response speed faster than the
un-optimized algorithm. 相似文献
5.
Parallel virtual machine(PVM) has been a prevalent parallel computing environment for heterogeneous systems. The generic
portion of PVM is implemented on the basis of TCP/IP in result of high cost and low performance in communication. This paper
describes the design and implementation of GMPVM(parallel virtual machine based on Myrinet message passing system), a PVM
portion based on Myrinet's GM API(message passing system on Myrinet). The goal of this work is to make the maximum use of the high
bandwidth and low latency of Myrinet; to provide PVM portion with a user-level, light weighted communication subsystem. GMPVM is
developed on ZiQiang-2000 (SUHPCS). The difference between PVM and GMPVM is figured out here, and also some optimization
technique discussed. 相似文献
6.
As a coprocessor, field-programmable gate array (FPGA) is the hardware computing processor accelerating the computing capacity
of computers. To efficiently manage the hardware free resources for the placing of tasks on FPGA and take full advantage of
the partially reconfigurable units, good utilization of chip resources is an important and necessary work. In this paper,
a new method is proposed to find the complete set of maximal free resource rectangles based on the cross point of edge lines
of running tasks on FPGA area, and the prove process is provided to make sure the correctness of this method. 相似文献
1