Time filter

Source Type

Bouchet A.,French Institute of Health and Medical Research | Bouchet A.,Joseph Fourier University | Bouchet A.,European Synchrotron Radiation Facility | Boumendjel A.,CNRS Molecular Pharmacochemistry Department | And 7 more authors.
Journal of Synchrotron Radiation | Year: 2012

Microbeam radiation therapy (MRT), a preclinical form of radiosurgery, uses spatially fractionated micrometre-wide synchrotron-generated X-ray beams. As MRT alone is predominantly palliative for animal tumors, the effects of the combination of MRT and a newly synthesized chemotherapeutic agent JAI-51 on 9L gliosarcomas have been evaluated. Fourteen days (D14) after implantation (D0), intracerebral 9LGS-bearing rats received either MRT, JAI-51 or both treatments. JAI-51, alone or immediately after MRT, was administered three times per week. Animals were kept up to 20 weeks after irradiation or sacrificed at D16 or D28 after treatment for cell cycle analysis. MRT plus JAI-51 increased significantly the lifespan compared with MRT alone (p = 0.0367). JAI-51 treatment alone had no effect on rat survival. MRT alone or associated with JAI-51 induced a cell cycle blockade in G2/M (p < 0.01) while the combined treatment also reduced the proportion of G0/G1 cells. At D28 after irradiation, MRT and MRT/JAI-51 had a smaller cell blockade effect in the G2/M phase owing to a significant increase in tumor cell death rate (<2c) and a proportional increase of endoreplicative cells (>8c). The combination of MRT and JAI-51 increases the survival of 9LGS-bearing rats by inducing endoreduplication of DNA and tumor cell death; further, it slowed the onset of tumor growth resumption two weeks after treatment. © 2012 International Union of Crystallography.

Dashti M.,Simon Fraser University | Fedorova A.,Simon Fraser University | Funston J.,Simon Fraser University | Gaud F.,Simon Fraser University | And 4 more authors.
International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS | Year: 2013

NUMA systems are characterized by Non-Uniform Memory Access times, where accessing data in a remote node takes longer than a local access. NUMA hardware has been built since the late 80's, and the operating systems designed for it were optimized for access locality. They co-located memory pages with the threads that accessed them, so as to avoid the cost of remote accesses. Contrary to older systems, modern NUMA hardware has much smaller remote wire delays, and so remote access costs per se are not the main concern for performance, as we discovered in this work. Instead, congestion on memory controllers and interconnects, caused by memory traffic from data-intensive applications, hurts performance a lot more. Because of that, memory placement algorithms must be redesigned to target traffic congestion. This requires an arsenal of techniques that go beyond optimizing locality. In this paper we describe Carrefour, an algorithm that addresses this goal. We implemented Carrefour in Linux and obtained performance improvements of up to 3.6 relative to the default kernel, as well as significant improvements compared to NUMA-aware patchsets available for Linux. Carrefour never hurts performance by more than 4% when memory placement cannot be improved. We present the design of Carrefour, the challenges of implementing it on modern hardware, and draw insights about hardware support that would help optimize system software on future NUMA systems. Copyright © 2013 ACM.

Yguel M.,French Institute for Research in Computer Science and Automation | Vasquez D.,ETH Zurich | Aycard O.,UJF | Siegwart R.,ETH Zurich | Laugier C.,French Institute for Research in Computer Science and Automation
Springer Tracts in Advanced Robotics | Year: 2011

