Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/14722
Title: Improving the performance of optimum parallel algorithms on SIMD array processors: Programming techniques and methods
Authors: Kontoghiorghes, Erricos John 
Clarke, M. R.B. 
Balou, A. T. 
metadata.dc.contributor.other: Κοντογιώργης, Ερρίκος
Major Field of Science: Social Sciences
Field Category: Economics and Business
Keywords: Algorithms;Parallel processing systems
Issue Date: 1993
Source: Proceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control aand Power Engineering. Part 3 (of 5); Beijing, China; ; 19 October 1993 through 21 October 1993; Code 20220
Conference: Proceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control aand Power Engineering. Part 3 
Abstract: In this paper we describe parallel programming techniques and methods applied to the implementation of two parallel algorithms on a SIMD array processor. These programming techniques and methods can be employed to parallel numerical algorithms for improving their performance efficiency. First were implemented the column sweep algorithm to solve a lower triangular system of linear equations and then we implemented an algorithm based on Given's rotations for reducing a rectangular matrix into lower triangular form. The estimated execution time of all algorithms has been obtained and analyzed.
URI: https://hdl.handle.net/20.500.14279/14722
ISBN: 0780312333
ISSN: 2-s2.0-0027726740
https://api.elsevier.com/content/abstract/scopus_id/0027726740
Rights: IEEE,Piscataway
Type: Conference Papers
Affiliation : Queen Mary and Westfield College 
Publication Type: Peer Reviewed
Appears in Collections:Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation

CORE Recommender
Show full item record

Page view(s) 5

393
Last Week
1
Last month
2
checked on Nov 21, 2024

Google ScholarTM

Check

Altmetric


Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.