mirage

# Browsing Sciences Physiques et Mathématiques / Physics and Mathematics by Author "Laboratoire de l'informatique du parallélisme"

Sort by: Order: Results:

• (1997-10)
(eng) We show that proving lower bounds in algebraic models of computation may not be easier than in the standard Turing machine model. For instance, a superpolynomial lower bound on the size of an algebraic circuit solving ...
• (2000-11)
(eng) This paper presents upper bounds on the number of zeros and ones after the rounding bit for algebraic functions. These functions include reciprocal, division, square root, and inverse square root, which have been ...
• (2005-01)
(eng) We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n x n matrix of degree d over a field K we give a rank and nullspace ...
• (2000-12)
(eng) Scheduling the tasks of a distributed application has been an active field of research for several decades. The classic scheduling problem is to find a assignment of application tasks onto a set of distributed resources ...
• (2000-12)
(eng) 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, which requires ...
• (2000-02)
(eng) This paper is part of a general programme of treating explicit substitutions as the primary $\lambda$-calculi from the point of view of foundations as well as applications. Here we investigate the property of strong ...
• (2000-11)
(eng) This paper presents a survey of the state-of-the-art techniques and prototypes for streaming over the Internet. The basic principles are presented, the most important approaches (RTP, RTSP) are described.
• (2000-03)
(eng) Redundant notations are used implicitly or explicitly in many digital designs. They have been studied in details and a general framework is known to reduce the redundancy of a notation down to the minimally redundant ...
• (2000-02)
(eng) We consider the infinite versions of the usual computational complexity questions LogSpace?=P, NLogSpace?=P by studying the comparison of their descriptive logics on infinite partially ordered structures rather than ...
• (2000-03)
(eng) In this paper, we present LinuxActivation, an efficient system support for user level thread scheduling implemented within Linux. This work is an extension to the Scheduler Activations'' model (proposed by Anderson ...
• (2000-05)
(eng) The automatic detection of parallel loops is a well-known problem. Sophisticated polynomial algorithms have been proposed to produce code transformations that reveal parallel loops, in an optimal way as long as the ...
• (2000-01)
(eng) 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 networks of workstations, ...
• (2005-02)
(eng) 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 suggest several ...
• (2005-02)
(eng) Function ulp (acronym for unit in the last place) is frequently used for expressing errors in floating-point computations. We present several previously suggested definitions of that function, and analyse some of ...
• (2000-11)
(eng) 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 (namely, the range ...
• (2000-04)
(eng) We study the structure of the set of tilings of a polygon $P$ with bars of fixed length. We obtain a undirected graph connecting two tilings if one can pass from one tile to the other one by a flip (i. e a local ...
• (2005-03)
(eng) 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 destinations and service ...
• (2000-12)
(eng) This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for ...
• (2000-03)
(eng) 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 the sum of the s_i is ...
• (2005-03)
(eng) In this paper, we show how to design a perfect simulation for Markovian fork-join networks, or equivalently, free-choice Petri nets. For pure fork-join networks and for event graphs, the simulation time can be greatly ...