Filipe Oliveira | Universidade do Minho (original) (raw)
Uploads
Papers by Filipe Oliveira
Online Analytical Processing (OLAP) systems, perform multidimensional analysis of business data a... more Online Analytical Processing (OLAP) systems, perform multidimensional analysis of business data and provides the capability for complex calculations, trend analysis, and sophisticated data modelling. Prior efforts have been made to prove that linear algebra (LA) is better suited than standard relational algebra(RA) for formalising and implementing queries in on-line multidimensional data analysis [1], however, further work needed to be develop in order to specify and optimize parallel execution of the LA workflow.
![Research paper thumbnail of Multi-core and Multi-Process Parallel Programming with Molecular Dynamic Algorithm [EN]](https://attachments.academia-assets.com/48437341/thumbnails/1.jpg)
](This report is a result of a study about Molecular Dynamic Algorithm (MD). In this work MD simula... more This report is a result of a study about Molecular Dynamic Algorithm (MD). In this work MD simulation source code written in C is provided. The goal of this work is study a MD program simulation, his sequential algorithm complexity, and implement a multi-core parallel version in two different programming paradigms: Shared Memory and Distributed memory. The shared memory version of MD will be achieved using OpenMP-an API for multi-platform shared-memory parallel programming in C/C++ and Fortran. The distributed version of MD will be achieved using MPI (Message Passing Interface) using OpenMPI an high performance message passing library. Initially, we'll study the program organization (with gprof and callgrind) and study his complexity. For all MD implementations we're going to produce a performance analysis using compute-641 node of SeARCH Cluster and draw some conclusions.
In a complex multi-core, multi-processor software developing environment , tracking the performan... more In a complex multi-core, multi-processor software developing environment , tracking the performance of the code can be a non-trivial task. We describe the usage of a visual performance model that has given considerable insight into the performance of the code and helped to trace a optimization time line for future code optimization. For code instrumentation we used PAPI[7], which is a program-ing interface for accessing hardware performance counters. PAPI events can count floating point operations, cycles, instructions and cache accesses. Triggering PAPI to start/stop counting for each algorithm and process event results is a good understanding of the algorithm performance.
Teaching Documents by Filipe Oliveira
—Many optimization problems have several equivalent mathematical models. In high performance comp... more —Many optimization problems have several equivalent mathematical models. In high performance computer science and mathematical optimization, it is often not apparent which of these models is most suitable for practical computation, in particular, when a certain application with a specific range of instance sizes is in focus. Our case study addresses the Travelling Salesman " Zero Cost Solution " Problem Solving throw randomly generated solutions and using simulated annealing. We were provided codes based on both alternatives. We injected a zero cost solution on a distance matrix, for a particular path. Computational results for real-world instances with up to 1000 nodes are reported. Index Terms—Travelling Salesman Problem – Randomly Generated Solutions – Simulated Annealing – Heuristics-Monte-Carlo
Drafts by Filipe Oliveira
Online Analytical Processing (OLAP) systems, perform multidimensional analysis of business data a... more Online Analytical Processing (OLAP) systems, perform multidimensional analysis of business data and provides the capability for complex calculations, trend analysis, and sophisticated data modelling. Prior efforts have been made to prove that linear algebra (LA) is better suited than standard relational algebra(RA) for formalising and implementing queries in on-line multidimensional data analysis [3] [1], however, further work needed to be develop in order to specify and optimize parallel execution of the LA workflow. The proposed solution focus on a parallel typed linear algebra approach, enumerating how the Linear Algebra operations are efficiently implemented, giving preliminary experimental results obtained with one cluster of Search6 using queries of the TPC-H Benchmark, and comparing the achieved results with a parallel relational algebra engine – PostgreSQL version 9.6. The first query of the TPC-H Benchmark was fully translated into LA operations to evaluate the performance of the Linear Algebra solution. As these experiments manage large amounts of data, two studies for sparse data representation were made in order to efficiently represent and access information in the LA approach. By analysing the query results, we concluded that LA is extremely efficient in executing large data workflows, with benefits as datasets increase versus the RA approach.
—In traditional networks, all connections and services get the same treatment. However, since net... more —In traditional networks, all connections and services get the same treatment. However, since network resources are limited, and the overall Internet only offers a " Best-Effort " approach, it is important to differentiate between connection classes, and to be able to treat them accordingly to standardised and well documented parameters. This exploratory essay focus on developing a comparative study of traffic control mechanisms in IP networks and corresponding parametrisation, using the Network Simulator NS-2. In order to do so, a test platform will be presented and several Diffserv parameters will be discussed.
Online Analytical Processing (OLAP) systems, perform multidimensional analysis of business data a... more Online Analytical Processing (OLAP) systems, perform multidimensional analysis of business data and provides the capability for complex calculations, trend analysis, and sophisticated data modelling. Prior efforts have been made to prove that linear algebra (LA) is better suited than standard relational algebra(RA) for formalising and implementing queries in on-line multidimensional data analysis [1], however, further work needed to be develop in order to specify and optimize parallel execution of the LA workflow.
This report is a result of a study about Molecular Dynamic Algorithm (MD). In this work MD simula... more This report is a result of a study about Molecular Dynamic Algorithm (MD). In this work MD simulation source code written in C is provided. The goal of this work is study a MD program simulation, his sequential algorithm complexity, and implement a multi-core parallel version in two different programming paradigms: Shared Memory and Distributed memory. The shared memory version of MD will be achieved using OpenMP-an API for multi-platform shared-memory parallel programming in C/C++ and Fortran. The distributed version of MD will be achieved using MPI (Message Passing Interface) using OpenMPI an high performance message passing library. Initially, we'll study the program organization (with gprof and callgrind) and study his complexity. For all MD implementations we're going to produce a performance analysis using compute-641 node of SeARCH Cluster and draw some conclusions.
In a complex multi-core, multi-processor software developing environment , tracking the performan... more In a complex multi-core, multi-processor software developing environment , tracking the performance of the code can be a non-trivial task. We describe the usage of a visual performance model that has given considerable insight into the performance of the code and helped to trace a optimization time line for future code optimization. For code instrumentation we used PAPI[7], which is a program-ing interface for accessing hardware performance counters. PAPI events can count floating point operations, cycles, instructions and cache accesses. Triggering PAPI to start/stop counting for each algorithm and process event results is a good understanding of the algorithm performance.
—Many optimization problems have several equivalent mathematical models. In high performance comp... more —Many optimization problems have several equivalent mathematical models. In high performance computer science and mathematical optimization, it is often not apparent which of these models is most suitable for practical computation, in particular, when a certain application with a specific range of instance sizes is in focus. Our case study addresses the Travelling Salesman " Zero Cost Solution " Problem Solving throw randomly generated solutions and using simulated annealing. We were provided codes based on both alternatives. We injected a zero cost solution on a distance matrix, for a particular path. Computational results for real-world instances with up to 1000 nodes are reported. Index Terms—Travelling Salesman Problem – Randomly Generated Solutions – Simulated Annealing – Heuristics-Monte-Carlo
Online Analytical Processing (OLAP) systems, perform multidimensional analysis of business data a... more Online Analytical Processing (OLAP) systems, perform multidimensional analysis of business data and provides the capability for complex calculations, trend analysis, and sophisticated data modelling. Prior efforts have been made to prove that linear algebra (LA) is better suited than standard relational algebra(RA) for formalising and implementing queries in on-line multidimensional data analysis [3] [1], however, further work needed to be develop in order to specify and optimize parallel execution of the LA workflow. The proposed solution focus on a parallel typed linear algebra approach, enumerating how the Linear Algebra operations are efficiently implemented, giving preliminary experimental results obtained with one cluster of Search6 using queries of the TPC-H Benchmark, and comparing the achieved results with a parallel relational algebra engine – PostgreSQL version 9.6. The first query of the TPC-H Benchmark was fully translated into LA operations to evaluate the performance of the Linear Algebra solution. As these experiments manage large amounts of data, two studies for sparse data representation were made in order to efficiently represent and access information in the LA approach. By analysing the query results, we concluded that LA is extremely efficient in executing large data workflows, with benefits as datasets increase versus the RA approach.
—In traditional networks, all connections and services get the same treatment. However, since net... more —In traditional networks, all connections and services get the same treatment. However, since network resources are limited, and the overall Internet only offers a " Best-Effort " approach, it is important to differentiate between connection classes, and to be able to treat them accordingly to standardised and well documented parameters. This exploratory essay focus on developing a comparative study of traffic control mechanisms in IP networks and corresponding parametrisation, using the Network Simulator NS-2. In order to do so, a test platform will be presented and several Diffserv parameters will be discussed.