Parallel asynchronous modelization and execution of cholesky algorithm using petri nets

Autores
Wolfmann, Gustavo; De Giusti, Armando
Año de publicación
2013
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Fil: Wolfmann, Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Laboratorio de Computacion; Argentina.
Fil: De Giusti, Armando. Universidad Nacional de La Plata. Facultad de Informática; Argentina.
Parallelization of algorithms with hard data dependency has a need of task synchronization. Synchronous parallel versions are simple to model and program, but inefficient in terms of scalability and processors use rate. The same problem for Asynchronous versions with elemental static task scheduling. Efficient Asynchronous algorithms implement out-of-order execution and are complex to model and execute. In this paper we introduce Petri Nets as a tool for simplifying the modeling and execution of parallel asynchronous versions of this kind of algorithms, while using an efficient dynamic task scheduling implementation. The Cholesky factorization algorithm was used as testbed. Simulations were carried out as a proof of concept, based on real execution times on GPGPU’s, and haveshown excellent performances.
http://world-comp.org/proc2013/pdpta.html
Fil: Wolfmann, Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Laboratorio de Computacion; Argentina.
Fil: De Giusti, Armando. Universidad Nacional de La Plata. Facultad de Informática; Argentina.
Ciencias de la Computación
Materia
Asynchronous Parallel Execution
Dynamic Task Scheduling
GPGPU’s
Nivel de accesibilidad
acceso abierto
Condiciones de uso
Repositorio
Repositorio Digital Universitario (UNC)
Institución
Universidad Nacional de Córdoba
OAI Identificador
oai:rdu.unc.edu.ar:11086/28080
Acceder
id RDUUNC_6bcb34bdf481ef2c28940b1a2c8d7373
oai_identifier_str oai:rdu.unc.edu.ar:11086/28080
network_acronym_str RDUUNC
repository_id_str 2572
network_name_str Repositorio Digital Universitario (UNC)
spelling Parallel asynchronous modelization and execution of cholesky algorithm using petri netsWolfmann, GustavoDe Giusti, ArmandoAsynchronous Parallel ExecutionDynamic Task SchedulingGPGPU’sFil: Wolfmann, Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Laboratorio de Computacion; Argentina.Fil: De Giusti, Armando. Universidad Nacional de La Plata. Facultad de Informática; Argentina.Parallelization of algorithms with hard data dependency has a need of task synchronization. Synchronous parallel versions are simple to model and program, but inefficient in terms of scalability and processors use rate. The same problem for Asynchronous versions with elemental static task scheduling. Efficient Asynchronous algorithms implement out-of-order execution and are complex to model and execute. In this paper we introduce Petri Nets as a tool for simplifying the modeling and execution of parallel asynchronous versions of this kind of algorithms, while using an efficient dynamic task scheduling implementation. The Cholesky factorization algorithm was used as testbed. Simulations were carried out as a proof of concept, based on real execution times on GPGPU’s, and haveshown excellent performances.http://world-comp.org/proc2013/pdpta.htmlFil: Wolfmann, Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Laboratorio de Computacion; Argentina.Fil: De Giusti, Armando. Universidad Nacional de La Plata. Facultad de Informática; Argentina.Ciencias de la Computación2013info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1-60132-258-5http://hdl.handle.net/11086/28080enginfo:eu-repo/semantics/openAccessreponame:Repositorio Digital Universitario (UNC)instname:Universidad Nacional de Córdobainstacron:UNC2025-09-29T13:42:50Zoai:rdu.unc.edu.ar:11086/28080Institucionalhttps://rdu.unc.edu.ar/Universidad públicaNo correspondehttp://rdu.unc.edu.ar/oai/snrdoca.unc@gmail.comArgentinaNo correspondeNo correspondeNo correspondeopendoar:25722025-09-29 13:42:50.388Repositorio Digital Universitario (UNC) - Universidad Nacional de Córdobafalse
dc.title.none.fl_str_mv Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
title Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
spellingShingle Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
Wolfmann, Gustavo
Asynchronous Parallel Execution
Dynamic Task Scheduling
GPGPU’s
title_short Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
title_full Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
title_fullStr Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
title_full_unstemmed Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
title_sort Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
dc.creator.none.fl_str_mv Wolfmann, Gustavo
De Giusti, Armando
author Wolfmann, Gustavo
author_facet Wolfmann, Gustavo
De Giusti, Armando
author_role author
author2 De Giusti, Armando
author2_role author
dc.subject.none.fl_str_mv Asynchronous Parallel Execution
Dynamic Task Scheduling
GPGPU’s
topic Asynchronous Parallel Execution
Dynamic Task Scheduling
GPGPU’s
dc.description.none.fl_txt_mv Fil: Wolfmann, Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Laboratorio de Computacion; Argentina.
Fil: De Giusti, Armando. Universidad Nacional de La Plata. Facultad de Informática; Argentina.
Parallelization of algorithms with hard data dependency has a need of task synchronization. Synchronous parallel versions are simple to model and program, but inefficient in terms of scalability and processors use rate. The same problem for Asynchronous versions with elemental static task scheduling. Efficient Asynchronous algorithms implement out-of-order execution and are complex to model and execute. In this paper we introduce Petri Nets as a tool for simplifying the modeling and execution of parallel asynchronous versions of this kind of algorithms, while using an efficient dynamic task scheduling implementation. The Cholesky factorization algorithm was used as testbed. Simulations were carried out as a proof of concept, based on real execution times on GPGPU’s, and haveshown excellent performances.
http://world-comp.org/proc2013/pdpta.html
Fil: Wolfmann, Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Laboratorio de Computacion; Argentina.
Fil: De Giusti, Armando. Universidad Nacional de La Plata. Facultad de Informática; Argentina.
Ciencias de la Computación
description Fil: Wolfmann, Gustavo. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Laboratorio de Computacion; Argentina.
publishDate 2013
dc.date.none.fl_str_mv 2013
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv 1-60132-258-5
http://hdl.handle.net/11086/28080
identifier_str_mv 1-60132-258-5
url http://hdl.handle.net/11086/28080
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositorio Digital Universitario (UNC)
instname:Universidad Nacional de Córdoba
instacron:UNC
reponame_str Repositorio Digital Universitario (UNC)
collection Repositorio Digital Universitario (UNC)
instname_str Universidad Nacional de Córdoba
instacron_str UNC
institution UNC
repository.name.fl_str_mv Repositorio Digital Universitario (UNC) - Universidad Nacional de Córdoba
repository.mail.fl_str_mv oca.unc@gmail.com
_version_ 1844618937753403392
score 13.070432

Publicaciones similares