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.
Heatmap visualization is a well-known type of visualization to alleviate the overplot problem of point visualization. As such, it is well suited to visualize Big Data. In order to tackle the velocity problem of Big Data, one has to leverage streaming computations. Recently, canopy clustering was shown to be well suited for Big Data heatmap visualization. In this article, we present how to design a...
In this paper, a configurable many-core hardware/software architecture is proposed to efficiently execute the widely known and commonly used K-means clustering algorithm. A prototype was designed and implemented on a Xilinx Zynq-7000 All Programmable SoC. A single core configured with the slowest configuration achieves a 10× speed-up compared to the software only solution. The system is fully scalable...
A latency-hiding algorithm for the parallelization of large scale agent-based model simulations (ABMS) on parallel/distributed computing platform is proposed. The key idea of this algorithm is using redundant computations to hide communication latencies. An analytical model for this algorithm is presented to tell how to select R value to reach the best speedup. Compared to B+2R algorithm [1], theoretical...
Recent advances in parallel and distributed computing have made it very challenging for programmers to reach the performance potential of current systems. In addition, recent advances in numerical algorithms and software optimizations have tremendously increased the number of alternatives for solving a problem, which further complicates the software tuning process. Indeed, no single algorithm can...
This paper provides an overview of different string matching algorithms in parallel environments. In this work, we have evaluated several algorithms, such as Knuth-Morris-Pratt, Boyer-Moore algorithm, Boyer Moore Horspool Algorithm, Zhu Takaoka algorithm, Quick Search Algorithm, BR Algorithm, Fast Searching algorithm, SSABS algorithm, TVSBS algorithm, ZTMBH algorithm and BRBMH algorithm. Static pattern...
The purpose of this paper is to implement association rule mining algorithm using Nvidia CUDA framework for general purpose computing on GPU. The major objective is to perform performance comparison of association rule mining algorithm using C based implementation on Intel Quad Core/Core2 Duo CPU with CUDA based implementation on Nvidia G80 and GTX 200 series GPU. The final outcome of this research...
Communication and synchronization are two main latency issues in computing FFT on parallel architectures. Both latencies have to be either hidden or tolerated to achieve high performance. One approach to achieve this is by multithreading. Another approach to tolerate latency is to map data efficiently onto the processors' local memory and exploiting data locality. Indirect swap networks, an idea proposed...
An analysis of a parallel solution of N2-1 puzzle using clusters, is presented. This problem is interesting due to its complexity and related applications, particularly in the field of robotics. A variation of classic heuristics for forecasting the work to be done in order to reach a solution is analyzed, and it is shown that its use significantly improves the time of sequential algorithm A . Then,...
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.