3/2013 - 19 | View TOC | « Previous Article | Next Article » |
Threads Pipelining on the CellBE SystemsTANASE, C. A. , GAITAN, V. G. |
Extra paper information in |
Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF (909 KB) | Citation | Downloads: 915 | Views: 3,574 |
Author keywords
Cell B.E., threads, PPU-SPU pipeline communication, flip-flop buffer, three level pipeline transfer
References keywords
parallel(13), cell(11), processing(5), engine(5), broadband(5), parallelism(4), computing(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2013-08-31
Volume 13, Issue 3, Year 2013, On page(s): 121 - 126
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2013.03019
Web of Science Accession Number: 000326321600019
SCOPUS ID: 84884919716
Abstract
This article aims to describe a model to accelerate the execution of a parallel algorithm implemented on a Cell B.E. processor. The algorithm implements a technique of finding a moving target in a maze with dynamic architecture, using another technique of pipelining the data transfers between the PPU and SPU threads. We have shown that by using the pipelining technique, we can achieve an improvement of the computing time (around 40%). It can be also seen that the pipelining technique with one SPU is about as good as the parallel technique with four SPUs. |
References | | | Cited By |
Web of Science® Times Cited: 3 [View]
View record in Web of Science® [View]
View Related Records® [View]
Updated 2 days, 6 hours ago
SCOPUS® Times Cited: 3
View record in SCOPUS® [Free preview]
View citations in SCOPUS® [Free preview]
[1] Intensive computing on a large data volume with a short‐vector single instruction multiple data processor, Ungurean, Ioan, Gaitan, Vasile‐Gheorghita, Gaitan, Nicoleta‐Cristina, IET Computers & Digital Techniques, ISSN 1751-8601, Issue 5, Volume 8, 2014.
Digital Object Identifier: 10.1049/iet-cdt.2013.0149 [CrossRef]
[2] Optimizing the Forward Algorithm for Hidden Markov Model on IBM Roadrunner clusters, SOIMAN, S.-I., RUSU, I., PENTIUC, S.-G., Advances in Electrical and Computer Engineering, ISSN 1582-7445, Issue 2, Volume 15, 2015.
Digital Object Identifier: 10.4316/AECE.2015.02013 [CrossRef] [Full text]
[3] Work, Span, and Parallelism of Transactional Memory Programs, Popovic, Miroslav, Kordic, Branislav, Basicevic, Ilija, 2015 4th Eastern European Regional Conference on the Engineering of Computer Based Systems, ISBN 978-1-4673-7967-0, 2015.
Digital Object Identifier: 10.1109/ECBS-EERC.2015.18 [CrossRef]
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Clarivate Analytics, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.