The accuracy of Grid-based maps can be enhanced by putting a Gaussian in every cell of the map. However, this solution works poorly for coarse discretizations in multi-scale maps. This paper proposes a method to overcome the problem by allowing several Gaussians per cell at coarse scales. We introduce a multi-scale approach to compute an error measure for each scale with respect to the finer one. This measure constitutes the basis of an incremental refinement algorithm where the error is used to select the cells in which the number of Gaussians should be increased. As a result, the accuracy of the map can be selectively enhanced by making efficient use of computational resources. Moreover, the error measure can also be applied to compress a map by deleting the finer scale clusters when the error in the coarse ones is low. The approach is based on a recent clustering algorithm that models input data as Gaussians rather than points, as is the case for conventional algorithms. In addition to mapping, this clustering paradigm makes it possible to perform map merging and to represent feature hierarchies under a sound theoretical framework. Our approach has been validated with both real and simulated 3-D data. © 2011 Springer-Verlag.

Jecu C.,Schneider Electric | Alibert P.,Schneider Electric | Raison B.,UJF | Caire R.,Grenoble Institute of Technology | And 2 more authors.
IET Conference Publications | Year: 2013

This work is related to protection systems on MV distribution networks. Most of these grids are currently protected by a single relay on the beginning of each feeder. The Smart Grids necessity is becoming more and more a reality for the grids of tomorrow. These more complex grids with Distributed Generation (DG) interconnection could require a more complex protection system to achieve high quality service and enhance the grid stability. This work proposes non communicating, distributed distance relays. These deployed relays would divide the feeder in smaller protected areas leading to shorter outage occurrence and duration for loads and producers. The proposed method was tested on all types of grids with overhead lines, cables and mixed, for all several different neutral groundings of the HV/MV transformer with or without DG presence. This method is subject to a patent deposition in 2012.

Salaun G.,Grenoble Institute of Technology | Boyer F.,UJF | Coupaye T.,Orange Group | de Palma N.,UJF | And 2 more authors.
Innovations in Systems and Software Engineering | Year: 2013

Cloud applications are often complex distributed applications composed of multiple software components running on separate virtual machines. Setting up, (re)configuring, and monitoring these applications are complicated tasks because a software application may depend on several remote software and virtual machine configurations. These management tasks involve many complex protocols, which fully automate these tasks while preserving application consistency as well as some key properties. In this article, we present two experiences we had in formally specifying and verifying such protocols. The first one aims at designing a reconfiguration protocol of a component-based platform, intended as the foundation for building robust dynamic systems. The second aims at automating the configuration task of a set of virtual machines running a set of interconnected software components. Both applications are specified using the LNT process algebra and verified using the CADP verification toolbox. The use of formal specification languages and tools was a success. We conclude with a number of lessons we have learned while working on this topic in the last 3 years. © 2013 Springer-Verlag London.

Berthier N.,UJF | Berthier N.,Joseph Fourier University | Maraninchi F.,Grenoble Institute of Technology | Mounier L.,UJF
Proceedings of the ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) | Year: 2011

In embedded systems, controlling a shared resource like the bus, or improving a property like power consumption, may be hard to achieve when programming device drivers individually. There is a need for global resource control, taking decisions based on a centralized view of the devices' states. In this paper, we study power consumption in sensor networks, where the nodes are small embedded systems powered by batteries. We concentrate on the hardware/software architecture of a node, where significant gains can be achieved by controlling the consumption modes of the various devices globally. The architecture we propose involves a simple adaptation of the application level, to communicate with the hardware via a control layer. The control layer itself is built from a set of simple automata: the drivers of the devices, whose states correspond to power consumption modes, and a controller that enforces global properties. All these automata are programmed using a synchronous language, whose compiler performs static scheduling and produces a single piece of C code. We explain the approach in details, demonstrate its use with either Contiki or a traditional multithreading operating system, and report on our experiments. Copyright © 2011 ACM.

Abid R.,UJF | Abid R.,French Institute for Research in Computer Science and Automation | Salaun G.,Grenoble Institute of Technology | Salaun G.,French Institute for Research in Computer Science and Automation | And 2 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

