1. Ktisis Cyprus University of Technology
  2. Cyprus University of Technology (Research Output)
  3. Άρθρα/Articles
Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/2067
DC FieldValueLanguage
dc.contributor.authorHofmann, Marc-
dc.contributor.authorKontoghiorghes, Erricos John-
dc.contributor.otherΚοντογιώργης, Έρρικος Γιάννης-
dc.date.accessioned2013-01-28T12:50:17Zen
dc.date.accessioned2013-05-16T08:22:26Z-
dc.date.accessioned2015-12-02T09:37:36Z-
dc.date.available2013-01-28T12:50:17Zen
dc.date.available2013-05-16T08:22:26Z-
dc.date.available2015-12-02T09:37:36Z-
dc.date.issued2006-03-
dc.identifier.citationParallel Computing, 2006, vol. 32, no. 3, pp. 222-230en_US
dc.identifier.issn01678191-
dc.identifier.urihttps://hdl.handle.net/20.500.14279/2067-
dc.description.abstractParallel Givens sequences for computing the QR decomposition of an m × n (m > n) matrix are considered. The Givens rotations operate on adjacent planes. A pipeline strategy for updating the pair of elements in the affected rows of the matrix is employed. This allows a Givens rotation to use rows that have been partially updated by previous rotations. Two new Givens schemes, based on this pipeline approach, and requiring respectively n 2/2 and n processors, are developed. Within this context a performance analysis on an exclusive-read, exclusive-write (EREW) parallel random access machine (PRAM) computational model establishes that the proposed schemes are twice as efficient as existing Givens sequences.en_US
dc.formatpdfen_US
dc.language.isoenen_US
dc.relation.ispartofParallel Computingen_US
dc.rights© Elsevieren_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectParallel algorithmsen_US
dc.subjectAlgebraen_US
dc.subjectRandom access memoryen_US
dc.titlePipeline givens sequences for computing the qr decomposition on a erew pramen_US
dc.typeArticleen_US
dc.collaborationUniversity of Cyprusen_US
dc.collaborationBirkbeck University of Londonen_US
dc.subject.categoryComputer and Information Sciencesen_US
dc.journalsOpen Accessen_US
dc.countryGreeceen_US
dc.subject.fieldNatural Sciencesen_US
dc.publicationPeer Revieweden_US
dc.identifier.doi10.1016/j.parco.2005.11.001en_US
dc.dept.handle123456789/54en
dc.relation.issue3en_US
dc.relation.volume32en_US
cut.common.academicyear2006-2007en_US
dc.identifier.spage222en_US
dc.identifier.epage230en_US
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.openairetypearticle-
item.languageiso639-1en-
crisitem.journal.journalissn0167-8191-
crisitem.journal.publisherElsevier-
crisitem.author.deptDepartment of Finance, Accounting and Management Science-
crisitem.author.facultyFaculty of Tourism Management, Hospitality and Entrepreneurship-
crisitem.author.orcid0000-0001-9704-9510-
crisitem.author.parentorgFaculty of Management and Economics-
Appears in Collections:Άρθρα/Articles
CORE Recommender
Show simple item record

SCOPUSTM   
Citations

12
checked on Nov 9, 2023

WEB OF SCIENCETM
Citations 50

7
Last Week
0
Last month
0
checked on Oct 29, 2023

Page view(s) 10

497
Last Week
2
Last month
14
checked on May 11, 2024

Google ScholarTM

Check

Altmetric


This item is licensed under a Creative Commons License Creative Commons