Multiprocessor platform using LEON3 processor

The recent advances in embedded systems world, lead us to more complex systems with application specific blocks (IP cores), the System on Chip (SoC) devices. A good example of these complex devices can be encountered in the cell phones that can have image processing cores, communication cores, memory card cores, and others. The need of augmenting systems’ processing performance with lowest power, leads to a concept of Multiprocessor System on Chip (MSoC) in which the execution of multiple tasks can be distributed along various processors. This thesis intends to address the creation of a synthesizable multiprocessing system to be placed in a FPGA device, providing a good flexibility to tailor the system to a specific application. To deliver a multiprocessing system, will be used the synthesisable 32-bit SPARC V8 compliant, LEON3 processor.

Voltammetric oxidation of drugs of abuse II. Codeine and metabolites

The oxidation of codeine on glassy carbon electrodes has been studied in detail using differential pulse voltammetry. The results obtained using a glassy carbon electrode clearly show a much more complex oxidation mechanism than that previously reported when platinum and gold electrodes were used. To clarify the codeine oxidative profile, several metabolites and analogues of this alkaloid, codeine N-oxide, norcodeine, dihydrocodeine, acetylcodeine and 6- chlorodesoxycodeine, were synthesized and studied. It was deduced that the anodic waves observed in codeine oxidation are related to the presence of methoxy, hydroxy and tertiary amine groups. Due to the similarity of potentials at which these oxidative processes take place, at some pHs an overlap of peaks occurs and only one anodic wave is observed.

Removal of Cd(II), Zn(II) and Pb(II) from aqueous solutions by brown marine macro algae: kinetic modelling

Specific marine macro algae species abundant at the Portuguese coast (Laminaria hyperborea, Bifurcaria bifurcata, Sargassum muticum and Fucus spiralis) were shown to be effective for removing toxic metals (Cd(II), Zn(II) and Pb(II)) from aqueous solutions. The initial metal concentrations in solution were about 75–100 mg L−1. The observed biosorption capacities for cadmium, zinc and lead ions were in the ranges of 23.9–39.5, 18.6–32.0 and 32.3–50.4 mg g−1, respectively. Kinetic studies revealed that the metal uptake rate was rather fast, with 75% of the total amount occurring in the first 10 min for all algal species. Experimental data were well fitted by a pseudo-second order rate equation. The contribution of internal diffusion mechanism was significant only to the initial biosorption stage. Results indicate that all the studied macro algae species can provide an efficient and cost-effective technology for eliminating heavy metals from industrial effluents.

Optimization of Cu(II) biosorption onto ascophyllum nodosum by factorial design methodology

A Box–Behnken factorial design coupled with surface response methodology was used to evaluate the effects of temperature, pH and initial concentration in the Cu(II) sorption process onto the marine macroalgae Ascophyllum nodosum. The effect of the operating variables on metal uptake capacitywas studied in a batch system and a mathematical model showing the influence of each variable and their interactions was obtained. Study ranges were 10–40ºC for temperature, 3.0–5.0 for pH and 50–150mgL−1 for initial Cu(II) concentration. Within these ranges, the biosorption capacity is slightly dependent on temperature but markedly increases with pH and initial concentration of Cu(II). The uptake capacities predicted by the model are in good agreement with the experimental values. Maximum biosorption capacity of Cu(II) by A. nodosum is 70mgg−1 and corresponds to the following values of those variables: temperature = 40ºC, pH= 5.0 and initial Cu(II) concentration = 150mgL−1.

Soil remediation time to achieve clean-up goals II: influence of natural organic matter and water contents

