Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Parallel algorithm”

Parallel algorithm development

Thomas F. Adams · University of North Texas Digital Library (University of North Texas) · 1996

Rapid changes in parallel computing technology are causing significant changes in the strategies being used for parallel algorithm development. One approach is simply to write computer code in a standard language like FORTRAN 77 or with the expectation that the compiler will produce executable code that will run in parallel. The alternatives are: (1) to build explicit message passing directly into the source code; or (2) to write source code without explicit reference to message passing or parallelism, but use a general communications library to provide efficient parallel execution. Application of these strategies is illustrated with examples of codes currently under development.

Cited by 0Open access

Parallel genetic algorithm

Antanas Žilinskas, Julius Žilinskas · 2007

Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medical data, behavioral science, marketing research, etc. Implementations of MDS methods include a subroutine for an auxiliary global optimization problem. The latter is difficult because of high dimensionality, absence of overall smoothness, and a large number of local minima. In such a situation application of a genetic algorithm (GA) seems reasonable. A favorable assessment of application of GAs in MDS in previous publications is based on heuristic arguments without estimating quantitatively the precision of GA while applied to the solution of corresponding global optimization problems. Indeed, the estimation of precision is difficult because of complexity to find the actual global minimum not only in routine use but also in unique research experiments. Quantitatively the precision of GA was estimated, at least in the experimental problems of modest dimensionality, using global minima found by means of the developed parallel version of explicit enumeration algorithm. To cope with high complexity of the minimization problem a parallel version of GA is developed, and its efficiency for problem of higher dimensionality is investigated.

Cited by 22

Parallel genetic algorithm

Trupl, Jan · Brno University of Technology Digital Library (Brno University of Technology) · 2008

Práce popisuje návrh a implementaci různých evolučních algoritmů, vylepšených tak, aby mohly využívat výhod paralelismu na víceprocesorových systémech, a zároveň umožňovaly, aby výpočet probíhal na více počítačích v počítačové síti. Algoritmy jsou určeny k hledání globálního extrému funkce několika proměnných. Jsou nastíněny různé zajímavé optimalizační problémy a možnosti jejich řešení právě pomocí evolučních algoritmů. V práci je rovněž rozebíráno použití knihovny rozhraní MPI (message passing interface) a OpenMP, v rozsahu nutném pro pochopení problematiky implementace paralelních evolučních algoritmů.

Cited by 0

Parallel graph algorithm

Nguyen, Duc Hieu. · DR-NTU (Nanyang Technological University) · 2012

This report records the author’s work during the project’s period. This project will study 
\n
\nparallel graph algorithm for solving graph based problem. It will research the shortest 
\n
\npath problems and all shortest path problems. 
\n
\nThe author studied some well-known algorithms such as Dijiskstra algorithm and Floyd 
\n
\nalgorithm. They have been studied in sequential, parallel with shared memory and 
\n
\ndistributed memory. After that the author ran a benchmark for Floyd algorithm with 
\n
\ndistributed memory to analyze it further. 
\n
\nAfter studied the shortest path problems, the author came up with a new approach which 
\n
\nused Floyd algorithm in order to reduce the number of cycles which needs to complete 
\n
\nthe calculation for all shortest path problem. The author applied the knowledge about 
\n
\nparallel processing and graph problem to complete the study. 
\n
\nThe report highlights what the author did and learnt during the final year project’s 
\n
\nperiod.

Cited by 0

Parallel Algorithm Implementation.

John H. Reif · 1996

Abstract : The goal of the project was to transform the book, Synthesis of Parallel Algorithms (John Reif, editor), into a CD-ROM suitable for inclusion with other materials for graduate level courses and reference material. During the year covered by the grant, the popularity of the Internet and the World Wide Web exploded, resulting in a change of focus for the project. The idea for a CD-ROM disk as originally envisioned was dropped in favor of making the multimedia version of the book available via the World Wide Web, thus making the material more easily available to the scientific community and the world at large. Chapter authors publish their chapters at their own Internet sites and maintain the sites, updating the information as the field of parallel algorithms evolves, resulting in a multimedia text which is truly dynamic, avoiding the problems associated with distribution and verification that the information presented remains current - a task that is impossible with a static medium such as a CD-ROM disk.

