Nonpreemptive scheduling of optical switches
A Kesselman, K Kogan - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
Many high-speed routers today use input-queuing (IQ) architectures with a crossbar
switching fabric based on optical technology. Packets in the input queues are divided into …
switching fabric based on optical technology. Packets in the input queues are divided into …
A mixed triangular and quadrilateral partition for fractal image coding
F Davoine, J Svensson… - … Conference on Image …, 1995 - ieeexplore.ieee.org
This paper presents a new partitioning scheme for fractal image coding, based on triangles
and quadrilaterals. The aim is to have the advantage of the triangles over the square and …
and quadrilaterals. The aim is to have the advantage of the triangles over the square and …
Strategic coloring of a graph
B Escoffier, L Gourves, J Monnot - International Conference on Algorithms …, 2010 - Springer
We study a strategic game where every node of a graph is owned by a player who has to
choose a color. A player's payoff is 0 if at least one neighbor selected the same color …
choose a color. A player's payoff is 0 if at least one neighbor selected the same color …
Messages scheduling for parallel data redistribution between clusters
We study the problem of redistributing data between clusters interconnected by a backbone.
We suppose that at most k communications can be performed at the same time (the value of …
We suppose that at most k communications can be performed at the same time (the value of …
Two fast and efficient message scheduling algorithms for data redistribution through a backbone
E Jeannot, F Wagner - 18th International Parallel and …, 2004 - ieeexplore.ieee.org
Summary form only given. We study the problem of redistributing in parallel data between
clusters interconnected by a backbone. This problem is a generalization of the well-known …
clusters interconnected by a backbone. This problem is a generalization of the well-known …
Non-preemptive scheduling of optical switches
Many high-speed routers today use input-queued (IQ) architectures with a crossbar
switching fabric based on optical technology. Packets in the input queues are divided into …
switching fabric based on optical technology. Packets in the input queues are divided into …
Parallel data redistribution over a backbone
In this report we study the general problem of parallel data redistribution over a network.
Given a set of communications between two parallel machines interconnected by a …
Given a set of communications between two parallel machines interconnected by a …
Strategic coloring of a graph
B Escoffier, L Gourvès, J Monnot - Internet mathematics, 2012 - Taylor & Francis
We study a strategic game in which every node of a graph is owned by a player who has to
choose a color. A player's payoff is 0 if at least one neighbor selected the same color; …
choose a color. A player's payoff is 0 if at least one neighbor selected the same color; …
On the max-weight edge coloring problem
We study the following generalization of the classical edge coloring problem: Given a
weighted graph, find a partition of its edges into matchings (colors), each one of weight …
weighted graph, find a partition of its edges into matchings (colors), each one of weight …
Non-preemptive scheduling in network elements
A Kesselman, K Kogan - US Patent 7,733,895, 2010 - Google Patents
(57) ABSTRACT A graph based on a data traffic matrix represents the occu pancy of a set of
virtual output queues to an optical crosspoint packet data Switch. Edges in the graph are …
virtual output queues to an optical crosspoint packet data Switch. Edges in the graph are …