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...

Descripción completa

Guardado en:
Detalles Bibliográficos
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