Cookies
Usamos cookies para melhorar nosso site e a sua experiência. Ao continuar a navegar no site, você aceita a nossa política de cookies. Ver mais
Fechar
  • Menu
Sobre

Sobre

Luís Paulo Peixoto dos Santos é actualmente Professor Auxiliar do Departamento de Informática, Universidade do Minho e investigador do CSIG, INESC-TEC. A sua área de investigação é a Iluminação Global, com especial ênfase no desempenho dos algortimos e o recurso à Computação Paralela Heterogénea (CPU + GPU + Knights Landing) para diminuir o tempo de convergência para soluções perceptualmente correctas. Publicou algumas dezenas de artigos nos mais prestigiados fóruns internacionais (conferências e revistas) desta área do cohecimento, sendo tambem autor de um livro em Bayesian Monte Carlo Rendering. Integra a Comissão de Programa de várias conferências internacionais, tendo presidido a algumas destas comissões e organizado 6 conferências em Portugal.

Foi Vice-Director do Departamento de Informática, Vice-Director da Licenciatura em Engenharia Informática, bem como do Mestrado em Engenhraia Informática. Foi Director do Programa Doutoral em Engenharia Informática. Integrou a Comissão designada por iniciativa reitoral para coordenar a instalação da Unidade Operacional em Governação Electrónica da Universidade das Nações Unidas em Portugal, especificamente no Campus de Couros da Universidade do Minho, Guimarães, integrando actualmente o corpo directivo da unidade EGOV-UM que assegura o interface entre as duas instituições.  

É Editor Associado da revista Computers & Graphics e Presidente da Direcção do Grupo Português de Computação Gráfica (secção portuguesa da Eurographics) para o biénio 2017-2018.

Tópicos
de interesse
Detalhes

Detalhes

  • Nome

    Luís Paulo Santos
  • Cluster

    Informática
  • Cargo

    Investigador Afiliado
  • Desde

    01 janeiro 2017
Publicações

2018

Communities of Practice as a tool to support the GCIO function

Autores
Santos, LP; Barbosa, LN; Bessa, DA; Martins, LP; Barbosa, LS;

Publicação
Proceedings of the 11th International Conference on Theory and Practice of Electronic Governance, ICEGOV 2018, Galway, Ireland, April 04-06, 2018

Abstract
A Community of Practice (CoP) allows practitioners of a clearly defined domain to share knowledge, experience, and best practices. It provides a social context for practitioners, often distributed across multiple organizations, and emerged over the last few decades as a fundamental mechanism for knowledge sharing, management, and generation within organizations. Best practices, innovations, and solutions to shared problems first emerge within CoPs. These are, and must be perceived as, an investment in organizations' future and competitiveness. Establishing a CoP is a straightforward process, the most challenging factor being the recruitment of members to attain critical mass. The challenge is to maintain the CoP active, with members contributing with high quality, innovative content. Increasing a CoP's medium / long-term survival probabilities requires careful planning to avoid incurring in some well-known pitfalls. This paper proposes and discusses a set of nine guidelines for establishing and maintaining a community of practice within the context of Electronic Governance (EGOV) and Government Chief Information Officers (GCIO). This research was motivated by the initiative of the government of a developing country. Results are based on a review of the relevant literature, together with the detailed analysis of interviews to members or coordinators of large communities of practice. This analysis was further validated against the opinions of public servants directly involved on EGOV-GCIO-related functions during two focus groups meetings. © 2018 Association for Computing Machinery.

2018

Run-time heterogeneous-aware power-adaptive scheduling in OpenFOAM

Autores
Ribeiro, R; Santos, LP; Nobrega, JM;

Publicação
PROCEEDINGS 2018 INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING & SIMULATION (HPCS)

Abstract
Computer-aided engineering simulations, in particular, Computational Fluid Dynamics, have become a fundamental design and analysis tool in product development. Over time, a demand for larger problem sizes and higher accuracy has led to huge computational workloads requiring extended compute capabilities. Increasing computing capabilities requirements, however, drive a fast-growing power consumption. In order to deal with increasing power demand, hardware and software solutions' reevaluation in terms of power-efficiency becomes of paramount importance. Establishing a power budget and reducing the compute units operating frequency in order to comply with such budget is becoming common practice. However, in the presence of heterogeneous compute units and dynamic workloads, a static and uniform reduction across compute units leads to a potentially severe impact on performance. This paper proposes a run-time heterogeneity-aware power-adaptive schedule that provides power consumption optimization, targeting heterogeneous parallel distributed systems in the context of CFD simulations. The proposed approach is integrated into OpenFOAM computational library and explores power migration and reduction across nodes, considering runtime workload imbalances and node performances. Results reveal not only a substantial reduction in power usage but also significant performance gains relative to the uniform static approach. To the best of authors' knowledge, this is the first implementation and integration of power management solutions in OpenFOAM.

