Gram–Schmidt Process in Different Parallel Platforms

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

Genetic Programming for Document Segmentation and Region Classification Using Discipulus

Document segmentation is a method of rending the document into distinct regions. A document is an assortment of information and a standard mode of conveying information to others. Pursuance of data from documents involve...

 Brainstorming Versus Arguments Structuring in Online Forums

 We characterize electronic discussion forums as being of one of the following two types: Brainstorming Forums and Arguments Structuring Forums. In this work we analyze and classify the types of threading models occ...

 Thresholding Based Method for Rainy Cloud Detection with NOAA/AVHRR Data by Means of Jacobi Itteration Method

 Thresholding based method for rainy cloud detection with NOAA/AVHRR data by means of Jacobi iteration method is proposed. Attempts of the proposed method are made through comparisons to truth data which are provide...

 The Mobile Version of the Predicted Energy Efficient Bee-Inspired Routing (PEEBR)

 In this paper, the previously proposed Predictive Energy Efficient Bee-inspired Routing (PEEBR) family of routing optimization algorithms based on the Artificial Bees Colony (ABC) Optimization model is extended fro...

Method for 3D Object Reconstruction Using Several Portion of 2D Images from the Different Aspects Acquired with Image Scopes Included in the Fiber Retractor

Method for 3D object reconstruction using several portions of 2D images from the different aspects which are acquired with image scopes included in the fiber retractor is proposed. Experimental results show a great possi...

Download PDF file
  • EP ID EP111365
  • DOI 10.14569/IJARAI.2015.040606
  • Views 151
  • Downloads 0

How To Cite

Genci Berati (2015).  Gram–Schmidt Process in Different Parallel Platforms. International Journal of Advanced Research in Artificial Intelligence(IJARAI), 4(6), 35-39. https://europub.co.uk/articles/-A-111365