One challenge in studying the speedup performance of evolutionary optimization techniques, particularly in differential evolution, is that many parameters including crossover rate, F, dimensionality, population size and the complexity of the objective function play an important role. In fact, these same parameters also effect the quality of the obtained results. Therefore, it is important to understand the interaction between these parameters in order to make good choices for these key parameters that drive both the quality and speedup metrics. Thus, the purpose of this paper is to show how parameters such as crossover rate, F, dimension, population size, and calls to evaluation functions can influence the speedup and the quality of solutions in a differential evolution algorithm in high dimension problems. The evaluation was done using a 2 k factorial analysis considering a Schwefel Benchmark Function in a Matlab implementation running on a general purpose GPU. Results have shown that a reasonable speedup can be reached taking into account a high level of programming, i.e., there are a good trade-off between the required effort to program on GPU in Matlab and the reached Speedup. On the other hand, results in terms of quality of solutions showed that CPU tends to produce better outcomes in some configurations.

This work presents a low-area scalable architecture for the Depth Modelling Mode 1 (DMM-1) encoder of the 3D High Efficiency Video Coding (3D-HEVC) standard, removing the refinement stage. This simplification causes a small BD-rate increase (0.09%) but a significant reduction in memory usage of 30%. The scalable architecture can support different block sizes. Synthesis results for ST 65 nm Standard Cells technology show that the designed structure is capable of reaching real-time processing of HD 1080 p videos for all block sizes.

Table-based routing is a common approach for a fault-tolerant Network-on-Chip (NoC). This approach is hard to scale, since the table size tends to grow according to the NoC size. To surpass this problem, some works, such as the Region-Based Routing (RBR), have proposed techniques for saving routing tables area. This work proposes an alternative routing technique finding among communication pairs selected by the RBR technique, shrinking the amount of bits used for setting up regions. The experimental results have shown that the proposed technique reduces the maximum and mean number of regions, decreasing the space used by routing tables, providing more scalable and efficient routing NoC.

Este artigo descreve a realização de um experimento de Coding DOJO nas disciplinas de Algoritmos e Organização e Arquitetura de Computadores junto as turmas de primeiro semestre do Bacharelado em Sistemas de Informação. Exigindo preparação prévia dos exercícios propostos aos alunos, os resultados sugerem que a maioria dos alunos se sentiram motivados com a atividade e demonstraram comportamento colaborativo. Observou-se, também, que estudantes com menor fluência em programação foram aceitos e assistidos pelos seus grupos de trabalho.