Cloud applications are composed of a set of interconnected software components distributed over several virtual machines. There is a need for protocols that can dynamically reconfigure such distributed applications. In this paper, we present a novel protocol, which is able to resolve dependencies in these applications, by (dis)connecting and starting/stopping components in a specific order. These virtual machines interact through a publish-subscribe communication media and reconfigure themselves upon demand in a decentralised fashion. Designing such protocols is an error-prone task. Therefore, we decided to specify the protocol with the LNT value-passing process algebra and to verify it using the model checking tools available in the CADP toolbox. As a result, the introduction of formal techniques and tools help to deeply revise the protocol, and these improvements have been taken into account in the corresponding Java implementation. © 2013 Springer International Publishing.

Gindraud F.,UJF | Rastello F.,French Institute for Research in Computer Science and Automation | Cohen A.,French Institute for Research in Computer Science and Automation | Broquedis F.,Grenoble Institute of Technology
International Symposium on Memory Management, ISMM | Year: 2016

This paper presents a memory allocator targeting manycore architectures with distributed memory. Among the family of Multi Processor System on Chip (MPSoC), these devices are composed of multiple nodes linked by an on-chip network; most nodes have multiple processors sharing a small local memory. While MPSoC typically excel on their performance-per-Watt ratio, they remain hard to program due to multilevel parallelism, explicit resource and memory management, and hardware constraints (limited memory, network topology). Typical programming frameworks for MPSoC leave much targetspecific work to the programmer: combining threads or nodelocal OpenMP, software caching, explicit message passing (and sometimes, routing), with non-standard interfaces. More abstract, automatic frameworks exist, but they target large-scale clusters and do not model the hardware constraints of MPSoC. The memory allocator described in this paper is one component of a larger runtime system, called Givy, to support dynamic task graphs with automatic software caching and data-driven execution on MPSoC. To simplify the programmer's view of memory, both runtime and program data objects live in a Global Address Space (GAS). To avoid address collisions when objects are dynamically allocated, and to manage virtual memory mappings across nodes, a GAS-aware memory allocator is required. This paper proposes such an allocator with the following properties: (1) it is free of inter-node synchronizations; (2) its node-local performance match that of state-of-the-art shared-memory allocators; (3) it provides node-local mechanisms to implement inter-node software caching within a GAS; (4) it is well suited for small memory systems (a few MB per node). © 2016 ACM.

Pagano G.,French Institute for Research in Computer Science and Automation | Marangozova-Martin V.,UJF
EICS 2014 - Proceedings of the 2014 ACM SIGCHI Symposium on Engineering Interactive Computing Systems | Year: 2014

Trace analysis graphical user environments have to provide different views on trace data, in order to be effective in helping the comprehension of the traced application behavior. In this article we propose an open and modular software architecture, the FrameSoC workbench1, which defines clear principles for view engineering and for view consistency management. The FrameSoC workbench has been successfully applied in real trace analysis use cases. Copyright © 2014 ACM 978-1-4503-2725-1/14/06.

Pagano G.,French Institute for Research in Computer Science and Automation | Dosimont D.,French Institute for Research in Computer Science and Automation | Huard G.,UJF | Marangozova-Martin V.,UJF | Vincent J.-M.,UJF
Proceedings - IEEE 7th International Symposium on Embedded Multicore/Manycore System-on-Chip, MCSoC 2013 | Year: 2013

The growing complexity of embedded systems makes their behavior analysis a challenging task. In this context, tracing appears to be a promising solution as it provides relevant information about the system execution. However, trace management and analysis are hindered by the diversity of trace formats, the incompatibility of trace analysis methods, the problem of trace size and its storage as well as by the lack of visualization scalability. In this article we present FrameSoC, a new trace management infrastructure that solves these issues. It proposes generic solutions for trace storage and defines interfaces and plug in mechanisms for integrating diverse analysis tools. We illustrate the benefit of FrameSoC with a case study of a visualization module that provides representation scalability for large traces by using an aggregation algorithm. © 2013 IEEE.

Loading UJF collaborators
Loading UJF collaborators