JavaScript is disabled for your browser. Some features of this site may not work without it.
- DSpace Home >
- →
- Organismes déposants >
- →
- LIP - Laboratoire de l'Informatique du Parallélisme >
- →
- Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Issue Date >
Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Issue Date
Now showing items 1-20 of 483
-
(1992-03-30)(eng) In this paper we deal with a new high precision computation of the dot product. The key idea is to use hundreds of digit-serial arithmetic units that allow a massive digit-level pipelining. Parallel discrete-event ...
-
(1992-12-21)(eng) We study the computational capabilities of dynamical systems defined by iterated functions on [0,1]^n. The computations are performed with infinite precision on arbitrary real numbers, like in the model of analog ...
-
(1993)(eng) We give a Hoare-like proof system for the data-parallel language L, and we present an automatic tool to aid program correctness proof. After recalling L's operational semantics, we define an axiomatic semantics. We ...
-
(LIP, 1993-02)(eng) This document describes the INMOS IMS T9000, the latest member in the transputer family anf the IMS C104, a complete routing switch. This transputer combines a general purpose processor with a grouping of instructions, ...
-
(LIP, 1993-03)(eng) In this document we present the distributed memory computer ARCHIPEL VolVox IS-860 and different programming environments TROLLIUS 2.1, VOLCOM 1.0 and VOLCOM 2.0. We measure the performances for different levels of ...
-
(1993-05-18)(eng) In this paper, a set of definitions describing general real number representation systems is presented. Our purpose is to find a sufficiently wide model definition including classical systems (signed-digit notation,linear ...
-
(1993-08)(eng) It is easy to find errors and inefficient parts of a sequential program, by using a standard debugger/profiler, but there is no such tool in a parallel environment. The only way to study the race conditions of a ...
-
(1993-08-09)(eng) It is not easy to reach the best performances you can expect of a parallel computer. We therefore have to use monitoring programs to study the performances of parallel programs. We introduce here a way to generate ...
-
(1993-09)(eng) We design a new radix 2 (i.e., serial, most significant digit first) floating-point divider which performs its arithmetic operation in mode both for the exponent and the mantissa. We have performed parallel discrete-event ...
-
(1993-12-11)(eng) We present a strategy in order to build neural networks with long steady state periodic behavior. This strategy allows us to obtain 2^n non equivalent neural networks of size n, when the equivalence relation is the ...
-
(1994-01-13)(eng) Here, we deal with a new fine grain parallel-pipelined architecture made up of heterogeneous N arithmetic units (AUs). We present some main issues of such an architecture, including the model of computation, its ...
-
(1994-01-17)(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps using n processors. He gave an algorithm for the CREW PRAM model for which the constant in the running time is small. He ...
-
(1994-04-01)(eng) This report focuses on the compilation of the ``while'' loops in data-parallel languages for MIMD Shared Memory architectures. An efficient compilation must decrease the number of ``global synchronizations'' due to ...
-
(1994-05-27)(eng) Artificial neural networks may learn to solve arbitrary complex problems. But knowledge acquired is hard to exhibit. Thus neural networks appear as ``black boxes'', the decisions of which can't be explained. In this ...
-
(1994-06-02)(eng) We describe a simple data-parallel kernel language which encapsulates the main data-parallel control structures found in high-level languages such as MasPar's MPL or the recent HyperC. In particular, it includes the ...
-
(1994-06-27)(eng) We deal with the problem of partitioning and mapping uniform loop nests onto physical processor arrays. Resource constraints are taken into account: not only we assume a limited number of available processors, but ...
-
(1994-09-08)(eng) We present a confluent rewriting system wich extends a previous calculus for the Lambda-Calculus (Levy, Hardin) to Parigot's untyped Lambda-Mu-Calculus. This extension embeds the Lambda- Mu-Calculus as a sub-theory, ...
-
(1994-09-21)(eng) Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all the other nodes. A bus network is a network of processing ...
-
(LIP, 1994-10)(eng) PIMSy (stands for Parallel Implementation of a Monitoring System) is a tool to analyze distributed trace files. For all that, the generating phase, instead of generating one trace file while the program is executed, ...
-
(LIP, 1994-10)(eng) This documents presents the first version of the Bouclettes automatic parallelizer developed at LIP. It gives a detailed description of the functionalities and internal mechanics of the parallelizer, from the graphical ...
Now showing items 1-20 of 483
© INIST-CNRS Mentions légales | Protection des données personnelles | DSpace Software Copyright © 2002-2005 MIT |
