2012 |
Griebler, Dalvan Faculdade de Informática - PPGCC - PUCRS, 2012. @mastersthesis{GRIEBLER:DM:12, title = {Proposta de uma Linguagem Específica de Domínio de Programação Paralela Orientada a Padrões Paralelos: Um Estudo de Caso Baseado no Padrão Mestre/Escravo para Arquiteturas Multi-Core}, author = {Dalvan Griebler}, url = {http://tede.pucrs.br/tde_busca/arquivo.php?codArquivo=4265}, year = {2012}, date = {2012-03-01}, address = {Porto Alegre, Brazil}, school = {Faculdade de Informática - PPGCC - PUCRS}, abstract = {This work proposes a Domain-Specific Language for Parallel Patterns Oriented Parallel Programming (LED-PPOPP). Its main purpose is to provide a way to decrease the amount of effort necessary to develop parallel programs, offering a way to guide developers through patterns which are implemented by the language interface. The idea is to exploit this approach avoiding large performance losses in the applications. Patterns are specialized solutions, previously studied, and used to solve a frequent problem. Thus, parallel patterns offer a higher abstraction level to organize the algorithms in the exploitation of parallelism. They also can be easily learned by inexperienced programmers and software engineers. This work carried out a case study based on the Master/Slave pattern, focusing on the parallelization of algorithms for multi-core architectures. The implementation was validated through experiments to evaluate the programming effort to write code in LED-PPOPP and the performance achieved by the parallel code automatically generated. The obtained results let us conclude that a significant reduction in the parallel programming effort occurred in comparison to the Pthreads library utilization. Additionally, the final performance of the parallelized algorithms confirms that the parallelization with LED-PPOPP does not bring on significant losses related to parallelization using OpenMP in most of the all experiments carried out.}, keywords = {}, pubstate = {published}, tppubtype = {mastersthesis} } This work proposes a Domain-Specific Language for Parallel Patterns Oriented Parallel Programming (LED-PPOPP). Its main purpose is to provide a way to decrease the amount of effort necessary to develop parallel programs, offering a way to guide developers through patterns which are implemented by the language interface. The idea is to exploit this approach avoiding large performance losses in the applications. Patterns are specialized solutions, previously studied, and used to solve a frequent problem. Thus, parallel patterns offer a higher abstraction level to organize the algorithms in the exploitation of parallelism. They also can be easily learned by inexperienced programmers and software engineers. This work carried out a case study based on the Master/Slave pattern, focusing on the parallelization of algorithms for multi-core architectures. The implementation was validated through experiments to evaluate the programming effort to write code in LED-PPOPP and the performance achieved by the parallel code automatically generated. The obtained results let us conclude that a significant reduction in the parallel programming effort occurred in comparison to the Pthreads library utilization. Additionally, the final performance of the parallelized algorithms confirms that the parallelization with LED-PPOPP does not bring on significant losses related to parallelization using OpenMP in most of the all experiments carried out. |
Rui, Fernando Furlan Uma Avaliação Comparativa de Sistemas de Memória Transacional de Software e seus Benchmarks Masters Thesis PUCRS, 2012. @mastersthesis{RUI:DM:12, title = {Uma Avaliação Comparativa de Sistemas de Memória Transacional de Software e seus Benchmarks}, author = {Fernando Furlan Rui}, year = {2012}, date = {2012-01-01}, address = {Porto Alegre, Brazil}, school = {PUCRS}, keywords = {}, pubstate = {published}, tppubtype = {mastersthesis} } |
2011 |
Raeder, Mateus; Griebler, Dalvan; Ribeiro, Neumar; Fernandes, Luiz Gustavo; Castro, Márcio A Hybrid Parallel Version of ICTM for Cluster of NUMA Machines Inproceedings IADIS International Conference on Applied Computing (AC), pp. 291-298, IADIS Press, Rio de Janeiro, Brazil, 2011. @inproceedings{RAE11IADISAC, title = {A Hybrid Parallel Version of ICTM for Cluster of NUMA Machines}, author = {Mateus Raeder and Dalvan Griebler and Neumar Ribeiro and Luiz Gustavo Fernandes and Márcio Castro}, url = {https://gmap.pucrs.br/gmap/files/publications/articles/10e0005e546d980503ab1cfecdd8a559.pdf}, year = {2011}, date = {2011-11-01}, booktitle = {IADIS International Conference on Applied Computing (AC)}, pages = {291-298}, publisher = {IADIS Press}, address = {Rio de Janeiro, Brazil}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Raeder, Mateus; Griebler, Dalvan; Baldo, Lucas; Fernandes, Luiz G Performance Prediction of Parallel Applications with Parallel Patterns Using Stochastic Methods Inproceedings doi Sistemas Computacionais (WSCAD-SSC), XII Simpósio em Sistemas Computacionais de Alto Desempenho, pp. 1-13, IEEE, Espírito Santo, Brasil, 2011. @inproceedings{RAEDER:WSCAD:11, title = {Performance Prediction of Parallel Applications with Parallel Patterns Using Stochastic Methods}, author = {Mateus Raeder and Dalvan Griebler and Lucas Baldo and Luiz G. Fernandes}, url = {https://doi.org/10.1109/WSCAD-SSC.2011.18}, doi = {10.1109/WSCAD-SSC.2011.18}, year = {2011}, date = {2011-10-01}, booktitle = {Sistemas Computacionais (WSCAD-SSC), XII Simpósio em Sistemas Computacionais de Alto Desempenho}, pages = {1-13}, publisher = {IEEE}, address = {Espírito Santo, Brasil}, abstract = {One of the main problems in the high performance computing area is the difficulty to define the best strategy to parallelize an application. In this context, the use of analytical methods to evaluate the performance behavior of such applications seems to be an interesting alternative and can help to identify the best implementation strategies. In this work, the Stochastic Automata Network formalism is adopted to model and evaluate the performance of parallel applications, specially developed for clusters of workstations platforms. The methodology used is based on the construction of generic models to describe classical parallel implementation schemes, like Master/Slave, Parallel Phases, Pipeline and Divide and Conquer. Those models are adapted to represent cases of real applications through the definition of input parameters values. Finally, aiming to verify the accuracy of the adopted technique, some comparisons with real applications implementation results are presented.}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } One of the main problems in the high performance computing area is the difficulty to define the best strategy to parallelize an application. In this context, the use of analytical methods to evaluate the performance behavior of such applications seems to be an interesting alternative and can help to identify the best implementation strategies. In this work, the Stochastic Automata Network formalism is adopted to model and evaluate the performance of parallel applications, specially developed for clusters of workstations platforms. The methodology used is based on the construction of generic models to describe classical parallel implementation schemes, like Master/Slave, Parallel Phases, Pipeline and Divide and Conquer. Those models are adapted to represent cases of real applications through the definition of input parameters values. Finally, aiming to verify the accuracy of the adopted technique, some comparisons with real applications implementation results are presented. |
Fernandes, Luiz Gustavo; Nunes, Thiago; Kolberg, Mariana; Giannetti, Fabio; Nemetz, Rafael; Cabeda, Alexis Job Profiling and Queue Management in High Performance Printing Inproceedings doi Computer Science - Research and Development(CSRD), pp. 1-20, Springer Berlin Heidelberg, Secaucus, NJ, USA, 2011. @inproceedings{FER11CSRD, title = {Job Profiling and Queue Management in High Performance Printing}, author = {Luiz Gustavo Fernandes and Thiago Nunes and Mariana Kolberg and Fabio Giannetti and Rafael Nemetz and Alexis Cabeda}, doi = {10.1007/s00450-010-0134-0}, year = {2011}, date = {2011-05-01}, booktitle = {Computer Science - Research and Development(CSRD)}, pages = {1-20}, publisher = {Springer Berlin Heidelberg}, address = {Secaucus, NJ, USA}, keywords = {}, pubstate = {published}, tppubtype = {inproceedings} } |
Parallel Applications Modelling Group
GMAP is a research group at the Pontifical Catholic University of Rio Grande do Sul (PUCRS). Historically, the group has conducted several types of research on modeling and adapting robust, real-world applications from different domains (physics, mathematics, geology, image processing, biology, aerospace, and many others) to run efficiently on High-Performance Computing (HPC) architectures, such as Clusters.
In the last decade, new abstractions of parallelism are being created through domain-specific languages (DSLs), libraries, and frameworks for the next generation of computer algorithms and architectures, such as embedded hardware and servers with accelerators like Graphics Processing Units (GPUs) or Field-Programmable Gate Array (FPGAs). This has been applied to stream processing and data science-oriented applications. Concomitantly, since 2018, research is being conducted using artificial intelligence to optimize applications in the areas of Medicine, Ecology, Industry, Agriculture, Education, Smart Cities, and others.
Research Lines
Applied Data Science
Parallelism Abstractions
The research line HSPA (High-level and Structured Parallelism Abstractions) aims to create programming interfaces for the user/programmer who is not able in dealing with the parallel programming paradigm. The idea is to offer a higher level of abstraction, where the performance of applications is not compromised. The interfaces developed in this research line go toward specific domains that can later extend to other areas. The scope of the study is broad as regards the use of technologies for the development of the interface and parallelism.
Parallel Application Modeling
Team
Prof. Dr. Luiz Gustavo Leão Fernandes
General Coordinator
Prof. Dr. Dalvan Griebler
Research Coordinator
Last Papers
2012 |
Faculdade de Informática - PPGCC - PUCRS, 2012. |
Uma Avaliação Comparativa de Sistemas de Memória Transacional de Software e seus Benchmarks Masters Thesis PUCRS, 2012. |
2011 |
A Hybrid Parallel Version of ICTM for Cluster of NUMA Machines Inproceedings IADIS International Conference on Applied Computing (AC), pp. 291-298, IADIS Press, Rio de Janeiro, Brazil, 2011. |
Performance Prediction of Parallel Applications with Parallel Patterns Using Stochastic Methods Inproceedings doi Sistemas Computacionais (WSCAD-SSC), XII Simpósio em Sistemas Computacionais de Alto Desempenho, pp. 1-13, IEEE, Espírito Santo, Brasil, 2011. |
Job Profiling and Queue Management in High Performance Printing Inproceedings doi Computer Science - Research and Development(CSRD), pp. 1-20, Springer Berlin Heidelberg, Secaucus, NJ, USA, 2011. |
Projects
Software
Last News
Contact us!
Or, feel free to use the form below to contact us.