• español
  • English
  • français
  • Deutsch
  • português (Brasil)
  • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Navegar

    Todo o repositórioComunidadesPor data do documentoAutoresAssuntosTítulos

    Minha conta

    Entrar

    Estatística

    Ver as estatísticas de uso

    Compartir

    Ver item 
    •   Página inicial
    • PRODUÇÃO CIENTÍFICA
    • Departamentos
    • Dpto. Informática (Arquitectura y Tecnología de Computadores, Ciencias de la Computación e Inteligencia ...)
    • DEP41 - Comunicaciones a congresos, conferencias, etc.
    • Ver item
    •   Página inicial
    • PRODUÇÃO CIENTÍFICA
    • Departamentos
    • Dpto. Informática (Arquitectura y Tecnología de Computadores, Ciencias de la Computación e Inteligencia ...)
    • DEP41 - Comunicaciones a congresos, conferencias, etc.
    • Ver item
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano

    Exportar

    RISMendeleyRefworksZotero
    • edm
    • marc
    • xoai
    • qdc
    • ore
    • ese
    • dim
    • uketd_dc
    • oai_dc
    • etdms
    • rdf
    • mods
    • mets
    • didl
    • premis

    Citas

    Por favor, use este identificador para citar o enlazar este ítem:https://uvadoc.uva.es/handle/10324/75869

    Título
    Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
    Autor
    Cintra, Marcelo
    Llanos Ferraris, Diego RafaelAutoridad UVA Orcid
    Palop del Río, BelénAutoridad UVA Orcid
    Congreso
    International Conference on Computational Science and Its Applications, ICCSA 2004
    Año del Documento
    2004
    Editorial
    Springer
    Descripción Física
    10 p.
    Descripción
    Producción Científica
    Documento Fuente
    International Conference on Computational Science and Its Applications (ICCSA 2004), Perugia, Italy.
    Resumo
    Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the development of complex data structures or hard to implement algorithms. Randomized algorithms appear in this scenario as a very useful tool in order to obtain easier implementations within a good expected time bound. However, parallel implementations of these algorithms are hard to develop and require an in-depth understanding of the language, the compiler and the underlying parallel computer architecture. In this paper we show how we can use speculative parallelization techniques to execute in parallel iterative algorithms such as randomized incremental constructions. In this paper we focus on the convex hull problem, and show that, using our speculative parallelization engine, the sequential algorithm can be automatically executed in parallel, obtaining speedups with as little as four processors, and reaching 5.15x speedup with 28 processors.
    Materias (normalizadas)
    Informática
    Materias Unesco
    1203 Ciencia de Los Ordenadores
    3304 Tecnología de Los Ordenadores
    DOI
    10.1007/978-3-540-24767-8_20
    Version del Editor
    https://link.springer.com/chapter/10.1007/978-3-540-24767-8_20
    Idioma
    eng
    URI
    https://uvadoc.uva.es/handle/10324/75869
    Tipo de versión
    info:eu-repo/semantics/publishedVersion
    Derechos
    openAccess
    Aparece en las colecciones
    • DEP41 - Comunicaciones a congresos, conferencias, etc. [101]
    Mostrar registro completo
    Arquivos deste item
    Nombre:
    Speculative_Parallelization_of_a_Randomized_Increm.pdf
    Tamaño:
    322.0Kb
    Formato:
    Adobe PDF
    Thumbnail
    Visualizar/Abrir

    Universidad de Valladolid

    Powered by MIT's. DSpace software, Version 5.10