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 157
- Downloads 0
Gesture Controlled Robot using Image Processing
Service robots directly interact with people, so finding a more natural and easy user interface is of fundamental importance. While earlier works have focused primarily on issues such as manipulation and navigation...
Optimisation of Resource Scheduling in VCIM Systems Using Genetic Algorithm
The concept of Virtual Computer-Integrated Manufacturing (VCIM) has been proposed for one and a half decade with purpose of overcoming the limitation of traditional Computer-Integrated Manufacturing (CIM) as it only work...
Analysis of Gumbel Model for Software Reliability Using Bayesian Paradigm
In this paper, we have illustrated the suitability of Gumbel Model for software reliability data. The model parameters are estimated using likelihood based inferential procedure: classical as well as Bayesian. The quasi...
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...
Method for Learning Effciency Improvements Based on Gaze Location Notifications on e-learning Content Screen Display
Method for learning efficiency improvement based on gaze notifications on e-learning content screen display is proposed. Experimental results with e-learning two types of contents (Relatively small motion of e-learning c...