This work reports a relatively rapid procedure for the forecasting of the remediation time (RT) of sandy soils contaminated with cyclohexane using vapour extraction. The RT estimated through the mathematical fitting of experimental results was compared with that of real soils. The main objectives were: (i) to predict the RT of soils with natural organic matter (NOM) and water contents different from those used in experiments; and (ii) to analyse the time and efficiency of remediation, and the distribution of contaminants into the soil matrix after the remediation process, according to the soil contents of: (ii1) NOM; and (ii2) water. For sandy soils with negligible clay contents, artificially contaminated with cyclohexane before vapour extraction, it was concluded that: (i) if the NOM and water contents belonged to the range of the prepared soils, the RT of real soils could be predicted with relative differences not higher than 12%; (ii1) the increase of NOM content from 0% to 7.5% increased the RT (1.8–13 h) and decreased the remediation efficiency (RE) (99–90%) and (ii2) the increase of soil water content from 0% to 6% increased the RT (1.8–4.9 h) and decreased the RE (99–97%). NOM increases the monolayer capacity leading to a higher sorption into the solid phase. Increasing of soil water content reduces the mass transfer coefficient between phases. Concluding, NOM and water contents influence negatively the remediation process, turning it less efficient and more time consuming, and consequently more expensive.

Optical fiber sensor for Hg(II) based on carbon dots

An optical fiber sensor for Hg(II) in aqueous solution based on sol–gel immobilized carbon dots nanoparticles functionalized with PEG200 and N-acetyl-l-cysteine is described. This sol–gel method generated a thin (about 750 nm), homogenous and smooth (roughness of 2.7±0.7 a˚ ) filmthat immobilizes the carbon dots and allows reversible sensing of Hg(II) in aqueous solution. A fast (less than 10 s), reversible and stable (the fluorescence intensity measurements oscillate less than 1% after several calibration cycles) sensor system was obtained. The sensor allow the detection of submicron molar concentrations of Hg(II) in aqueous solution. The fluorescence intensity of the immobilized carbon dots is quenched by the presence of Hg(II) with a Stern-Volmer constant (pH = 6.8) of 5.3×105M−1.

Adding value [valorization] to tannery fleshings: part II – effect of protein hydrolysates on leather dyeing

The tanning industry generates a high quantity of solid wastes. Therefore, there is a need to create valorization [added value] options for these wastes. The main objective of the present work was to study the effect of protein hydrolysates (HP) prepared from fleshings on leather dyeing. During previous studies it was found that the application of HP products, obtained from fleshings, in leather retannage intensified the colour of crust leather. In this work the CIELAB colour system was used to evaluate the effect of HP on retannage processes. The main conclusions of this study were: (i) HP can be used instead of a dicyanodiamide resin (Fortan DC) if the colour parameters of the standard procedure are to be maintained, and (ii) the replacement of an acrylic resin (Fortan A40) by glutaraldehyde-modified HP (GHP) results in a darker skin, and can therefore be interesting for the reduction of the quantity of dye used.

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

In this paper we survey the most relevant results for the prioritybased schedulability analysis of real-time tasks, both for the fixed and dynamic priority assignment schemes. We give emphasis to the worst-case response time analysis in non-preemptive contexts, which is fundamental for the communication schedulability analysis. We define an architecture to support priority-based scheduling of messages at the application process level of a specific fieldbus communication network, the PROFIBUS. The proposed architecture improves the worst-case messages’ response time, overcoming the limitation of the first-come-first-served (FCFS) PROFIBUS queue implementations.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

Interlaminar fracture characterization of a carbon-epoxy composite in pure mode II

The interlaminar fracture toughness in pure mode II (GIIc) of a Carbon-Fibre Reinforced Plastic (CFRP) composite is characterized experimentally and numerically in this work, using the End-Notched Flexure (ENF) fracture characterization test. The value of GIIc was extracted by a new data reduction scheme avoiding the crack length measurement, named Compliance-Based Beam Method (CBBM). This method eliminates the crack measurement errors, which can be non-negligible, and reflect on the accuracy of the fracture energy calculations. Moreover, it accounts for the Fracture Process Zone (FPZ) effects. A numerical study using the Finite Element Method (FEM) and a triangular cohesive damage model, implemented within interface finite elements and based on the indirect use of Fracture Mechanics, was performed to evaluate the suitability of the CBBM to obtain GIIc. This was performed comparing the input values of GIIc in the numerical models with the ones resulting from the application of the CBBM to the numerical load-displacement (P-) curve. In this numerical study, the Compliance Calibration Method (CCM) was also used to extract GIIc, for comparison purposes.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Task Assignment Algorithms for Heterogeneous Multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.