Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/2067| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hofmann, Marc | - |
| dc.contributor.author | Kontoghiorghes, Erricos John | - |
| dc.contributor.other | Κοντογιώργης, Έρρικος Γιάννης | - |
| dc.date.accessioned | 2013-01-28T12:50:17Z | en |
| dc.date.accessioned | 2013-05-16T08:22:26Z | - |
| dc.date.accessioned | 2015-12-02T09:37:36Z | - |
| dc.date.available | 2013-01-28T12:50:17Z | en |
| dc.date.available | 2013-05-16T08:22:26Z | - |
| dc.date.available | 2015-12-02T09:37:36Z | - |
| dc.date.issued | 2006-03 | - |
| dc.identifier.citation | Parallel Computing, 2006, vol. 32, no. 3, pp. 222-230 | en_US |
| dc.identifier.issn | 01678191 | - |
| dc.identifier.uri | https://hdl.handle.net/20.500.14279/2067 | - |
| dc.description.abstract | Parallel 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.format | en_US | |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | Parallel Computing | en_US |
| dc.rights | © Elsevier | en_US |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
| dc.subject | Parallel algorithms | en_US |
| dc.subject | Algebra | en_US |
| dc.subject | Random access memory | en_US |
| dc.title | Pipeline givens sequences for computing the qr decomposition on a erew pram | en_US |
| dc.type | Article | en_US |
| dc.collaboration | University of Cyprus | en_US |
| dc.collaboration | Birkbeck University of London | en_US |
| dc.subject.category | Computer and Information Sciences | en_US |
| dc.journals | Open Access | en_US |
| dc.country | Greece | en_US |
| dc.subject.field | Natural Sciences | en_US |
| dc.publication | Peer Reviewed | en_US |
| dc.identifier.doi | 10.1016/j.parco.2005.11.001 | en_US |
| dc.dept.handle | 123456789/54 | en |
| dc.relation.issue | 3 | en_US |
| dc.relation.volume | 32 | en_US |
| cut.common.academicyear | 2006-2007 | en_US |
| dc.identifier.spage | 222 | en_US |
| dc.identifier.epage | 230 | en_US |
| item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
| item.openairetype | article | - |
| item.cerifentitytype | Publications | - |
| item.grantfulltext | none | - |
| item.languageiso639-1 | en | - |
| item.fulltext | No Fulltext | - |
| crisitem.journal.journalissn | 0167-8191 | - |
| crisitem.journal.publisher | Elsevier | - |
| crisitem.author.dept | Department of Finance, Accounting and Management Science | - |
| crisitem.author.faculty | Faculty of Tourism Management, Hospitality and Entrepreneurship | - |
| crisitem.author.orcid | 0000-0001-9704-9510 | - |
| crisitem.author.parentorg | Faculty of Management and Economics | - |
| Appears in Collections: | Άρθρα/Articles | |
CORE Recommender
SCOPUSTM
Citations
12
checked on Nov 9, 2023
WEB OF SCIENCETM
Citations
50
7
Last Week
0
0
Last month
0
0
checked on Oct 29, 2023
Page view(s)
541
Last Week
0
0
Last month
9
9
checked on Nov 23, 2024
Google ScholarTM
Check
Altmetric
This item is licensed under a Creative Commons License
