Entity

Time filter

Source Type

University of Technology of Compiègne, France

Barthou D.,Bordeaux Institute of Technology | Barthou D.,French Institute for Research in Computer Science and Automation | Jeannot E.,French Institute for Research in Computer Science and Automation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

We propose a new algorithm, called SPAGHETtI, for static scheduling tasks on an unbounded heterogeneous resources where resources belongs to different architecture (e.g. CPU or GPU). We show that this algorithm is optimal in complexity O(|E||A|2∈+∈|V||A|), where |E| is the number of edges, |V| the number of vertices of the scheduled DAG and |A| the number of architectures - usually a small value - and that it is able to compute the optimal makespan. Moreover, the number of resources to be used for executing the schedule is given by a linear time algorithm. When the resources are bounded we provide a method to reduce the number of necessary resources up to the bound providing a set of compromises between the makespan and the size of the infrastructure. © 2014 Springer International Publishing Switzerland.


Tahar M.,Bordeaux Institute of Technology | Wang T.Q.,Monash University | Guerra Medina M.F.,University of La Laguna | Gonzalez O.,University of La Laguna | Armstrong J.,Monash University
IEEE Communications Letters | Year: 2016

Experimental results demonstrating the use of diversity combining in an optical wireless system using asymmetrically clipped optical orthogonal frequency division multiplexing (ACO-OFDM) are presented. A standard white lighting LED of the type often used in visible light communications (VLC) is used as the transmitter. The experiments show that diversity combining gives an improvement of 2-3 dB, and that uncorrected DC offset in the receiver can cause diversity combining to fail, but that DC correction methods are effective. It is shown that diversity combining changes the frequency distribution of noise received on the even subcarriers. © 2016 IEEE.


Bezzaoucha S.,Bordeaux Institute of Technology | Marx B.,University of Lorraine | Marx B.,Nancy Research Center for Automatic Control | Maquin D.,University of Lorraine | And 3 more authors.
Journal of the Franklin Institute | Year: 2015

This work addresses the model reference tracking control problem. It aims to highlight the encountered difficulties and the proposed solutions to achieve the tracking objective. Based on a literature overview of linear and nonlinear reference tracking, the achievements and the limitations of the existing strategies are highlighted. This motivates the present work to propose clear control algorithms for perfect and approximate tracking controls of nonlinear systems described by Takagi-Sugeno models. First, perfect nonlinear tracking control is addressed and necessary structural conditions are stated. If these conditions do not hold, approximate tracking control is proposed and the choice of the reference model to be tracked as well as the choice of the criterion to be minimized are discussed with respect to the desired objectives. The case of constrained control input is also considered in order to anticipate and counteract the effect of the control saturation. © 2015 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.


Youssef T.,University of Bordeaux 1 | Woirgard E.,University of Bordeaux 1 | Azzopardi S.,Bordeaux Institute of Technology | Martineau D.,LABINAL POWER SYSTEMS | Meuret R.,LABINAL POWER SYSTEMS
2015 16th International Conference on Thermal, Mechanical and Multi-Physics Simulation and Experiments in Microelectronics and Microsystems, EuroSimE 2015 | Year: 2015

This paper focuses on the thin Nickel layer thicknesses. Thermal and mechanical behaviors of these thin layers in a power module are investigated. An approach is shown in order to present an improved modeling by considering the effect of these thin layers and by reducing time computation. © 2015 IEEE.


Bosilca G.,Tennessee Technological University | Bouteiller A.,Tennessee Technological University | Danalis A.,Tennessee Technological University | Faverge M.,Bordeaux Institute of Technology | And 2 more authors.
Computing in Science and Engineering | Year: 2013

New high-performance computing system designs with steeply escalating processor and core counts, burgeoning heterogeneity and accelerators, and increasingly unpredictable memory access times call for one or more dramatically new programming paradigms. These new approaches must react and adapt quickly to unexpected contentions and delays, and they must provide the execution environment with sufficient intelligence and flexibility to rearrange the execution to improve resource utilization. The authors present an approach based on task parallelism that reveals the application's parallelism by expressing its algorithm as a task flow. This strategy allows the algorithm to be decoupled from the data distribution and the underlying hardware, since the algorithm is entirely expressed as flows of data. This kind of layering provides a clear separation of concerns among architecture, algorithm, and data distribution. Developers benefit from this separation because they can focus solely on the algorithmic level without the constraints involved with programming for current and future hardware trends. © 2013 IEEE.

Discover hidden collaborations