Cited by 0

Parallel -NNG algorithm.

Ali Dashti (461880), Ivan Komarov (120593), Roshan M. D’Souza (159250) · Figshare · 2015

Cited by 0Open access

Parallel algorithm overview.

Kris Popendorf (241029), Hachiya Tsuyoshi (241032), Yasunori Osana (241035) et al. · Figshare · 2015

<p>Here we show a simplified 8 node example of the parallel Murasaki algorithm. The time axis shows the progression of steps and is not drawn to scale. At <b>A</b> Each hasher node is assigned an equal part of the sequence data (depicted as yellow-blue line), and each storage node is assigned a part of the hash table (depicted as a red-blue line). At <b>B</b> nodes have been divided into “hasher nodes” (shown as blue pentagons) and “storage nodes” (shown as red hexagons). Here hasher nodes act as producers, hashing the input sequence and passing pairs to the storage nodes which store them in the hash table. At <b>C</b>, the producer/consumer roles are switched such that storage nodes extract matching seed sets from the hash table and send them to hash nodes. Once all matching seed sets have been extracted, the storage nodes are finished and can be terminated (indicated by the lighter coloring in <b>D</b>). At this point each hasher node has an independent anchor tree. Hasher nodes are divided into pairs, with one node sending all of its anchors to the other. These anchors are merged using the normal coalescing algorithm. Once a hasher has finished sending, it can be terminated. Because the number of hasher nodes is halved at each iteration, this merge step finishes in iterations, where is the number of hasher nodes. At <b>E</b> only one hasher node remains which handles any additional scoring and filtering of anchors, and outputs the final result.</p>

Cited by 0Open access

A Parallel Criminisi Algorithm

Chang Liu · 2018

Nowadays image repairing is widely used in a variety of areas. Inpainting algorithms play an important role in the image repairing process. Among all inpainting algorithms, Criminisi algorithm is a common used algorithm. In this paper, we modify the Criminisi algorithm in a parallel way. Our experimental results show that our parallelization makes the repairing process faster and still maintain good performance.

Cited by 1

Parallel Welch–Berlekamp Algorithm

Chao Chen, Yunghsiang S. Han, Nianqi Tang et al. · IEEE Transactions on Information Theory · 2025

This paper presents new variants of the Welch-Berlekamp algorithm that are favorable to hardware implementation. First, we derive the parallel Welch-Berlekamp (PWB) algorithm in a constructive manner based on the properties of solutions to the rational interpolation problem. The algorithm features the simultaneously performed discrepancy computation and polynomial update. Second, we explore the early-termination mechanism of the PWB algorithm for decoding of Reed-Solomon (RS) codes. By introducing the concept of incomplete error locator polynomial, we show that if <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$e \leq t$ </tex-math></inline-formula> (where <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">e</i> is the number of errors and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i> is the error correction capability), the PWB algorithm can be terminated at latest at the completion of the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(t+ e)$ </tex-math></inline-formula>-th iteration. This leads to the early-terminating PWB (EPWB) algorithm. Finally, we develop frequency-domain versions of the PWB and EPWB algorithms, namely, FPWB and FEPWB. The key point toward the two algorithms is to replace the update of polynomial coefficients with the update of polynomial evaluations. It is worth noting that the FEPWB algorithm applies only to shortened RS codes. Furthermore, an efficient systolic architecture for the FPWB algorithm is designed, which is easily adapted for the FEPWB algorithm.

Cited by 0

Parallel Algorithm Performance Results

Mr. Milind, V. Kulkarni, Dr. Dinesh et al. · 2013

Digital videos find applications in many fields ranging from telecommunications to broadcasting and so on. Hence, in past two to

Cited by 0

A Parallel/Recursive Algorithm

Gibbs, W. R. · arXiv (Cornell University) · 2003

An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The cases of homogeneous and non-homogenous two term recursion are treated. Applications to three problems (finding the eigenvalues of a tri-diagonal matrix, the solution of a radial wave equation and the solution of a tri-diagonal matrix) are discussed.

Cited by 0Open access