Gram–Schmidt Process in Different Parallel Platforms
Journal Title: International Journal of Advanced Research in Artificial Intelligence(IJARAI) - Year 2015, Vol 4, Issue 6
Abstract
Important operations in numerical computing are vector orthogonalization. One of the well-known algorithms for vector orthogonalisation is Gram–Schmidt algorithm. This is a method for constructing a set of orthogonal vectors in an inner product space, most commonly the Euclidean space Rn. This process takes a finite, linearly independent set S = {b1, b2, …, bk} vectors for k = n and generates an orthogonal set S1 = {o1, o2, …, ok}. Like the most of the dense operations and big data processing problems, the Gram–Schmidt process steps can be performed by using parallel algorithms and can be implemented in parallel programming platforms. The parallelized algorithm is dependent to the platform used and needs to be adapted for the optimum performance for each parallel platform. The paper shows the algorithms and the implementation process of the Gram –Schmidt vector orthogonalosation in three different parallel platforms. The three platforms are: a) control flow shared memory hardware systems with OpenMP, b) control flow distributed memory hardware systems with MPI and c) dataflow architecture systems using Maxeler Data Flow Engines hardware. Using as single running example a parallel implementation of the computation of the Gram –Schmidt vector orthogonalosation, this paper describes how the fundamentals of parallel programming, are dealt in these platforms. The paper puts into evidence the Maxeler implementation of the Gram–Schmidt algorithms compare to the traditional platforms. Paper treats the speedup and the overall performance of the three platforms versus sequential execution for 50-dimensional Euclidian space.
Authors and Affiliations
Genci Berati
Keywords
Related Articles
- EP ID EP111365
- DOI 10.14569/IJARAI.2015.040606
- Views 146
- Downloads 0
Improved Fuzzy C-Mean Algorithm for Image Segmentation
The segmentation of image is considered as a significant level in image processing system, in order to increase image processing system speed, so each stage in it must be speed reasonably. Fuzzy c-mean clustering i...
Image Clustering Method Based on Self Organization Mapping: SOM Derived Density Maps and Its Application for Landsat Thematic Mapper Image
A new method for image clustering with density maps derived from Self-Organizing Maps (SOM) is proposed together with a clarification of learning processes during a construction of clusters. Simulation studies and...
Differential Evolution Enhanced with Eager Random Search for Solving Real-Parameter Optimization Problems
Differential evolution (DE) presents a class of evo-lutionary computing techniques that appear effective to handle real parameter optimization tasks in many practical applications. However, the performance of DE is...
Clustering Web Documents based on Efficient Multi-Tire Hashing Algorithm for Mining Frequent Termsets
Document Clustering is one of the main themes in text mining. It refers to the process of grouping documents with similar contents or topics into clusters to improve both availability and reliability of text mining...
The Research of the Relationship between Perceived Stress Level and Times of Vibration of Vocal Folds
Whether a syllable is perceived as stressed or not and whether the stress is strong or weak are hot issues in speech prosody research and speech recognition. A focus of the stress study is on the investigation of the aco...