This paper presents PIT, a library for the parallelization of irregular problems on distributed memory architectures. All the strategies underlying the definition of the library can be expressed in terms of operations on a PITree, a parallel version of the tree data structure oriented to irregular problems. We consider the application of PIT to two well known irregular problems: adaptive multigrid and hierarchical radiosity methods. Performance figures that prove the effectiveness of PIT are presented.
Titolo: | Solving Irregular Problems through Parallel Irregular Trees |
Autori interni: | |
Anno del prodotto: | 2005 |
Abstract: | This paper presents PIT, a library for the parallelization of irregular problems on distributed memory architectures. All the strategies underlying the definition of the library can be expressed in terms of operations on a PITree, a parallel version of the tree data structure oriented to irregular problems. We consider the application of PIT to two well known irregular problems: adaptive multigrid and hierarchical radiosity methods. Performance figures that prove the effectiveness of PIT are presented. |
Handle: | http://hdl.handle.net/11568/186867 |
ISBN: | 0889864683 |
Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.