SPI Confluent Vandermonde matrices using (2007)
Ecole Normale, Sup Lyon, Lamine Melkemi
Confluent Vandermonde matrices using Sylvester's structures
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Aumage, Olivier Aumage, ...
This paper introduces Madeleine II, an adaptive multi-protocol extension of the Madeleine portable communication interface. Madeleine II provides facilities to use multiple network protocols (VIA,...
Minimal Separators Vincent Bouchitt'e (2007)
Ecole Normale, Sup Lyon, Ioan Todinca, Ioan Todinca
We give a characterization of minimal triangulation of graphs using the notion of "maximal set of neighbor separators". We prove that if all the maximal sets of neighbor separators...
The Topological Entropy of Iterated Piecewise Ane Maps is Uncomputable (2007)
Superieure Lyon, Unite Mixte, Ecole Normale, Ecole Normale, Sup Lyon, ...
We show that it is impossible to compute (or even to approximate) the topological entropy of a continuous piecewise ane function in dimension 4. The same result holds for saturated linear functions...
for Generic Curves and a Decision Algorithm for the Limit Theory (2007)
Superieure Lyon, Unite Mixte, Natacha Portier September, Ecole Normale, Ecole Normale, ...
It was recently shown that the theories of generic algebraic curves converge to a limit theory as their degrees go to innity. In this paper we give quantitative versions of this result and other...
Some Improvements on Multipartite Table Methods (2007)
Unite Mixte, Ecole Normale, Sup Lyon, Florent De Dinechin, Florent De Dinechin, ...
This paper presents an unified view of most previous table-lookup-andaddition methods: bipartite tables, SBTM, STAM and multipartite method. This new definition allows a more accurate computation of...
On Ecient Parallelization of Line-Sweep Computations (2007)
Unite Mixte, Alain Darte, Robert Fowler, Ecole Normale, Sup Lyon, ...
Multipartitioning is a strategy for partitioning multi-dimensional arrays on a collection of processors. With multipartitioning, computations that require solving 1D recurrences along each dimension...
Superieure Lyon, Unite Mixte, Ecole Normale, Ecole Normale, Sup Lyon, ...
On the sensitivity of additive cellular automata in Besicovitch topologies
Loop Alignment for Memory Accesses Optimization (2007)
Unite Mixte, Ecole Normale, Sup Lyon, Antoine Fraboulet, Antoine Fraboulet, ...
Portable or embedded systems allow more and more complex applications like multimedia today. These applications and submicronic technologies have made the power consumption criterium crucial. We...
Simulations of graph automata (2007)
Unite Mixte, Ecole Normale, Sup Lyon, Codrin Nichitiu, Codrin Nichitiu
We state a definition of the simulation of graph automata, which are machines built by putting copies of the same finite-state automaton at the vertices of a regular graph, reading the states of the...
An optimal algorithm to generate tilings (2007)
Unite Mixte, Ecole Normale, Sup Lyon, Sebastien Desreux, Sebastien Desreux, ...
An optimal algorithm to generate
Algorithmic Issues on Heterogeneous Computing Platforms (2007)
Unite Mixte, Ecole Normale, Sup Lyon, Pierre Boulet, Pierre Boulet, ...
This paper discusses some algorithmic issues when computing with a heterogeneous network of workstations (the typical poor man's parallel computer). Dealing with processors of dierent speeds...
Optimizing the translation out-of-SSA with renaming constraints (2003)
Unite Mixte, Ecole Normale, Sup Lyon, F. Rastello, F. Rastello, ...
Static Single Assignment form is an intermediate representation, that uses -functions to merge values at each confluent points of the control flow graph. functions are not machine instructions and...
Optimizing the translation out-of-SSA with renaming constraints (2003)
Unite Mixte, Ecole Normale, Sup Lyon, F. Rastello, F. Rastello, ...
Static Single Assignment form is an intermediate representation, that uses -functions to merge values at each confluent points of the control flow graph. functions are not machine instructions and...
New Complexity Results on Array Contraction and Related Problems (2002)
Unite Mixte, Guillaume Huard October, Ecole Normale, Sup Lyon, Alain Darte, ...
this report, we focus on the theoretical aspects of the problem. We prove several NP-complete results that characterize precisely its complexity and we provide an integer linear programming...
A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers) (2001)
Unite Mixte, Vincent Boudet, Fabrice Rastello, Yves Robert, Ecole Normale, ...
This paper discusses some algorithmic issues when computing with a heterogeneous network of workstations (the typical poor man's parallel computer). How is it possible to eÆciently implement...
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms (2000)
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Beaumont, Olivier Beaumont, ...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s 1 ; s 2 ; : : : ; s p (such that P...
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms (2000)
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Beaumont Vincent, Olivier Beaumont, ...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s 1 ; s 2 ; : : : ; s p (such that P...
Heterogeneity Considered Harmful to Algorithm Designers (2000)
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Beaumont, Olivier Beaumont, ...
In this paper, we deal with algorithmic issues on heterogeneous platforms. We show that static scheduling and load-balancing strategies are absolutely needed to achieve good performances, in contrast...
Matrix-Matrix Multiplication on Heterogeneous Platforms (2000)
Unite Mixte, Ecole Normale, Sup Lyon, Olivier Beaumont, Olivier Beaumont, ...
In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous...
Laboratoire de l'Informatique du Parall elisme (2000)
Unite Mixte, Ecole Normale Superieure, Sup Lyon, Olivier Beaumont, Olivier Beaumont, ...
In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous platforms. In this context, processors speeds may well vary during the execution of a large kernel,...
Algorithmic Issues for (Distributed) Heterogeneous Computing Platforms (Extended Abstract) (1999)
Unite Mixte, Ecole Normale, Sup Lyon, Vincent Boudet, Vincent Boudet, ...
Vincent Boudet, Fabrice Rastello and Yves Robert March 1999 Research Report N o 1999-19 Ecole Normale Sup erieure de Lyon 46 Allee d'Italie, 69364 Lyon Cedex 07, France Telephone :...
Unite Mixte, Vincent Boudet Antoine, Ecole Normale, Sup Lyon, Antoine Petitet, ...
We study the implementation of dense linear algebra computations, such as matrix multiplication and linear system solvers, on two-dimensional (2D) grids of heterogeneous processors. For these...
Unite Mixte, Vincent Boudet Antoine, Ecole Normale, Sup Lyon, Antoine Petitet, ...
We study the implementation of dense linear algebra computations, such as matrix multiplication and linear system solvers, on two-dimensional (2D) grids of heterogeneous processors. For these...
Unite Mixte, Vincent Boudet, Ecole Normale, Sup Lyon, Antoine Petitet, ...
We study the implementation of dense linear algebra computations, such as matrix multiplication and linear system solvers, on two-dimensional (2D) grids of heterogeneous processors. For these...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Ecole Normale, Sup Lyon, Michel Cosnard, Michel Cosnard, Emmanuel Jeannot, Emmanuel Jeannot, ...
Scheduling large task graphs is an important issue in parallel computing since it allows the treatment of big size problems. In this report we tackle the following problem: how to schedule a task...
Alignment and distribution is NOT (always) NP-hard (1998)
Vincent Boudet Fabrice, Ecole Normale, Sup Lyon, Fabrice Rastello, Fabrice Rastello, Yves Robert, ...
In this paper, an efficient algorithm to simultaneously implement array alignment and data/computation distribution is introduced and evaluated. We re-visit previous work of Li and Chen [13, 14], and...
A Polynomial Time Incremental Learning Algorithm (1998)
Rajesh Parekh Codrin, Ecole Normale, Sup Lyon, Rajesh Parekh, Rajesh Parekh, Codrin Nichitiu, ...
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA) from labeled examples and membership queries. This algorithm is an extension of Angluin's ID...
Ecole Normale, Sup Lyon, Lamine Melkemi
In this paper, we show that the useful displacement structures constructed for polynomial Vandermonde matrices (see [8] in particular) can be naturally extended to confluent polynomial Vandermonde...
More on Scheduling Block-Cyclic Array Redistribution (1998)
Frédéric Desprez, Unite Mixte, Ecole Normale, Sup Lyon, ...
This article is devoted to the run-time redistribution of one-dimensional arrays that are distributed in a block-cyclic fashion over a processor grid. In a previous paper, we have reported how to...
A Geometrical Hierarchy of Graphs via Cellular Automata (1998)
Unite Mixte, Bruno Martin Octobre, Ecole Normale, Sup Lyon, Bruno Martin
Historically, cellular automata were defined on the lattices Z n , but the definition can be extended to bounded degree graphs. Given a notion of simulation between cellular automata defined on...
Cellular Automata as Languages Recognizers (1998)
Ecole Normale, Sup Lyon, Marianne Delorme, Marianne Delorme, Jacques Mazoyer, Jacques Mazoyer
Language recognition is a powerful tool to evaluate the computational power of devices. In case of cellular automata, a specific problematics appears in the one dimensional case where the space is...
A Few Results on Table-Based Methods (1998)
Unite Mixte, Ecole Normale, Sup 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...
An introduction to Cellular Automata (1998)
Ecole Normale, Sup Lyon, Marianne Delorme, Marianne Delorme, Marianne Delorme
We give basic definitions necessary to understand what are cellular automata, as well as to work with. Some efficient but sometimes problematic concepts as signal, simulation and universality, are...
Laboratoire de l'Informatique du Parallelisme (1998)
Ecole Normale Sup'erieure, Vincent Boudet, Ecole Normale, Sup Lyon, Fabrice Rastello, Fabrice Rastello, ...
this paper, an efficient algorithm to simultaneously implement array alignment and data/computation distribution is introduced and evaluated
A Study of End-User SCSI Disk Performance with Parallel and Non-parallel Files (1998)
Non-parallel Files, Ecole Normale, Sup Lyon, Robert Russell, Robert D. Russell, Robert D. Russell
This report describes a series of experiments to investigate the performance of SCSI disks as seen by the application programmer. The results show a significant performance loss, on the order of 50%,...
Application Interfaces to BPFS: a Basic Parallel File System (1998)
Ecole Normale, Sup Lyon, Robert Russell, Robert D. Russell
This report describes three application program interfaces to BPFS, a distributed, modular parallel file system designed for use on clusters of workstations. These interfaces are called API0, CLI,...
Luc Bouge, Multithreaded Environments, Ecole Normale, Sup Lyon
Due to their ever-growing success in the development of distributed applications, today's multithreaded environments have to be highly portable and efficient on a large variety of hardware. Most...
Vandermonde Confluent, Ecole Normale, Sup Lyon, Lamine Melkemi
In this paper, fast LU factorization algorithms, derived from the classical updating techniques, are proposed for some structured matrices. The importance of these algorithms lies in the fact that it...
Loop Partitioning versus Tiling for Cache-based Multiprocessors (1998)
Ecole Normale, Sup Lyon, Fabrice Rastello, Fabrice Rastello, Yves Robert, Yves Robert
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We improve recent results of Agarwal, Kranz and Natarajan [1] in several directions. We give a more...
Alignment and distribution is NOT (always) NP-hard (1998)
Vincent Boudet, Ecole Normale, Sup Lyon, Fabrice Rastello, Fabrice Rastello, Yves Robert, ...
In this paper, an efficient algorithm to simultaneously implement array alignment and data/computation distribution is introduced and evaluated. We re-visit previous work of Li and Chen [13, 14], and...