Directed acyclic graphs with the unique dipath property (2009)
Bermond, Jean-Claude, Cosnard, Michel, Pérennes, Stéphane
Let P be a family of dipaths of a DAG (Directed Acyclic Graph) G. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G,...
Directed acyclic graphs with the unique dipath property (2009)
Bermond, Jean-Claude, Cosnard, Michel, Pérennes, Stéphane
Let P be a family of dipaths of a DAG (Directed Acyclic Graph) G. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G,...
École des Mines de Nantes (2008)
Michel Cosnard, Jean Pierre Briot, Markku Sakkinen, Jean-paul Rigault, ...
Habilitation à diriger des recherches présentée devant: l’Université de Nice-Sophia Antipolis- Laboratoire I3S par:
LIP Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale, Suprieure Lyon, Michel Cosnard, Adresses Lectroniques
Unit de recherche associe au CNRS n1398 On NC-real complexity classes for additive circuits and their relations with NC
Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale, Suprieure Lyon, Olivier Bournez, Olivier Bournez, Michel Cosnard, Michel Cosnard
Unit de recherche associe au CNRS n1398 On the computational power and super-Turing capabilities of dynamical systems
Optimization in a Hierarchical Distributed Performance Monitoring System (2007)
Ling Shi, Olivier De Vel, Jiannong Cao, Michel Cosnard
Monitoring program execution in a distributed system can generate large quantities of data, and the collection and processing of the monitoring data is one of the primary factors that contribute to...
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computational individuals,...
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computational individuals,...
Resource Discovery in the Arigatoni Model. (2006)
Chand, Raphael, Liquori, Luigi, Cosnard, Michel
Arigatoni is a lightweight communication model for dynamic Resource Discovery. Inspired by the Publish/Subscribe paradigm, the Arigatoni model implements a Resource-Discovery Oriented Overlay...
Resource Discovery in the Arigatoni Model. (2006)
Chand, Raphael, Liquori, Luigi, Cosnard, Michel
Arigatoni is a lightweight communication model for dynamic Resource Discovery. Inspired by the Publish/Subscribe paradigm, the Arigatoni model implements a Resource-Discovery Oriented Overlay...
Resource Discovery in the Arigatoni Model. (2006)
Chand, Raphael, Liquori, Luigi, Cosnard, Michel
Arigatoni is a lightweight communication model for dynamic Resource Discovery. Inspired by the Publish/Subscribe paradigm, the Arigatoni model implements a Resource-Discovery Oriented Overlay...
Arigatoni>: Overlaying Internet via Low Level Network Protocols (2006)
Benza, Didier, Cosnard, Michel, Liquori, Luigi, Vesin, Marc
We design a lightweight communication model, called Arigatoni, with related architecture, that is suitable to deploy the Global Computing Paradig} over the Internet. Communication over the behavioral...
Arigatoni: Overlaying Internet via Low Level Network Protocols (2006)
Benza, Didier, Cosnard, Michel, Liquori, Luigi, Vesin, Marc
We design a lightweight communication model, called Arigatoni, with related architecture, that is suitable to deploy the Global Computing Paradig} over the Internet. Communication over the behavioral...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Pérennes, Stéphane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Resource Discovery in the Arigatoni Model. (2006)
Chand, Raphael, Liquori, Luigi, Cosnard, Michel
Arigatoni is a lightweight communication model for dynamic Resource Discovery. Inspired by the Publish/Subscribe paradigm, the Arigatoni model implements a Resource-Discovery Oriented Overlay...
Resource Discovery in the Arigatoni Model. (2006)
Chand, Raphael, Liquori, Luigi, Cosnard, Michel
Arigatoni is a lightweight communication model for dynamic Resource Discovery. Inspired by the Publish/Subscribe paradigm, the Arigatoni model implements a Resource-Discovery Oriented Overlay...
Arigatoni: Overlaying Internet via Low Level Network Protocols (2006)
Benza, Didier, Cosnard, Michel, Liquori, Luigi, Vesin, Marc
We design a lightweight communication model, called Arigatoni, with related architecture, that is suitable to deploy the Global Computing Paradig} over the Internet. Communication over the behavioral...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Pérennes, Stéphane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Perennes, Stephane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Perennes, Stephane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Optimal Solution of the Maximum All Request Path Grooming Problem (2005)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Pérennes, Stéphane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
04451 Abstracts Collection -- Future Generation Grids (2005)
Cosnard, Michel, Getov, Vladimir, Laforenza, Domenico, Reinefeld, Alexander
The Dagstuhl Seminar 04451 "Future Generation Grid" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl from 1st to 5th November 2004. The focus of the seminar was...
Using postordering and static symbolic factorization for parallel sparse LU (2000)
In this paper we present several improvements of widely used parallel LU factorization methods on sparse matrices. First we introduce the LU elimination forest and then we characterize the L, U...
The Komornik-Loreti constant is transcendental (2000)
Jean-paul Allouche, Michel Cosnard
ively 1) if the sum of the binary digits of n is even (respectively odd). This number q can be then obtained as the unique positive solution of 1 = P 1 n=1 ffi n q \Gamman . It is equal to...
Using Postordering and Static Symbolic Factorization for Parallel Sparse LU (1999)
Cosnard, Michel, Grigori, Laura
In this report we present several improvements of widely used parallel LU factorization methods on sparse matrices. First we characterize the L, U factors in terms of their corresponding LU...
Using Postordering and Static Symbolic Factorization for Parallel Sparse LU (1999)
Cosnard, Michel, Grigori, Laura
In this report we present several improvements of widely used parallel LU factorization methods on sparse matrices. First we characterize the L, U factors in terms of their corresponding LU...
Using Postordering and Static Symbolic Factorization for Parallel Sparse LU (1999)
Cosnard, Michel, Grigori, Laura
In this report we present several improvements of widely used parallel LU factorization methods on sparse matrices. First we characterize the L, U factors in terms of their corresponding LU...
Compact DAG Representation and Its Dynamic Scheduling (1999)
Michel Cosnard, Emmanuel Jeannot, Loria Inria Lorraine
Abstract Scheduling large task graphs is an important issue in parallel computing. In this paper we tackle the two following problems: (1) how to schedule a task graph, when it is too large to t into...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
SOPHIE: a Tool for Collecting PHiPAC Metrics Of C Code (1999)
Ecole Normale, Superieure Lyon, Thomas Peugeot, Unite Mixte, ...
In designing ecient software for High Performance Real Time embedded signal processing applications, several performance issues must be addressed prior and during implementation. We present a tool...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
Symbolic Partitionning and Scheduling of Parameterized Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computingsince it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task...
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...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Villiers Les Nancy, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computing since it allows to treat big size problems. In this paper we address the following problem: how to schedule a task graph, when...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot, Loria Inria Lorraine
Scheduling large task graphs is animportant issue in parallel computingsince it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task graph,...
Symbolic Partitioning and Scheduling of Parameterized Task Graphs (1998)
Michel Cosnard, Michel Cosnard, Emmanuel Jeannot, Emmanuel Jeannot, Tao Yang, Tao Yang
A parameterized task graph is a model of computation which is small and problem size independent (i.e. it requires the same amount of memory, whatever the size of the program parameters is). Here, we...
Symbolic Partitionning and Scheduling of Parameterized Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computing since it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task...
On the Computational Power of Dynamical Systems and Hybrid Systems (1996)
Olivier Bournez, Michel Cosnard
We explore the simulation and computational capabilities of discrete and continuous dynamical systems. We introduce and compare several notions of simulation between discrete and continuous systems....
On the computational power and super-turing capabilities of dynamical systems. (1995)
Bournez, Olivier, Cosnard, Michel
(eng) We explore the simulation and computational capabilities of dynamical systems. We first introduce and compare several notions of simulation between discrete systems. We give a general framework...
capabilities of dynamical systems (1995)
Ecole Normale, Supérieure Lyon, Olivier Bournez, Michel Cosnard, Olivier Bournez, Michel Cosnard
Unité de recherche associée au CNRS n°1398 On the computational power and super-Turing capabilities of dynamical systems
International Workshop on Parallel Algorithms and Architectures (1990)
Cosnard, Michel, Robert, Yves, Quinton, Patrice, Tchuente, Maurice
COSNARD, Michel, VALLET, Jean-Luc, KABBAJ, Farida
Le salage de l'anchois est pratiqué presque exclusivement dans les pays riverains de la Méditerranée et du golfe de Gascogne ainsi qu'en Argentine. Le poisson utilisé est l'anchois Engraulis...
Contributions à l'étude du comportement iteratif des transformations unidimensionnelles / (1983)
Thèse (Ph. D.)--Université scientifique et médicale de Grenoble, 1983.