Add to ORKGSIGLEINIST RP 10146 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
Parallel computation presents problems which are either nonexistent or trivial in the context of seq...
A correcting algorithm is one that receives an endless stream of corrections to its initial input da...
[[abstract]]We discuss how to design parallel algorithms based upon the divide-and-conquer strategy....
AbstractTwo “folk theorems” that permeate the parallel computation literature are reconsidered in th...
Technology trends are making the cost of data movement increasingly dominant, both in terms of energ...
A data-accumulating algorithm (d-algorithm for short) works on an input consid-ered as a virtually e...
The objective of this thesis is the unified investigation of a wide range of fundament...
This work is a small step on the direction of code portability over parallel and vector machines. Th...
Parallel computers with tens of thousands of processors are typically programmed in a data parallel ...
AbstractWe propose a set-theoretic model for parallelism. The model is based on separate distributio...
La quête de performance a été une constante à travers l'histoire des systèmes informatiques.Il y a p...
A part of investigation of problems in discrete mathematics involves using the computer. Such proble...
This chapter is an introduction to the area of parallel computation written in accordance with the g...
We must consider communication Algorithms have two kinds of costs: computation and communication mov...
Theme 1 - Reseaux et systemes. Projet ReMaPSIGLEAvailable at INIST (FR), Document Supply Service, un...
Parallel computation presents problems which are either nonexistent or trivial in the context of seq...
A correcting algorithm is one that receives an endless stream of corrections to its initial input da...
[[abstract]]We discuss how to design parallel algorithms based upon the divide-and-conquer strategy....
AbstractTwo “folk theorems” that permeate the parallel computation literature are reconsidered in th...
Technology trends are making the cost of data movement increasingly dominant, both in terms of energ...
A data-accumulating algorithm (d-algorithm for short) works on an input consid-ered as a virtually e...
The objective of this thesis is the unified investigation of a wide range of fundament...
This work is a small step on the direction of code portability over parallel and vector machines. Th...
Parallel computers with tens of thousands of processors are typically programmed in a data parallel ...
AbstractWe propose a set-theoretic model for parallelism. The model is based on separate distributio...
La quête de performance a été une constante à travers l'histoire des systèmes informatiques.Il y a p...
A part of investigation of problems in discrete mathematics involves using the computer. Such proble...
This chapter is an introduction to the area of parallel computation written in accordance with the g...
We must consider communication Algorithms have two kinds of costs: computation and communication mov...
Theme 1 - Reseaux et systemes. Projet ReMaPSIGLEAvailable at INIST (FR), Document Supply Service, un...
Parallel computation presents problems which are either nonexistent or trivial in the context of seq...
A correcting algorithm is one that receives an endless stream of corrections to its initial input da...
[[abstract]]We discuss how to design parallel algorithms based upon the divide-and-conquer strategy....