2017

Networks of Universities as a Tool for GCIO Education

Autores
Barbosa, LS; Santos, LP;

Publicação
Electronic Government - 16th IFIP WG 8.5 International Conference, EGOV 2017, St. Petersburg, Russia, September 4-7, 2017, Proceedings

Abstract
Networking and collaboration, at different levels and through differentiated mechanisms, have become increasingly relevant and popular as an effective means for delivering public policy over the past two decades. The variety of forms of collaboration that emerge in educational scenarios makes it hard to reach general conclusions about the effectiveness of collaboration in general and of inter-institutional networks in particular. The university environment is particularly challenging in this respect as typically different agendas for collaboration and competition co-exist and are often promoted by very same entities. Although no ‘one-fits-all’ model exists for the establishment of a network of universities, the prime result of the research reported in this paper is that the concept of such a network is a most promising instrument for delivering specific services within the high education universe. In this context, the paper discusses the potential of these networks for the design of educational programmes for the GCIO (Government Chief Information Officer) function and proposes a set of guidelines to successfully establish such networks. © 2017, IFIP International Federation for Information Processing.

2016

Exploring Heterogeneous Computing with Advanced Path Tracing Algorithms

Autores
Oliveira, A; Perdigao, C; Santos, LP; Proenca, A;

Publicação
2016 23RD PORTUGUESE MEETING ON COMPUTER GRAPHICS AND INTERACTION (EPCGI)

Abstract
The CG research community has a renewed interest on rendering algorithms based on path space integration, mainly due to new approaches to discover, generate and exploit relevant light paths while keeping the numerical integrator unbiased or, at the very least, consistent. Simultaneously, the current trend towards massive parallelism and heterogeneous environments, based on a mix of conventional computing units with accelerators, is playing a major role both in HPC and embedded platforms. To efficiently use the available resources in these and future systems, algorithms and software packages are being revisited and reevaluated to assess their adequateness to these environments. This paper assesses the performance and scalability of three different path based algorithms running on homogeneous servers (dual multicore Xeons) and heterogeneous systems (those multicore plus manycore Xeon and NVidia Kepler GPU devices). These algorithms include path tracing (PT), its bidirectional counterpart (BPT) and the more recent Vertex Connect and Merge (VCM). Experimental results with two conventional scenes (one mainly diffuse, the other exhibiting specular-diffuse-specular paths) show that all algorithms scale well across the different platforms, the actual scalability depending on whether shared data structures are accessed or not (PT vs. BPT vs. VCM).

2015

Efficient quadrature rules for illumination integrals: From quasi monte carlo to bayesian monte carlo

Autores
Marques, R; Bouville, C; Santos, LP; Bouatouch, K;

Publicação
Synthesis Lectures on Computer Graphics and Animation

Abstract
Rendering photorealistic images is a costly process which can take up to several days in the case of high quality images. In most cases, the task of sampling the incident radiance function to evaluate the illumination integral is responsible for an important share of the computation time. Therefore, to reach acceptable rendering times, the illumination integral must be evaluated using a limited set of samples. Such a restriction raises the question of how to obtain the most accurate approximation possible with such a limited set of samples. One must thus ensure that sampling produces the highest amount of information possible by carefully placing and weighting the limited set of samples. Furthermore, the integral evaluation should take into account not only the information brought by sampling but also possible information available prior to sampling, such as the integrand smoothness. This idea of sparse information and the need to fully exploit the little information available is present throughout this book. The presented methods correspond to the state-of-the-art solutions in computer graphics, and take into account information which had so far been underexploited (or even neglected) by the previous approaches. The intended audiences are Ph.D. students and researchers in the field of realistic image synthesis or global illumination algorithms, or any person with a solid background in graphics and numerical techniques. Table of Contents: Introduction / Spherical Fibonacci Point Sets for QMC Estimates of Illumination Integrals / Bayesian Monte Carlo for Global Illumination / Bibliography / Authors' Biographies Copyright © 2015 by Morgan & Claypool.

Teses
supervisionadas

2016

0

Autor
Rosária Maria Afonso Rodrigues de Melo

Instituição
UP-FCNA