Parallel asynchronous modelization and execution of cholesky algorithm using petri nets
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...
Guardado en:
Autores principales: | Wolfmann, Gustavo, De Giusti, Armando |
---|---|
Formato: | conferenceObject |
Lenguaje: | Inglés |
Publicado: |
2022
|
Materias: | |
Acceso en línea: | http://hdl.handle.net/11086/28080 |
Aporte de: |
Ejemplares similares
-
The PN-PEM framework: a Petri Net based parallel execution model
por: Wolfmann, Aaron Gustavo Horacio, et al.
Publicado: (2015) -
Studying the parallel task scheduling problem with conventional and evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2001) -
Optimización de cómputo paralelo científico en un entorno híbrido Multicore - MultiGPU
por: Wolfmann, Aaron Gustavo Horacio
Publicado: (2012) -
Algorithm model and execution based on Petri Nets in an heterogeneous parallel computer
por: Wolfmann, Gustavo, et al.
Publicado: (2022) -
A multirecombinative evolutionary approach to solve the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)