Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > On pipelining sequences of data-dependent loops
Publication

Publications

On pipelining sequences of data-dependent loops

Title
On pipelining sequences of data-dependent loops
Type
Article in International Scientific Journal
Year
2007
Authors
Rui M. M. Rodrigues
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 13 No. 3
Pages: 419-439
ISSN: 0948-695X
Indexing
Scientific classification
FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering
CORDIS: Technological sciences > Engineering > Computer engineering
Other information
Authenticus ID: P-007-HJZ
Abstract (EN): Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually perform computations (with loop intensive behavior) and produce new data to be consumed by subsequent tasks. This paper shows a scheme to pipeline sequences of data-dependent loops, in such a way that subsequent loops can start execution before the completion of the previous ones, which achieves performance improvements. It uses a hardware scheme with decoupled and concurrent data-path and control units that start execution at the same time. The communication of array elements between two loops in sequence is performed by special buffers with a data-driven, fine-grained scheme. Buffer elements are responsible to flag the availability of each array element requested by a subsequent loop (i.e., a ready protocol is used to trigger the execution of operations in the succeeding loop). Thus, the control execution of following loops is also orchestrated by data availability (in this case at the array element grain) and out-of-order produced-consumed pairs are permitted. The concept has been applied using Nau, a compiler infrastructure to map algorithms described in Java onto FPGAs. This paper presents very encouraging results showing important performance improvements and buffer size reductions for a number of benchmarks.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 21
Documents
We could not find any documents associated to the publication with allowed access.
Related Publications

Of the same journal

Selected papers from SBLP 2007: The 11th Brazilian Symposium on Programming Languages J.UCS special issue (2007)
Another Publication in an International Scientific Journal
Bigonha, RS; Musicante, MA; Pardo, A; Garcia, A; Martini, A; Moreira, AF; De Melo, ACV; Du Bois, AR; Santos, A; Camarao, C; Rubira, C; Braga, C; Naumann, D; Haeusler, EH; De Carvalho Junior, FH; Cafezeiro, I; Palsberg, J; Jeuring, J; Saraiva, J; Guimaraes, J...(mais 24 authors)
Performance Management in Collaborative Networks: a Methodological Proposal (2011)
Article in International Scientific Journal
Ferreira, RP; Silva, JN; Strauhs, FDR; António Lucas Soares
Orchestration of E-Learning Services for Automatic Evaluation of Programming Exercises (2012)
Article in International Scientific Journal
Ricardo Queiros; Jose Paulo Leal
Learning decision trees from dynamic data streams (2005)
Article in International Scientific Journal
João Gama; Pedro Medas
HC plus : Towards a Framework for Improving Processes in Health Organizations by Means of Security and Data Quality Management (2012)
Article in International Scientific Journal
Caballero, I; Enrique Sanchez, LE; Freitas A; Fernandez Medina, E

See all (8)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-22 at 12:37:40 | Privacy Policy | Personal Data Protection Policy | Whistleblowing