G
Gerson Geraldo H. Cavalheiro
Researcher at Universidade Federal de Pelotas
Publications - 64
Citations - 305
Gerson Geraldo H. Cavalheiro is an academic researcher from Universidade Federal de Pelotas. The author has contributed to research in topics: Scheduling (computing) & Computer science. The author has an hindex of 8, co-authored 57 publications receiving 291 citations. Previous affiliations of Gerson Geraldo H. Cavalheiro include Universidade do Vale do Rio dos Sinos & Universidade Federal do Rio Grande do Sul.
Papers
More filters
Proceedings ArticleDOI
Athapascan-1: On-line building data flow graph in a parallel language
TL;DR: This work introduces a language named Athapascan-1 that allows to build a graph of dependencies from a strong typing of shared memory accesses and shows that such a data dependency graph can be computed on-line on a distributed architecture.
Journal ArticleDOI
Towards Merging Context-Aware, Mobile and Grid Computing
Adenauer Yamin,Jorge Luis Victória Barbosa,Iara Augustin,Luciano Cavalheiro da Silva,Rodrigo Real,Cláudio F. R. Geyer,Gerson Geraldo H. Cavalheiro +6 more
TL;DR: The main components used to implement the ISAM features are discussed, and a distributed application is presented that explores some of this features.
ISAM, Joining Context-Awareness and Mobility to Building Pervasive Applications.
Iara Augustin,Adenauer Yamin,Jorge Luis Victória Barbosa,Luciano Cavalheiro da Silva,Rodrigo Real,Gustavo Cestari Frainer,Gerson Geraldo H. Cavalheiro,Cláudio F. R. Geyer +7 more
Proceedings ArticleDOI
Towards a flexible security framework for peer-to-peer based grid computing
TL;DR: This paper proposes P2PSLF (Peer-to-Peer Security Layer Framework), a flexible security framework for peer- to-peer based grid computing that provides a wide range of security mechanisms, and allows the creation of new ones.
Journal ArticleDOI
An efficient parallel algorithm to evolve simulations of the cellular potts model
TL;DR: The Random Walker algorithm is introduced that is a modified Monte Carlo procedure of simpler parallelization that is tested in cell sorting and foam coarsening simulations obtaining velocity increase factors of 10 and 3 times, respectively, in relation to the standard algorithm.