New extensions of Pairing-based Signatures into Universal Designated Verifier Signatures (2009)
Damien Vergnaud, École Normale
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly verifiable digital...
Intersection and Union Types in the (2008)
Daniel J. Dougherty, Silvia Ghilezan, École Normale, Supérieure Lyon
λµ�µ-calculus
Jean-Yves L’Excellent (INRIA) (2008)
École Normale, Supérieure Lyon, École Normale, Supérieure Lyon
Coherent load information mechanisms for distributed dynamic scheduling Abdou Guermouche (ENS Lyon), Jean-Yves L’Excellent (INRIA)
Evolution of parallel machines (2008)
Yves Robert, École Normale, Supérieure Lyon, Larry Carter, Henri Casanova, Jeanne Ferrante, ...
Evolution of parallel machines... and soon to the Holy Grid? Parallel algorithm design and scheduling were already difficult tasks with homogeneous machines Yves Robert Scheduling for Heterogeneous...
Reducibility: a ubiquitous method (2008)
Silvia Ghilezan, École Normale, Supérieure Lyon, Silvia Likavec
in lambda calculus with intersection types
Plug-in Scheduler Design for a Distributed Grid Environment (2008)
École Normale, Supérieure Lyon, Eddy Caron, Andréea Chis, Frédéric Desprez, Alan Su, ...
This report presents the approach chosen within the DIET (Distributed Interactive Engineering Toolbox) project a Grid-RPC environment to allow a resource broker to be tuned for specific application...
Jean-Yves L’Excellent (INRIA) (2008)
École Normale, Supérieure Lyon, École Normale, Supérieure Lyon
Optimal memory minimization algorithms for the multifrontal method Abdou Guermouche (ENS Lyon), Jean-Yves L’Excellent (INRIA)
SPI On-the-fly Range Reduction (2008)
École Normale, Supérieure Lyon, Vincent Lefèvre, École Normale, Supérieure Lyon, ...
In several cases, the input argument of an elementary function evaluation is given bit-serially, most significant bit first. We suggest a solution for performing the first step of the evaluation...
A general scheme for deciding the branchwidth (2008)
École Normale, Supérieure Lyon, Unité Mixte, Frédéric Mazoit Juin, École Normale, ...
A general scheme for deciding the branchwidth
dealing with code size expansion (2008)
École Normale, Supérieure Lyon, Thierry Bidault, Christophe Guillon, Florent Bouchez, Fabrice Rastello, ...
temporal-ordering information:
Cache-Optimised Methods for the Evaluation of Elementary Functions (2008)
École Normale, Supérieure Lyon, David Defour Octobre, École Normale, Supérieure Lyon, David Defour
The ratio between processor speed and memory speed frequently makes efficient use of cache memory a very important element in performance of user’s application. This is the case for many elementary...
Up-to Techniques for Weak Bisimulation (2008)
École Normale, Supérieure Lyon, Damien Pous Avril, École Normale, Supérieure Lyon, Damien Pous
Up-to techniques have been introduced to enhance the bisimulation proof method for establishing bisimilarity results. While up-to techniques for strong bisimilarity are well understood, in the weak...
École Normale, Supérieure Lyon, École Normale, Supérieure Lyon, Jean-michel Muller
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose order-1 coefficients are...
Optimizations of Client’s side communications in a Distributed File (2008)
École Normale, Supérieure Lyon, Brice Goglin, Loïc Prylli, Olivier Glück, École Normale, ...
This paper presents a study of the interaction between high-speed interconnects and a distributed file system client. We use our ORFA remote file access protocol and MYRINET network with the GM...
Devant la commission d’examen formée de: (2008)
École Normale, Supérieure Lyon, Paul Zimmermann, Marc Daumas Membre, William Kahan Membre, Laurent Théry Membre, ...
pour l’obtention du grade de
A VHDL LIBRARY OF OPERATORS FOR “REAL ” ARITHMETIC ON FPGAS (2008)
What Are Fpgas, École Normale, Supérieure De Lyon, Claude Bernard
matrix of programmable logic cells programmable routing matrix ring of I/O blocks embedded memory blocks • applications: rapid prototyping, small series, cryptography, signal processing,... ◮...
École Normale, Supérieure Lyon, Unité Mixte, Abdou Guermouche, École Normale, ...
A study of various load information exchange mechanisms for a distributed application using dynamic scheduling
Laboratoire de l’Informatique du Parallélisme (2008)
École Normale, Supérieure Lyon, Unité Mixte, Daniel Hirschkoff, Tom Hirschowitz, ...
Component-oriented programming with sharing: containment is not ownership
François Alter, Yasuyuki Matsushita, Xiaoou Tang, École Normale, Supérieure Cachan
intensity similarity measure in low-light conditions
Option Physique The Viscoelastic Properties of Individual Electro-spun Fibers (2008)
École Normale, Supérieure Lyon, Bernard Lyon, Coulais Corentin
Electrospinning is a method to spin fibers which was patented for textiles in 1934. Recent research improved the method and nanofibers can nowadays be produced. However, the mechanical properties of...
Parallelization of the TD(λ) Learning Algorithm (2008)
École Normale, Supérieure Cachan, Rémi Coulom
Running the TD(λ) algorithm for complex simulated tasks may take several days of computation time. In order to reduce this time, it is possible to take advantage of parallel computation...
Testing stationarity with surrogates — A one-class SVM approach (2008)
Jun Xiao, Pierre Borgnat, Patrick Fl, École Normale, Supérieure Lyon, Cédric Richard
An operational framework is developed for testing stationarity relatively to an observation scale, in both stochastic and deterministic contexts. The proposed method is based on a comparison between...
FORMATION Stage 2006-2007 Sciences de la Matière (2008)
Bousige Colin, École Normale, Supérieure Lyon L, Bernard Lyon, Option Physique, ...
Intercalation et structures mixtes Ge-Si dans des nanocages de type clathrates Caractérisation par diffraction X, spectroscopie Raman, modélisations et études à haute pression Les clathrates de...
Reducibility: a ubiquitous method (2008)
Silvia Ghilezan, École Normale, Supérieure Lyon, Silvia Likavec
in lambda calculus with intersection types
Pseudo-haptique 2D Manipulation d’objets virtuels (2008)
École Normale, Supérieure Lyon, Chantal Keller
Mesure de la pression sur table tactile
Abstract The Strange Complexity of Constrained Delaunay Triangulation (2008)
Nicolas Grislain, École Normale, Supérieure Lyon
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a...
Computation with classical sequents (2008)
Pierre Lescanne, École Normale, Supérieure Lyon
X is an untyped continuation-style formal language with a typed subset which provides a Curry-Howard isomorphism for a sequent calculus for implicative classical logic. X can also be viewed as a...
Alan Su, Frédéric Vivien, École Normale, Supérieure Lyon, École Normale, Supérieure Lyon, ...
when scheduling flows of divisible requests
Bi-criteria Pipeline Mappings for Parallel Image Processing (2008)
École Normale, Supérieure Lyon, Anne Benoit, Harald Kosch, Veronika Rehn-sonigo, Yves Robert, ...
Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonistic criteria should be optimized, such...
École Normale, Supérieure Lyon, Anne Benoit, Mourad Hakem, Yves Robert, École Normale, ...
Most list scheduling heuristics rely on a simple platform model where communication contention is not taken into account. In addition, it is generally assumed that processors in the systems are...
Straight-line computation of the polynomial (2007)
École Normale, École Normale, Supérieure Lyon, Supérieure Lyon, Claude-pierre Jeannerod, Claude-pierre Jeannerod, ...
matrix inverse
Compactness in Ginzburg-Landau Energy by Kinetic Averaging PIERRE-EMMANUEL JABIN AND (2007)
Benoît Berthame, École Normale, Supérieure Paris
We consider a Ginzburg-Landau energy for two dimensional divergence free fields appearing in the gradient theory of phase transition for instance. We prove that, as the relaxation parameter vanishes,...
Olivier Clatz, Dea Mathematiques, Ens Cachan, École Normale, Supérieure Cachan
procedure
École Normale, Supérieure Lyon, Romaric Guillier, Ludovic Hablot, École Normale, ...
Standard TCP faces some performance limitations in very high speed wide area networks, mainly due to a long end-to-end feedback loop and a conservative behaviour with respect to congestion. Many TCP...
École Normale, Supérieure Lyon, Loris Marchal, Frédéric Vivien, École Normale, Supérieure Lyon, ...
Offline and online scheduling of concurrent
Reducing the I/O Volume in an Out-of-core Sparse Multifrontal Solver (2007)
École Normale, Supérieure Lyon, Emmanuel Agullo, Abdou Guermouche, École Normale, Supérieure Lyon, ...
High performance sparse direct solvers are often a method of choice in various simulation problems. However, they require a large amount of memory compared to iterative methods. In this context,...
Fault Tolerant Scheduling of Precedence Task Graphs on Heterogeneous Platforms (2007)
École Normale, Supérieure Lyon, Anne Benoit, Mourad Hakem, Yves Robert, École Normale, ...
Fault tolerance and latency are important requirements in several applications which are time critical in nature: such applications require guaranties in terms of latency, even when processors are...
Multi-criteria scheduling of pipeline workflows (2007)
École Normale, Supérieure Lyon, Anne Benoit, Veronika Rehn-sonigo, Yves Robert, École Normale, ...
Multi-criteria scheduling of pipeline
A First Step Towards Automatically Building Network Representations (2007)
École Normale, Supérieure Lyon, Lionel Eyraud-dubois, Arnaud Legrand, Martin Quinson, Frédéric Vivien, ...
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must uses tools which...
Laboratoire de l’Informatique du Parallélisme (2007)
École Normale, Supérieure Lyon, Matthieu Gallet, Yves Robert, Frédéric Vivien, École Normale, ...
evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks”
Laboratoire de l’Informatique du Parallélisme (2007)
École Normale, Supérieure Lyon, Matthieu Gallet, Yves Robert, Frédéric Vivien, École Normale, ...
evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks”
Optimizing Latency and Reliability of Pipeline Workflow Applications (2007)
École Normale, Supérieure Lyon, Anne Benoit, Veronika Rehn-sonigo, Yves Robert, École Normale, ...
Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple application patterns such as pipeline graphs. The problem is even more complex when processors are subject...
Elementary transformation analysis for Array-OL (2007)
École Normale, Supérieure Lyon, Paul Feautrier, École Normale, Supérieure Lyon, Paul Feautrier
Array-OL is a high-level specification language dedicated to the definition of intensive signal processing applications. Several tools exist for implementing an Array-OL specification as a data...
Laboratoire de l’Informatique du (2006)
École Normale, Supérieure Lyon, Unité Mixte, Arnaud Legrand, Alan Su, ...
Minimizing the stretch when scheduling flows of divisible requests
Scheduling and data redistribution strategies on star platforms (2006)
École Normale, Supérieure Lyon, Loris Marchal, Veronika Rehn, Yves Robert, Frédéric Vivien, ...
Scheduling and data redistribution strategies on star platforms
École Normale, Supérieure Lyon, Unité Mixte, Yves Robert, Frédéric Vivien, ...
Scheduling communication requests traversing a switch: complexity and algorithms
Automatic middleware deployment planning on clusters (2006)
Pushpinder Kaur Chouhan, Pushpinder Kaur Chouhan, Holly Dail, Holly Dail, Eddy Caron, Eddy Caron, ...
The use of remotely distributed computing resources as a single system offers great potential for compute-intensive applications. Increasingly, users have access to hundreds or thousands of machines...
Revisiting Matrix Product on Master-Worker Platforms (2006)
École Normale, Supérieure Lyon, Jack Dongarra, Zhiao Shi, Frédéric Vivien, École Normale, ...
This paper is aimed at designing efficient parallel matrix-product algorithms for heterogeneous master-worker platforms. While matrix-product is wellunderstood for homogeneous 2D-arrays of processors...
École Normale, Supérieure Lyon, Victor Poupet Feb, École Normale, Supérieure Lyon, Victor Poupet
In this article we will focus on a famous open question about algorithmic complexity classes on one dimensional cellular automata, and we will show that if all problems recognizable in space n (where...
Impact of QoS on Replica Placement in Tree Networks (2006)
École Normale, Supérieure Lyon, Anne Benoit, Veronika Rehn, Yves Robert, École Normale, ...
This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and...
A Monitoring and Visualization Tool and Its Application for a Network Enabled Server Platform (2006)
École Normale, Supérieure Lyon, Raphaël Bolze, Eddy Caron, Frédéric Desprez, Georg Hoesch, ...
Monitoring grid platforms has recently gained a wide interest. This kind of platform highly distributed across different domains leads to several design and implementation problems. We have designed...
VoroNet: A scalable object network based on Voronoi tessellations (2006)
École Normale, Supérieure Lyon, Olivier Beaumont, Anne-marie Kermarrec, Loris Marchal, Etienne Rivière, ...
VoroNet: A scalable object network based on Voronoi tessellations
Laboratoire de l’Informatique du Parallélisme (2006)
École Normale, Supérieure Lyon, Unité Mixte, Sébastien Soudan, Pascale Primet, ...
Partage de bande passante et plan de contrôle optique dans les grilles
GDS: an Architecture Proposal for a Grid Data-Sharing (2005)
École Normale, Supérieure Lyon, Data-sharing Service, Gabriel Antoniu, Marin Bertier, Luc Bougé, ...
Grid computing has recently emerged as a response to the growing demand for resources (processing power, storage, etc.) exhibited by scientific applications. We address the challenge of sharing large...
École Normale, Supérieure Lyon, Unité Mixte, Larry Carter, Jeanne Ferrante, ...
Scheduling multiple bags of tasks on heterogeneous master-worker platforms: centralized versus distributed solutions
Use of A Network Enabled Server System for a Sparse Linear (2005)
École Normale, Supérieure Lyon, Eddy Caron, Frédéric Desprez, Christophe Hamerling, Chiara Puglisi-amestoy, ...
Solving systems of linear equations is one of the key operations in linear algebra. Many different algorithms are available in that purpose. These algorithms require a very accurate tuning to...
Automatic Middleware Deployment Planning on Clusters (2005)
École Normale, Supérieure Lyon, Eddy Caron, Pushpinder Kaur Chouhan, Holly Dail, École Normale, ...
The use of many distributed, heterogeneous resources as a large collective resource offers great potential and has become an increasingly popular idea. A key issue for these Grid platforms is...
Optimizing Network Resource Sharing in Grids (2005)
École Normale, Supérieure Lyon, Loris Marchal, Yves Robert, Jingdi Zeng, ...
While grid computing reaches further to geographically separated clusters, data warehouses, and disks, it poses demanding requirements on end-to-end performance guarantee. Its pre-defined...
DIET: A Scalable Toolbox to Build Network Enabled Servers on the Grid (2005)
École Normale, Supérieure Lyon, Eddy Caron, Frédéric Desprez, École Normale, Supérieure Lyon, ...
Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classical client-server or...
Multiplication Algorithms for Radix-2 RN-Codings and Two's Complement Numbers (2005)
École Normale, Supérieure Lyon, Jean-luc Beuchat, École Normale, Supérieure Lyon, Jean-luc Beuchat, ...
The RN-codings are particular cases of signed-digit representations, for which rounding to the nearest is always identical to truncation. In radix 2, Booth recoding is an RN-coding. In this paper, we...
Off-line and on-line scheduling on heterogeneous master-slave platforms Jean-François Pineau, (2005)
École Normale, Supérieure Lyon, Yves Robert, Frédéric Vivien, École Normale, Supérieure Lyon, ...
Off-line and on-line scheduling on heterogeneous master-slave platforms
Automatic Middleware Deployment Planning on Clusters (2005)
École Normale, Supérieure Lyon, Pushpinder Kaur Chouhan, Holly Dail, Eddy Caron, Frédéric Vivien, ...
The use of many distributed, heterogeneous resources as a large collective resource offers great potential and has become an increasingly popular idea. A key issue for these Grid platforms is...
École Normale, Supérieure Lyon, Gilles Villard, École Normale, Supérieure Lyon, Gilles Villard
We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form [8, 9, 16, 17]. We show...
The impact of heterogeneity on master-slave on-line scheduling (2005)
École Normale, Supérieure Lyon, Yves Robert, Frédéric Vivien, École Normale, Supérieure Lyon, ...
In this paper, we assess the impact of heterogeneity for scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communicate with a single...
Laboratoire de l’Informatique du Parallélisme (2005)
École Normale, Supérieure Lyon, Unité Mixte, Arnaud Legrand, Alan Su, ...
Minimizing the stretch when scheduling flows of biological requests
École Normale, Supérieure Lyon, Eddy Caron, Vincent Garonne, Andreï Tsaregorodtsev, École Normale, ...
In this paper we present a model and simulator for many clusters of heterogeneous PCs belonging to a local network. These clusters are assumed to be connected to each other through a global network...
Scheduling network requests with transmission window (2005)
École Normale, Supérieure Lyon, Loris Marchal, Yves Robert, Jingdi Zeng, École Normale, ...
We consider the problem of bulk data transfers and bandwidth sharing in the context of grid infrastructures. Grid computing empowers high-performance computing in a large-scale distributed...
Hardware/Software Interface for Multi-Dimensional Processor Arrays (2005)
École Normale, Supérieure Lyon, Alain Darte, Steven Derrien, Tanguy Risset, École Normale, ...
On most recent systems on chip, the performance bottleneck is the onchip communication medium, bus or network. Multimedia applications require a large communication bandwidth between the processor...
Second Order Function Approximation with a Single Small Multiplication (2004)
École Normale, Supérieure Lyon, Jérémie Detrey, École Normale, Supérieure Lyon, ...
This paper presents a new scheme for the hardware evaluation of elementary functions, based on a piecewise second order minimax approximation. The novelty is that this evaluation requires only one...
Complex Square Root with Operand Prescaling (2004)
École Normale, Supérieure Lyon, Milos Ercegovac, Jean-Michel Muller, École Normale, Supérieure Lyon, ...
We propose a radix- r digit-recurrence algorithm for complex squareroot. The operand is prescaled to allow the selection of square-root digits by rounding of the residual. This leads to a simple...
RN-coding of numbers: definition and some properties (2004)
École Normale, Supérieure Lyon, Peter Kornerup, Jean-Michel Muller, École Normale, Supérieure Lyon, ...
We define RN-codings as radix-# signed representations of numbers for which rounding to the nearest is always identical to truncation. After giving characterizations of such representations, we...
Correctly Rounded Multiplication By Arbitrary Precision Constants (2004)
École Normale, Supérieure Lyon, Nicolas Brisebarre, Jean-Michel Muller, École Normale, Supérieure Lyon, ...
We introduce an algorithm for multiplying a floating-point number x by a constant C that is not exactly representable in floating-point arithmetic. Our algorithm uses a multiplication and a fused...
RN-codes: algorithmes d'addition, de multiplication et d'élévation au carré (2004)
Jean-Luc Beuchat, Jean-Michel Muller, École Normale, Supérieure Lyon, École Normale, Supérieure Lyon
A property of the original Booth recoding is that the first non-zero digit following a 1 is necessarily and vice versa. This allows to prove that truncating the Booth recoding of a number x is...
Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks (2004)
École Normale, Supérieure Lyon, Unité Mixte, Alan Su, Frederic Vivien, ...
In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. We show that this problem lies in the divisible load framework. In this framework, we propose...
Some Functions Computable with a Fused-mac (2004)
École Normale, Supérieure Lyon, Jean-Michel Muller, École Normale, Supérieure Lyon, Sylvie Boldo, ...
The fused multiply accumulate instruction (fused-mac) that is available on some current processors such as the Power PC or the Itanium eases some calculations.
École Normale, Supérieure Lyon, Unité Mixte, Alan Su, Frédéric Vivien, ...
Off-line scheduling of divisible requests on an heterogeneous collection of databanks
heterogeneous processor rings (2004)
École Normale, Supérieure Lyon, Hélène Renard, Yves Robert, Frédéric Vivien, École Normale, ...
Data redistribution algorithms for
École Normale, Supérieure Lyon, Unité Mixte, Christoph Lauter, École Normale, ...
Fast correct rounding of elementary functions in double precision using double-extended arithmetic Florent de Dinechin,
Scheduling Tasks Sharing Files from Distributed Repositories (revised version) (2004)
École Normale, Supérieure Lyon, Arnaud Giersch, Yves Robert, Frédéric Vivien, École Normale, ...
This paper is devoted to scheduling a large collection of independent tasks onto a large distributed heterogeneous platform, which is composed of a set of servers. Each server is a processor cluster...
When double rounding is odd (2004)
École Normale, Supérieure Lyon, Guillaume Melquiond, École Normale, Supérieure Lyon, Sylvie Boldo, ...
Double rounding consists in a first rounding in an intermediate extended precision and then a second rounding in the working precision. The natural question is then of the precision and correctness...
Table-based polynomials for fast hardware function evaluation (2004)
École Normale, Supérieure Lyon, Jérémie Detrey, Florent De Dinechin, École Normale, Supérieure Lyon, ...
Many general table-based methods for the evaluation in hardware of elementary functions have been published. The bipartite and multipartite methods implement a first-order approximation of the...
Towards the post-ultimate libm (2004)
École Normale, Supérieure Lyon, Nicolas Gast, École Normale, Supérieure Lyon, Florent De Dinechin, ...
This article presents advances in the subject of double-precision correctly rounded elementary functions since the publication of the libultim mathematical library developed by Ziv at IBM. This...
Table-based polynomials for fast hardware function evaluation (2004)
École Normale, Supérieure Lyon, Jérémie Detrey, Florent De Dinechin, École Normale, Supérieure Lyon, ...
Many general table-based methods for the evaluation in hardware of elementary functions have been published. The bipartite and multipartite methods implement a first-order approximation of the...
Olivier Beaumont, Arnaud Legrand, (2004)
École Normale, Supérieure Lyon, Unité Mixte, Loris Marchal, Yves Robert, ...
Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms
Deadline Scheduling with Priority for Client-Server Systems on the Grid (2004)
École Normale, Supérieure Lyon, Eddy Caron, Pushpinder Kaur Chouhan, Frederic Desprez, École Normale, ...
We present algorithms for the scheduling sequential tasks on a Network Enabled Server (NES) environment. We have implemented the non-preemptive scheduling, since at the user level we cannot interrupt...
École Normale, Supérieure Lyon, Abdou Guermouche, École Normale, Supérieure Lyon
Memory-based scheduling for a parallel multifrontal solver
A tool for unbiased comparison between logarithmic and floating-point arithmetic (2004)
Jérémie Detrey, Florent Dinechin, École Normale, Supérieure Lyon
arithmetic
Laboratoire de l’Informatique du Parallélisme (2003)
École Normale, Supérieure Lyon, Unité Mixte, Olivier Beaumont, Arnaud Legrand, ...
Steady-state scheduling of task graphs on heterogeneous computing platforms
Performance Analysis of Remote File System Access over High Bandwidth Local Network (2003)
École Normale, Supérieure Lyon, Brice Goglin, Loïc Prylli, École Normale, Supérieure Lyon, ...
We study the performance of file servers, comparing NFS implementation in Linux to our experimental lightweight system called ORFA. The aim is to find out NFS bottlenecks in the case of high...
Laboratoire de l’Informatique du Parallélisme (2003)
École Normale, Supérieure Lyon, Unité Mixte, Arnaud Giersch, Yves Robert, ...
Scheduling tasks sharing files on heterogeneous clusters
École Normale, Supérieure Lyon, Unité Mixte, Yves Robert, Frédéric Vivien, ...
Static load-balancing techniques for iterative computations on heterogeneous clusters
Scheduling tasks sharing files from distributed repositories (2003)
École Normale, Supérieure Lyon, Arnaud Giersch, Yves Robert, Frédéric Vivien, École Normale, ...
Scheduling tasks sharing files from
Scheduling Distributed Applications: The SimGrid Simulation Framework (2003)
Arnaud Legrand, Loris Marchal, École Normale, Supérieure Lyon
Abstract — Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach is to...
The Strange Complexity of Constrained Delaunay Triangulation (2003)
Nicolas Grislain, École Normale, Supérieure Lyon
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a...
École Normale, Supérieure Lyon, Unité Mixte, Yves Robert, Frédéric Vivien, ...
Static load-balancing techniques for iterative computations on heterogeneous clusters
Digital Image Processing- DEA MVA (2003)
Olivier Commowick, Christophe Lenglet, Cécile Louchet, École Normale, Supérieure Cachan
As digital images become more widely used, digital image analysis must find more tools to
Quantum Automata and Algebraic Groups Harm Derksen, (2003)
École Normale, Supérieure Lyon, Unité Mixte, Emmanuel Jeandel, Pascal Koiran, ...
We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest:...
École Normale, Supérieure Lyon, École Normale, Supérieure Lyon
Abstract geometrical computation for Black hole computation (extended abstract) Jérôme Durand-Lose Avril 2004 The Black hole model of computation provides a computing power that goes beyond the...
Optimizing the translation out-of-SSA with renaming constraints (2003)
École Normale, Supérieure Lyon, F. Rastello, F. De Ferrière, C. Guillon, École Normale, ...
Optimizing the translation out-of-SSA with
(MUMPS Version 4.2 beta) Users ’ guide (2002)
École Normale, Supérieure Lyon, P. R. Amestoy, I. S. Duff, J. Koster, P. R. Amestoy, ...
This document describes the Fortran 90 and C user interface to MUMPS Version 4.2 beta, a software package for the solution of sparse systems of linear equations. We describe in detail the data...
On edge tricolorations of triangulations of simply connected (2002)
École Normale, Supérieure Lyon, Olivier Bodini, Eric Rémila, École Normale, Supérieure Lyon, ...
surfaces
Reducibility: a ubiquitous method in lambda calculus with intersection types (2002)
Silvia Ghilezan, École Normale, Supérieure Lyon, Silvia Likavec
A general reducibility method is developed for proving reduction properties of lambda terms typeable in intersection type systems with and without the universal type #. Su#cient conditions for its...
Minimal enclosing parallelepiped in 3D (2002)
École Normale, Supérieure Lyon, Frédéric Vivien, Nicolas Wicker, École Normale, Supérieure Lyon, ...
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n three-dimensional points. We give two mathematical properties of these parallelepipeds, from which we...
interval arithmetic and the MPFI library (2002)
École Normale, Supérieure Lyon, Unité Mixte
Motivations for an arbitrary precision interval arithmetic and the MPFI library N. Revol 3 and F. Rouillier 4
A Kleene Theorem for Piecewise Constant Signals Automata (extended abstract) (2002)
École Normale, Supérieure Lyon, Jérôme Durand-lose
In this paper, we consider timed automata for piecewise constant signals. In the model presented here, time elapses only during transitions; any constraint on clocks should be satisfied during all...
The Theory of Liouville Functions (2002)
École Normale, Supérieure Lyon, École Normale, Supérieure Lyon, Pascal Koiran, Pascal Koiran
A Liouville function is an analytic function H: C → C with a Taylor series � ∞ n=1 xn /an such the an’s form a “very fast growing ” sequence of integers. In this paper we exhibit the...
The Master-Slave Paradigm with Heterogeneous Processors (2001)
École Normale, Supérieure Lyon, Olivier Beaumont, Arnaud Legrand, Arnaud Legrand, Yves ROBERT .
me amount of processing. . initiated). . exclusive mode. . Pool of independent tasks to be processed by the p slaves. . All tasks are of same-size, i.e. they represent the same amount of processing....
A new numerical abstract domain based on difference-bound matrices (2001)
Antoine Miné, École Normale, Supérieure Paris
Abstract. This paper presents a new numerical abstract domain for static analysis by abstract interpretation. This domain allows us to represent invariants of the form (x − y ≤ c) and (±x ≤...
A Portable and Efficient Communication Library for High-Performance Cluster Computing (2000)
École Normale, Supérieure Lyon, Olivier Aumage, Luc Bougé, Alexandre Denis, Jean-françois Méhaut, ...
This paper introduces Madeleine II, a new adaptive and portable multiprotocol communication library. Madeleine II has the ability to control multiple network protocols (BIP, SISCI, VIA) and multiple...
MPICH/Madeleine: a True Multi-Protocol MPI for High Performance Networks (2000)
École Normale, Supérieure Lyon, Olivier Aumage, Guillaume Mercier, Raymond Namyst, École Normale, ...
This report introduces a version of MPICH handling efficiently different networks simultaneously. The core of the implementation relies on a device called ch mad which is based on a generic...
SPI A Portable and Efficient Communication Library for High-Performance Cluster Computing (2000)
École Normale, Supérieure Lyon, Olivier Aumage, Luc Bougé, Alexandre Denis, Jean-françois Méhaut, ...
This paper introduces Madeleine II, a new adaptive and portable multiprotocol communication library. Madeleine II has the ability to control multiple network protocols (BIP, SISCI, VIA) and multiple...
Nathalie Revol, École Normale, Supérieure Lyon, Della Dora, ...
• Ingénieur diploma of the ENSIMAG ( École Nationale Supérieure d’Informatique et de Mathématiques Appliquées de Grenoble) in 1990, with distinction.
De nability of Geometric Properties in Algebraically Closed Fields (1998)
Olivier Chapuis, Pascal Koiran July, École Normale, Supérieure Lyon, Olivier Chapuis, Pascal Koiran, ...
We prove that there exists no sentence F of the language of rings with an extra binary predicat I2 satisfying the following property: for every de nable set X C 2, X is connected if and only if...
The Table Maker's Dilemma (1998)
École Normale, Supérieure Lyon, Vincent Lefèvre, Jean-michel Muller, Arnaud Tisserand, École Normale, ...
The Table Maker's Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new...
SPI A few results on table-based methods (1998)
École Normale, Supérieure Lyon, École Normale, Supérieure Lyon, Jean-michel Muller
Table-based methods are frequently used to implement functions. We examine some methods introduced in the literature, and we introduce a generalization of the bipartite table method, named the...