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.

An Inspector-Executor Algorithm for Irregular Assignment Parallelization

Thumbnail
View/Open
M.Arenaz_An_Inspector-Executor_Algorithm_for_Irregular_Assignment_Parallelization_2004.pdf (763.6Kb)
Use this link to cite
http://hdl.handle.net/2183/22436
Collections
  • GI-GAC - Congresos, conferencias, etc. [46]
Metadata
Show full item record
Title
An Inspector-Executor Algorithm for Irregular Assignment Parallelization
Author(s)
Arenaz Silva, Manuel
Touriño, Juan
Doallo, Ramón
Date
2004
Citation
Arenaz M., Touriño J., Doallo R. (2004) An Inspector-Executor Algorithm for Irregular Assignment Parallelization. In: Cao J., Yang L.T., Guo M., Lau F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg
Abstract
[Abstract] A loop with irregular assignment computations contains loop-carried output data dependences that can only be detected at run-time. In this paper, a load-balanced method based on the inspector-executor model is proposed to parallelize this loop pattern. The basic idea lies in splitting the iteration space of the sequential loop into sets of conflict-free iterations that can be executed concurrently on different processors. As will be demonstrated, this method outperforms existing techniques. Irregular access patterns with different load-balancing and reusability properties are considered in the experiments.
Keywords
Sequential loop
Algorithm
 
Description
This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science. The final authenticated version is available online at: https://doi.org/10.1007/978-3-540-30566-8_4
Editor version
https://doi.org/10.1007/978-3-540-30566-8_4
ISSN
0302-9743
1611-3349
 
ISBN
978-3-540-24128-7
 
978-3-540-30566-8
 

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