Skip navigation
  •  Home
  • UDC 
    • Getting started
    • RUC Policies
    • FAQ
    • FAQ on Copyright
    • More information at INFOguias UDC
  • Browse 
    • Communities
    • Browse by:
    • Issue Date
    • Author
    • Title
    • Subject
  • Help
    • español
    • Gallegan
    • English
  • Login
  •  English 
    • Español
    • Galego
    • English
  
View Item 
  •   DSpace Home
  • 1. Investigación
  • Grupos de investigación
  • Grupo de Arquitectura de Computadores (GAC)
  • GI-GAC - Congresos, conferencias, etc.
  • View Item
  •   DSpace Home
  • 1. Investigación
  • Grupos de investigación
  • Grupo de Arquitectura de Computadores (GAC)
  • GI-GAC - Congresos, conferencias, etc.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Compiler support for parallel code generation through kernel recognition

Thumbnail
View/Open
M.Arenaz_2004_Compiler_Support_for_Parallel_Code_Generation_through_Kernel_Recognition.pdf (311.6Kb)
Use this link to cite
http://hdl.handle.net/2183/23358
Collections
  • GI-GAC - Congresos, conferencias, etc. [36]
Metadata
Show full item record
Title
Compiler support for parallel code generation through kernel recognition
Author(s)
Arenaz Silva, Manuel
Touriño, Juan
Doallo Biempica, Ramón
Date
2004-06-07
Citation
M. Arenaz, J. Tourino and R. Doallo, "Compiler support for parallel code generation through kernel recognition," 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., Santa Fe, NM, USA, 2004, pp. 79-.
Abstract
[Abstract] Summary form only given. The automatic parallelization of loops that contain complex computations is still a challenge for current parallelizing compilers. The main limitations are related to the analysis of expressions that contain subscripted subscripts, and the analysis of conditional statements that introduce complex control flows at run-time. We use the term complex loop to designate loops with such characteristics. We describe the parallelization of sequential complex loop nests using a generic compiler framework (proposed in an earlier paper [Arenaz et al., ICS'2003] ) that accomplishes kernel recognition through the analysis of the gated single assignment program representation. Specifically, we focus on an extension of this framework that enables its use as a powerful tool for gathering source code information that is relevant for the parallelization of each computational kernel. A set of example codes are analyzed in detail to illustrate the potential of our approach. Experimental results using a benchmark suite of complex loop nests are also presented.
Keywords
Kernel
Concurrent computing
Distributed computing
Automatic control
Runtime
Program processors
Information analysis
Data mining
Uncertainty
Classification algorithms
 
Editor version
http://dx.doi.org/10.1109/IPDPS.2004.1303015
Rights
This is a post-peer-review, pre-copyedit version. The final authenticated version is available online at: http://dx.doi.org/10.1109/IPDPS.2004.1303015
ISBN
0-7695-2132-0

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

View Usage Statistics
Sherpa
OpenArchives
OAIster
Scholar Google
UNIVERSIDADE DA CORUÑA. Servizo de Biblioteca.    DSpace Software Copyright © 2002-2013 Duraspace - Send Feedback