Cleanup of industrial effluents containing heavy metals: a new opportunity of valorising the biomass produced by brewing industry

Heavy metal pollution is a matter of concern in industrialised countries. Contrary to organic pollutants, heavy metals are not metabolically degraded. This fact has two main consequences: its bioremediation requires another strategy and heavy metals can be indefinitely recycled. Yeast cells of Saccharomyces cerevisiae are produced at high amounts as a by-product of brewing industry constituting a cheap raw material. In the present work, the possibility of valorising this type of biomass in the bioremediation of real industrial effluents containing heavy metals is reviewed. Given the autoaggregation capacity (flocculation) of brewing yeast cells, a fast and off-cost yeast separation is achieved after the treatment of metal-laden effluent, which reduces the costs associated with the process. This is a critical issue when we are looking for an effective, eco-friendly, and low-cost technology. The possibility of the bioremediation of industrial effluents linked with the selective recovery of metals, in a strategy of simultaneous minimisation of environmental hazard of industrial wastes with financial benefits from reselling or recycling the metals, is discussed.

Energy-conscious tasks partitioning onto a heterogeneous multi-core platform

Modern multicore processors for the embedded market are often heterogeneous in nature. One feature often available are multiple sleep states with varying transition cost for entering and leaving said sleep states. This research effort explores the energy efficient task-mapping on such a heterogeneous multicore platform to reduce overall energy consumption of the system. This is performed in the context of a partitioned scheduling approach and a very realistic power model, which improves over some of the simplifying assumptions often made in the state-of-the-art. The developed heuristic consists of two phases, in the first phase, tasks are allocated to minimise their active energy consumption, while the second phase trades off a higher active energy consumption for an increased ability to exploit savings through more efficient sleep states. Extensive simulations demonstrate the effectiveness of the approach.

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

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

Task partitioning and priority assignment for distributed hard real-time systems

In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley’s algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].