A many-core co-processor for embedded parallel computing on FPGA

Single processor architectures are unable to provide the required performance of high performance embedded systems. Parallel processing based on general-purpose processors can achieve these performances with a considerable increase of required resources. However, in many cases, simplified optimized parallel cores can be used instead of general-purpose processors achieving better performance at lower resource utilization. In this paper, we propose a configurable many-core architecture to serve as a co-processor for high-performance embedded computing on Field-Programmable Gate Arrays. The architecture consists of an array of configurable simple cores with support for floating-point operations interconnected with a configurable interconnection network. For each core it is possible to configure the size of the internal memory, the supported operations and number of interfacing ports. The architecture was tested in a ZYNQ-7020 FPGA in the execution of several parallel algorithms. The results show that the proposed many-core architecture achieves better performance than that achieved with a parallel generalpurpose processor and that up to 32 floating-point cores can be implemented in a ZYNQ-7020 SoC FPGA.

Sparse matrix multiplication on a reconfigurable many-core architecture

Sparse matrix-vector multiplication (SMVM) is a fundamental operation in many scientific and engineering applications. In many cases sparse matrices have thousands of rows and columns where most of the entries are zero, while non-zero data is spread over the matrix. This sparsity of data locality reduces the effectiveness of data cache in general-purpose processors quite reducing their performance efficiency when compared to what is achieved with dense matrix multiplication. In this paper, we propose a parallel processing solution for SMVM in a many-core architecture. The architecture is tested with known benchmarks using a ZYNQ-7020 FPGA. The architecture is scalable in the number of core elements and limited only by the available memory bandwidth. It achieves performance efficiencies up to almost 70% and better performances than previous FPGA designs.

Viscosity measurements of compressed liquid dipropyl and dibutyl adipates

The paper reports viscosity measurements of compressed liquid dipropyl (DPA) and dibutyl (DBA) adipates obtained with two vibrating wire sensors developed in our group. The vibrating wire instruments were operated in the forced oscillation, or steady-state mode. The viscosity measurements of DPA were carried out in a range of pressures up to 18. MPa and temperatures from (303 to 333). K, and DBA up to 65. MPa and temperature from (303 to 373). K, covering a total range of viscosities from (1.3 to 8.3). mPa. s. The required density data of the liquid samples were obtained in our laboratory using an Anton Paar vibrating tube densimeter and were reported in a previous paper. The viscosity results were correlated with density, using a modified hard-spheres scheme. The root mean square deviation of the data from the correlation is less than (0.21 and 0.32)% and the maximum absolute relative deviations are within (0.43 and 0.81)%, for DPA and DBA respectively. No data for the viscosity of both adipates could be found in the literature. Independent viscosity measurements were also performed, at atmospheric pressure, using an Ubbelohde capillary in order to compare with the vibrating wire results. The expanded uncertainty of these results is estimated as ±1.5% at a 95% confidence level. The two data sets agree within the uncertainty of both methods. © 2015 Published by Elsevier B.V.

Core language for web applications

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

Liquid crystal mobility and PDLC memory effects

Dissertation presented at Faculdade de Ciências e Tecnologia of Universidade Nova de Lisboa to obtain the Degree of Master in Chemical and Biochemical Engineering

Cochineal, a precious source of red: cochineal dyes characterization by high performance liquid chromatography with diode array detection and principal component analysis

Presented at Faculdade de Ciências e Tecnologias, Universidade de Lisboa, to obtain the Master Degree in Conservation and Restoration of Textiles

Development of new biomaterials based on liquid crystalline phases of cellulose derivatives

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do Grau de Mestre em Engenharia Biomédica

Significance of isolated hepatitis B core antibody in blood donors from São Paulo

The clinical significance of isolated anti-HBc is still a challenge. To elucidate the real importance of this finding in our blood donors, an investigation algorithm was tested. One hundred and twelve isolated anti-HBc seropositive blood donors underwent clinical evaluation and retesting of HBV markers. Those who presented repeatedly reactive isolated anti-HBc, received a single dose of hepatitis B recombinant vaccine to verify anti-HBs early response. A HBV-DNA determination by PCR was done for those who did not test positive to anti-HBs after vaccine. The level of anti-HBc was recorded as a ratio of the sample-to-cut-off values (S:C ratio) in 57 candidates at donation. Comparing true and false-positive anti-HBc results, the different S:C ratios of them were statistically significant and when less than 2, implying in a false-positive result probability over 80%. A high percent of false-positive results (16.07%) was verified after anti-HBc retesting. HBV immunity was characterized in 49.11%, either by anti-HBs detection in retesting (15.18%), or after a single dose HBV vaccination (33.93%). HBV-DNA was negative in all tested donors. In conclusion, this algorithm was useful to clarify the meaning of isolated anti-HBc in most of our blood donors.

Development of a piezoelectric biosensor based on PVDF films

Dissertação para obtenção do Grau de Mestre em Engenharia Química e Bioquímica

A framework for memory contention analysis in multi-core platforms

The last decade has witnessed a major shift towards the deployment of embedded applications on multi-core platforms. However, real-time applications have not been able to fully benefit from this transition, as the computational gains offered by multi-cores are often offset by performance degradation due to shared resources, such as main memory. To efficiently use multi-core platforms for real-time systems, it is hence essential to tightly bound the interference when accessing shared resources. Although there has been much recent work in this area, a remaining key problem is to address the diversity of memory arbiters in the analysis to make it applicable to a wide range of systems. This work handles diverse arbiters by proposing a general framework to compute the maximum interference caused by the shared memory bus and its impact on the execution time of the tasks running on the cores, considering different bus arbiters. Our novel approach clearly demarcates the arbiter-dependent and independent stages in the analysis of these upper bounds. The arbiter-dependent phase takes the arbiter and the task memory-traffic pattern as inputs and produces a model of the availability of the bus to a given task. Then, based on the availability of the bus, the arbiter-independent phase determines the worst-case request-release scenario that maximizes the interference experienced by the tasks due to the contention for the bus. We show that the framework addresses the diversity problem by applying it to a memory bus shared by a fixed-priority arbiter, a time-division multiplexing (TDM) arbiter, and an unspecified work-conserving arbiter using applications from the MediaBench test suite. We also experimentally evaluate the quality of the analysis by comparison with a state-of-the-art TDM analysis approach and consistently showing a considerable reduction in maximum interference.

Novel optical PVC probes for on-site detection/determination of fluoroquinolones in a solid/liquid interface: Application to the determination of Norfloxacin in aquaculture water

A novel optical disposable probe for screening fluoroquinolones in fish farming waters is presented, having Norfloxacin (NFX) as target compound. The colorimetric reaction takes place in the solid/liquid interface consisting of a plasticized PVC layer carrying the colorimetric reagent and the sample solution. NFX solutions dropped on top of this solid-sensory surface provided a colour change from light yellow to dark orange. Several metals were tested as colorimetric reagents and Fe(III) was selected. The main parameters affecting the obtained colour were assessed and optimised in both liquid and solid phases. The corresponding studies were conducted by visible spectrophotometry and digital image acquisition. The three coordinates of the HSL model system of the collected image (Hue, Saturation and Lightness) were obtained by simple image management (enabled in any computer). The analytical response of the optimised solid-state optical probe against concentration was tested for several mathematical transformations of the colour coordinates. Linear behaviour was observed for logarithm NFX concentration against Hue+Lightness. Under this condition, the sensor exhibited a limit of detection below 50 μM (corresponding to about 16 mg/mL). Visual inspection also enabled semi-quantitative information. The selectivity was ensured against drugs from other chemical groups than fluoroquinolones. Finally, similar procedure was used to prepare an array of sensors for NFX, consisting on different metal species. Cu(II), Mn(II) and aluminon were selected for this purpose. The sensor array was used to detect NFX in aquaculture water, without any prior sample manipulation.

Investigation on AUTOSAR-Compliant Solutions for Many-Core Architectures

As of today, AUTOSAR is the de facto standard in the automotive industry, providing a common software architec- ture and development process for automotive applications. While this standard is originally written for singlecore operated Elec- tronic Control Units (ECU), new guidelines and recommendations have been added recently to provide support for multicore archi- tectures. This update came as a response to the steady increase of the number and complexity of the software functions embedded in modern vehicles, which call for the computing power of multicore execution environments. In this paper, we enumerate and analyze the design options and the challenges of porting AUTOSAR-based automotive applications onto multicore platforms. In particular, we investigate those options when considering the emerging many- core architectures that provide a more scalable environment than the traditional multicore systems. Such platforms are suitable to enable massive parallel execution, and their design is more suitable for partitioning and isolating the software components.

Methodologies for the WCET Analysis of Parallel Applications on Many-core Architectures

Euromicro Conference on Digital System Design (DSD 2015), Funchal, Portugal.

Partitioning the Network-on-Chip to Enable Virtualization on Many-Core Processors

6th International Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.

Allocation of Parallel Real-Time Tasks in Distributed Multi-core Architectures supported by an FTT-SE Network

Distributed real-time systems such as automotive applications are becoming larger and more complex, thus, requiring the use of more powerful hardware and software architectures. Furthermore, those distributed applications commonly have stringent real-time constraints. This implies that such applications would gain in flexibility if they were parallelized and distributed over the system. In this paper, we consider the problem of allocating fixed-priority fork-join Parallel/Distributed real-time tasks onto distributed multi-core nodes connected through a Flexible Time Triggered Switched Ethernet network. We analyze the system requirements and present a set of formulations based on a constraint programming approach. Constraint programming allows us to express the relations between variables in the form of constraints. Our approach is guaranteed to find a feasible solution, if one exists, in contrast to other approaches based on heuristics. Furthermore, approaches based on constraint programming have shown to obtain solutions for these type of formulations in reasonable time.